Gossip algorithms for heterogeneous multi-vehicle routing problems

Nonlinear Analysis: Hybrid Systems

Volumn 10, Issue 1, 2013, Pages 156-174

  Franceschelli, Mauro ^a   Rosa, Daniele ^a   Seatzu, Carla ^a   Bullo, Francesco ^b  

^a UNIVERSITY OF CAGLIARI   (Italy)

^b Santa Barbara   (United States)

Author keywords

Distributed optimization; Gossip algorithms; Multi TSP; Vehicle routing

Indexed keywords

DISTRIBUTED OPTIMIZATION; GOSSIP ALGORITHMS; GOSSIP COMMUNICATIONS; GREEDY HEURISTICS; MULTI-TSP; ROUTING PROBLEMS; TASK ASSIGNMENT; TASK EXECUTIONS;

OPTIMIZATION; VEHICLE ROUTING;

ALGORITHMS;

EID: 84881231753     PISSN: 1751570X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.nahs.2013.03.001     Document Type: Article

References (27)

1. Gutin G., Punnen A.P. The Traveling Saleman Problem and its Variations. Series in Combinatorial Optimization 2002, vol. 12. Springer, Kluwer Academic Publishers.
2. Laporte G. The traveling salesman problem: an overview of exact and approximate algorithms. European Journal of Operational Research 1992, 59(2):231-247.
3. Lawler E.L., Lenstra J.K., Rinnooy-Kan A.H.G., Shmoys D.B. The Traveling Saleman Problem: A Guided Tour of Combinatorial Optimization. Wiley Series in Discrete Mathematics and Optimization 1985, John Wiley and Sons.
4. Dantzig G.B., Ramser J.H. The truck dispatching problem. Management Science 1959, 6(1):80-91.
5. Bektas T. The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 2006, 34(3):209-219.
6. Pisinger D., Ropke S. A general heuristic for vehicle routing problems. Computers & Operations Research 2007, 34(8):2403-2435.
7. Toth P., Vigo D. The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications 2002, vol. 9. SIAM.
8. Bullo F., Frazzoli E., Pavone M., Savla K., Smith S.L. Dynamic vehicle routing for robotic systems. Proceedings of the IEEE 2011, 99(9):1482-1504.
9. Laporte G. The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research 1992, 59(3):345-358.
10. Cordeau J.F., Gendreau M., Laporte G., Potvin J.Y., Semet F. A guide to vehicle routing heuristics. Journal of the Operational Research Society 2002, 53(5):512-522.
11. Fisher M.L., Jaikumar R. A generalized assignment heuristic for vehicle routing. Networks 1981, 11(2):109-124.
12. Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 1994, 40(10):1276-1290.
13. Laporte G., Gendreau M., Potvin J.Y., Semet F. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 2000, 7(4-5):285-300.
14. R. Nallusamy, K. Duraiswamy, R. Dhanalaksmi, P. Parthiban, Optimization of multiple vehicle routing problems using approximation algorithms, 2010. Arxiv Preprint . arxiv:1001.4197.
15. Carlsson J., Ge D., Subramaniam A., Wu A., Ye Y. Solving min-max multi-depot vehicle routing problem. Lectures on Global Optimization 2009, 55:31-46.
16. M. Franceschelli, D. Rosa, C. Seatzu, F. Bullo, A gossip algorithm for heteroeneous multi-vehicle routing problems, in: 4th IFAC Conf. on Analysis and Design of Hybrid Systems, Eindhoven, Netherlands, June 2012.
17. D. Rosa, M. Franceschelli, C. Seatzu, F. Bullo, A gossip based heuristic algorithm for heteroeneous multi-vehicle routing problems, in: 3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems, Santa Barbara, California, USA, September 2012.
18. D. Applegate, W. Cook, S. Dash, A. Rohe, Solution of a min-max vehicle routing problem. Forschungsinstitut für Diskrete Mathematik, Rheinische Friedrich-Wilhelms-Universität, 2001.
19. Laporte G. Fifty years of vehicle routing. Transportation Science 2009, 43(4):408-416.
20. Arkin E.M., Hassin R., Levin A. Approximations for minimum and min-max vehicle routing problems. Journal of Algorithms 2006, 59(1):1-18.
21. Franceschelli M., Giua A., Seatzu C. A gossip-based algorithm for discrete consensus over heterogeneous networks. IEEE Transactions on Automatic Control 2010, 55(5):1244-1249.
22. Few L. The shortest path and the shortest road through n points. Mathematika 1955, 2(2):141-144.
23. Karloff H.J. How long can a Euclidean traveling salesman tour be?. SIAM Journal on Discrete Mathematics 1989, 2(1):91-99.
24. Bullo F., Carli R., Frasca P. Gossip coverage control for robotic networks: dynamical systems on the space of partitions. SIAM Journal on Control and Optimization 2012, 50(1):419-447.
25. Carli R., Fagnani F., Speranzon A., Zampieri S. Communication constraints in the average consensus problem. Automatica 2008, 44(3):671-684.
26. C. Nilsson, Heuristics for the traveling salesman problem, Department of Computer Science, Linkoping University, 2003.
27. Christofides N. Worst-case analysis of a new heuristic for the travelling salesman problem, Technical Report, DTIC Document 1976.