Affiliation:
1. Naval University of Engineering
Abstract
The Distributed Constraint Optimization Problem (DCOP) is able to model a variety of distributed reasoning tasks that arise in multi-agent systems, and widely applying to distribute programming, scheduling and resource allocation etc. In order to solve the multi-depot vehicle routing problem (MDVRP) in distributed manner, this article show how DCOP can be used to model the MDVRP, and using existing various DCOP algorithm solve it base on Frodo simulation platform. We have evaluated the performances of various DCOP algorithms on an existing MDVRP.
Publisher
Trans Tech Publications, Ltd.
Reference19 articles.
1. G. Laporte, Y. Nobert, and D. Arpin, Optimal solutions to capacitated Multi-depot vehicler outing problems, Congressus Numerantium, 44(1984), p.283–292.
2. Jean-Franc¸ois Cordeau, Michel Gendreau, A tabu search heuristic for periodic and multi-depot vehicle routing problems, Networks, 30 (1998), p.105–119.
3. Sam R. Thangiah , Said Salhi, Genetic clustering: An adaptive heuristic for the multidepot vehicle routing problem, Applied Artificial Intelligence, 15(2001), p.361–383.
4. David Pisinger, Stefan Ropkea, A general heuristic for vehicle routing problems, Computers and OR, 34(2007), p.2403–2435.
5. William P. C. Ho, George T. S. Ho, Ping Ji, A hybrid genetic algorithm for the multi-depot vehicle routing problem, Engineering Applications of AI, 21(2008), p.548–557.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献