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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
