Ant Colony optimization technique to Solve the min-max multi depot vehicle routing problem

Proceedings of the American Control Conference

Volumn , Issue , 2012, Pages 3980-3985

  Narasimha, Koushik S Venkata ^a   Kivelevitch, Elad ^a   Kumar, Manish ^a  

^a UNIVERSITY OF CINCINNATI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; MATLAB; VEHICLES;

ANT COLONY BASED ALGORITHMS; COMPUTATIONAL TIME; COMPUTER SIMULATION MODEL; EMERGENCY RESPONSE; LARGE SCALE DISASTERS; MULTI-DEPOT VEHICLE ROUTING PROBLEMS; PARTITIONING METHODS; TIME-CRITICAL APPLICATIONS;

VEHICLE ROUTING;

EID: 84869437496     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/acc.2012.6315583     Document Type: Conference Paper

References (19)

1. US Department of Labor, "Occupational Outlook Handbook", Bureau of Labor Statistics, 2010-11.
2. Toth,P., Vigo, D., "The Vehicle Routing Problem", Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, 2001.
3. Dantzig, G.B., Ramser J.H., "The truck dispatching problem", Management Science, Vol. 6:60, 1959.
4. Venkata Narasimha, K.S., Kumar, M., "Ant Colony Optimization Technique to Solve the Min-Max Single Depot Vehicle Routing Problem", American Control Conference(ACC), pp. 3257-3262, 2011.
5. nd International Conference on Metaheuristics, 1997.
6. Gillett, B.E., Johnson, J.G., "Multi-Terminal Vehicle-Dispatch Algorithm", Omega, vol.4, pp. 771-718, 1976.
7. Tillman, F., "The multiple terminal delivery problem with probabilistic demands", Transportation Science, vol. 3, pp. 192-204, 1969.
8. Chao, I.M., Golden, B., Wasil, E., "A new heuristic for the multidepot vehicle routing problem that improves upon best-known solutions", American Journal of Mathematical and Management Sciences, vol. 13, no. 3, pp. 371-406, 1993.
9. Laporte, G., Nobert, Y., Taillefer, S., "Solving a family of multi-depot vehicle routing and location-routing problems", Transportation Science, vol. 22, p.172, 1988.
10. Lim, A., Wang., "Multiple-Depot Vehicle Routing Problem: A One- Stage Approach", IEEE Transactions on Automation Science and Engineering, vol. 2, no. 4, pp. 397-402, 2005.
11. Carlsson, J., Ge, D., Subramaniam, A., Wu, A., Ye, Y., "Solving Min- Max Multi-Depot Vehicle Routing Problem", Fields Book on Global Optimization, 2007.
12. Stone, A.H., Tukey, J.W., "Generalized sandwich theorems", Duke Mathematical Journal, vol. 9, pp. 356-359, 1942.
13. Zivaljevic, R.T., "Topological Methods", Handbook of Discrete and Computational Geometry, chapter 11, pages 209-224, 1997.
14. Bespamyatnikh, S., Kirkpatrick, D.G., Snoeyink, J., "Generalizing Ham Sandwich Cuts to Equitable Subdivisions", Symposium on Computational Geometry (SoCG), pp. 49-58, 1999.
15. Carlsson, J., Armbruster, B., Ye, Y., "Finding equitable convex partitions of points in a polygon efficiently", ACM Transactions on Algorithms, vol. 6, issue 4, article no. 72, 2010.
16. Dorigo, M., Gambardella, L.M., "Ant Colonies for the Travelling Salesman Problem", BioSystems 43, pp. 73-81, 1997.
17. Beardwood, J., Halton, J.H., Hammersley, J.M., "The shortest path through many points", Proceedings of Cambridge Philosophical Society, vol. 55, pp. 299-327, 1959.
18. http://www.stanford.edu/class/msande310/handout.shtml
19. http://www.tsp.gatech.edu/concorde.html