A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls
نویسندگان
چکیده
منابع مشابه
A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملsolving a stochastic multi-depot multi-objective vehicle routing problem by a simulated annealing
in this paper, a stochastic multi-depot multi-objective vehicle routing problem (vrp) is studied. based on observations in real-world problems, we develop an aspect of the problem, such as stochastic availability of routes. to solve the problem in this situation, a two-objective mathematical model is developed, in which the related objective functions are: (1) minimizing transportation costs an...
متن کاملcapacitated multi-depot vehicle routing problem with inter-depot routes
in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...
متن کاملA parallel improved ant colony optimization for multi-depot vehicle routing problem
This paper presents a method for solving multi-depot vehicle routing problem (MDVRP). First, a virtual central depot is added to transfer MDVRP to the multi-depot vehicle routing problem with the virtual central depot (V-MDVRP), which is similar to a vehicle routing problem (VRP) with the virtual central depot as the origin. An improved ant colony optimization with coarse-grain parallel strateg...
متن کاملSolving the Multi Depot Vehicle Routing Problem with Assignment Algorithm
The Vehicle Routing Problem (VRP) involves the design of a set of minimum cost vehicle routes, originating and terminating at a central depot, for a fleet of vehicles that services a set of customers with known demands. This study contains some information about Logistics and Supply Chain Management. In the second part Distribution Management, which is a more related subject with Vehicle Routin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2016
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2015.8.003