نتایج جستجو برای: se cvrp
تعداد نتایج: 184304 فیلتر نتایج به سال:
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
The Heterogeneous Fleet Vehicle Routing Problem (HFVRP) is an important variant of the classical Capacitated (CVRP) that aims to find routes minimize total traveling cost a heterogeneous fleet vehicles. This problem great interest given its importance in many industrial and commercial applications. In this paper, we present Adaptive Iterated Local Search (AILS) heuristic for HFVRP. AILS local s...
The successful application of Branch and Cut methods to the TSP has drawn attention also to the polyhedral properties of the symmetric capacitated vehicle routing problem, which is the capacitated counterpart of the TSP. We investigate three classes of valid inequalities for the CVRP, multistars, pathbin inequalities and hypotours and give computational results we obtained with a Branch and Cut...
the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...
In capacitated vehicle routing problem (CVRP), a fleet of vehicles with certain capacity starts at central depot and returns to this starting point after serving some customers by using the optimal set routes minimum cost. However, in real-life, environments may include obstacles such as holes, machines, or trees different sizes. research, CVRP extension is proposed that classical one for vario...
Last-mile delivery costs are increasingly growing due to the rapid growth in E-commerce and proliferation of online shopping especially after COVID-19 crisis. Integrating shared location systems with home has been a new trend tackling last mile challenges. This paper studies Capacitated Vehicle Routing Problem Delivery Options (CVRPDO). In this problem, customers can choose between picking up t...
The capacitated vehicle routing problem (CVRP) is an interesting combinatorial optimization task, which occurs frequently in real-world applications [28]. The problem deals with scheduling a fleet of vehicles to distribute goods between depots and customers. A set of routes for vehicles should be determined, which are in some sense optimal, e.g. the shortest or the cheapest. Certain constraints...
مسئله مسیریابی وسیله نقلیه ظرفیتدار (CVRP) یکی از مشهورترین مسائل بهینهسازی ترکیباتی است که تاکنون بسیار مورد توجه قرار گرفته شده است و امروزه توجه بسیاری از دانشمندان و محققین را به خود جلب کرده است. بنابراین بسیاری از روشهای دقیق، ابتکاری و فراابتکاری در دهههای اخیر برای حل آن ارائه شدهاند. در این مقاله، به علت ضعفهای موجود در الگوریتم نمونه مورچگان، نسخهای اصلاحی از این الگوریتم به نا...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید