نتایج جستجو برای: echelon vehicle routing problem
تعداد نتایج: 1016755 فیلتر نتایج به سال:
In this work we investigate two variants of the Stochastic Vehicle Routing Problem: The Vehicle Routing Problem with Stochastic Demands and the Vehicle Routing Problem with Stochastic Demands and Customers. We show that under some moderate conditions there is an asymptotic equivalence between the Vehicle Routing Problem with Stochastic Demands and the Traveling Salesman Problem, as well as betw...
This paper presents an artificial bee colony (ABC) algorithm adjusted for the capacitated vehicle routing problem. The vehicle routing problem is an NP-hard problem and capacitated vehicle routing problem variant (CVRP) is considered here. The artificial bee metaheuristic was successfully used mostly on continuous unconstrained and constrained problems. Here this algorithm has been implemented ...
This paper deals with a real-life vehicle delivery routing problem, which is a seafood product delivery routing problem. Considering the features of the seafood product delivery routing problem, this paper formulated this problem as a multi-depot open vehicle routing problem. Since the multi-depot open vehicle routing problem is a very complex problem, a method is used to reduce the complexity ...
In the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. On the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. Effective transport activities are also one of the most important c...
Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...
In the past decades, vehicle routing problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle routing problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and th...
Waste clean-up after a disaster is one of the most critical tasks in response stage management. We develop model to minimise cost and duration waste considering using Temporary Disaster Management Sites (TDWMSs), which can store process before it sent final disposal sites. The problem that arises be seen as Multi-Period Two-echelon Location Routing Problem (MP-2ELRP) main decisions are location...
In this work, a two-echelon location-routing problem with time windows and transportation resource sharing (2E-LRPTWTRS) is solved by selecting facility locations optimizing vehicle routes. The optimal solutions improve the efficiency of logistics network based on geographical distribution service facilities customers. Furthermore, utilization maximized enabling strategies within among differen...
Vehicle routing problem (VRP) is real-world combinatorial optimization problem which determine the optimal route of a vehicle. Generally, to provide the efficient vehicle serving to the customer through different services by visiting the number of cities or stops, the VRP follows the Travelling Salesman Problem (TSP), in which each of vehicle visiting a set of cities such that every city is vis...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید