[1]
G. Laporte, Y. Nobert, and D. Arpin, Optimal solutions to capacitated Multi-depot vehicler outing problems, Congressus Numerantium, 44(1984), p.283–292.
Google Scholar
[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.
DOI: 10.1002/(sici)1097-0037(199709)30:2<105::aid-net5>3.0.co;2-g
Google Scholar
[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.
DOI: 10.1080/08839510151087293
Google Scholar
[4]
David Pisinger, Stefan Ropkea, A general heuristic for vehicle routing problems, Computers and OR, 34(2007), p.2403–2435.
DOI: 10.1016/j.cor.2005.09.012
Google Scholar
[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.
DOI: 10.1016/j.engappai.2007.06.001
Google Scholar
[6]
Dariusz Barbucha , Piotr Je¸drzejowicz, An agent-based approach to vehicle routing problem, WASET, 26(2007), p.36–41.
Google Scholar
[7]
A.E. Rizzoli, R. Montemanni, E. Lucibello, Ant colony optimization for real-world vehicle routing problems: From theory to applications, Swarm Intelligence, (2007), p.135–151.
DOI: 10.1007/s11721-007-0005-x
Google Scholar
[8]
Thomas Leaute , Brammert Ottens , Boi Faltings, Ensuring Privacy through Distributed Computation in Multiple-Depot Vehicle Routing Problems", Proceedings of the ECAI'10 Workshop on Artificial Intelligence and Logistics (AILog, 10), Lisbon, Portugal, (2010).
Google Scholar
[9]
P. Modi, W. Shen, M. Tambe, M. Yokoo, ADOPT: asynchronous distributed constraint optimization with quality guarantees, Artificial Intelligence, 161(2005), pp.149-180.
DOI: 10.1016/j.artint.2004.09.003
Google Scholar
[10]
A. Petcu, B. Faltings, A Scalable Method for Multiagent Constraint Optimization. In proceedings of IJCAI 05, (2005), pp.266-271.
Google Scholar
[11]
Matsui T, Matsuo H, Improvement of efficiency in pseudo-tree based distributed best first search, IAENG International Journal of Computer Science, 34(2007), pp.73-77.
Google Scholar
[12]
Yeoh W, Koenig S, Felner A, IDB-ADOPT: A Depth-First Search DCOP Algorithm, Computer Science( 2009), pp.132-146.
DOI: 10.1007/978-3-642-03251-6_9
Google Scholar
[13]
W. Yeoh, A. Felner, S. Koenig, Bnb-ADOPT: An asynchronous branch-and-bound DCOP algorithm, Proc. of AAMAS, (2008), p.591–598.
DOI: 10.1613/jair.2849
Google Scholar
[14]
M. Silaghi ,M. Yokoo, Nogood-based asynchronous distributed optimization (ADOPT-ng), Proc. of AAMAS, (2006), p.1389–1396.
DOI: 10.1145/1160633.1160894
Google Scholar
[15]
Thomas Leaute, Brammert Ottens, Radoslaw Szymanek, FRODO 2. 0: An open-source framework for distributed constraint optimization, In Hirayama et al , (2010), p.160–164. http: /liawww. epfl. ch/frodo.
Google Scholar
[16]
Adrian Petcu, Boi Faltings, O-DPOP: An algorithm for open/distributed constraint optimization", in Proc. of the 21st National Conf. on Artificial Intelligence (AAAI, 06), (2006), p.703–708.
Google Scholar
[17]
Brammert Ottens, Boi Faltings, Coordinating agent plans through distributed constraint optimization", in Proceedings of the ICAPS'08 Multiagent Planning Workshop (MASPLAN, 08), (2008).
Google Scholar
[18]
Boi Faltings, Thomas Leaute, and Adrian Petcu, Privacy guarantees through distributed constraint satisfaction", in Proceedings of the 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology(IAT, 08), (2008), p.350–358.
DOI: 10.1109/wiiat.2008.177
Google Scholar
[19]
Adrian Petcu , Boi Faltings, S-DPOP: Superstabilizing, faultcontaining multiagent combinatorial optimization", in Proc. of the 20th National Conference on A.I. (AAAI, 05), (2005), p.449–454.
Google Scholar