Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem
نویسندگان
چکیده
منابع مشابه
Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem
The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization pro...
متن کاملDevelopment of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کامل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...
متن کامل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...
متن کاملThe Multi-Depot Vehicle Routing Problem with Inter-Depot Routes
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2018
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0193751