A two-stage ant colony optimization algorithm for the vehicle routing problem with time windows

International Journal of Advancements in Computing Technology

Volumn 4, Issue 1, 2012, Pages 485-491

  Wu, Xudong ^a  

^a BEIHANG UNIVERSITY   (China)

Author keywords

Ant Colony Optimization; Local Search; VRPTW

Indexed keywords

ANT COLONY OPTIMIZATION ALGORITHMS; ANT-COLONY OPTIMIZATION; LOCAL SEARCH; LOCAL SEARCH METHOD; NP-HARD PROBLEM; NUMBER OF VEHICLES; OPTIMIZATION ALGORITHMS; TWO STAGE; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VRPTW;

HEURISTIC ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 84863011164     PISSN: 20058039     EISSN: 22339337     Source Type: Journal    
DOI: 10.4156/ijact.vol4.issue1.55     Document Type: Article

References (17)

1. Asim Munawar, Mohamed Wahib, Masaharu Munetomo, Kiyoshi Akama, "Implementation and Optimization of cGA+LS to solve Capacitated VRP over Cell/B.E. ", IJACT, Vol. 1, No. 2, pp. 16-28, 2009.
2. O. Bräysy Olli, Local search and variable neighborhood search algorithms for the vehicle routing problem with time windows, Doctor dissertation, University of Vaasa, Finland 2001.
3. O. Bräysy, H. Geir, "A multi-start local search algorithm for the vehicle routing problem with time windows", European Journal of Operational Research, vol. 159, pp.586-605, 2004.
4. O. Bräysy, Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms, Transportation Science, vol. 39, pp.104-118, 2005.
5. B. Bullnheimer, R.F. Hartl, C. Strauss, "A new rank based version of the ant system-a computational study", Central European J. Oper. Res. Econom, vol. 7, pp.25-38, 1999.
6. M. Dorigo, Optimization, learning, and natural algorithms, Ph.D. Thesis, Dip. Elettronica, Politecnico di Milano, Italy, 1992.
7. M. Dorigo, V. Maniezzo, A. Colorni, "The ant system:optimization by a colony of cooperating agents", IEEE Trans. Systems Man Cybernet. B, vol. 26, pp.29-42, 1996.
8. L.M. Gambardella, É. Taillard and G. Agazzi, MACS-VRPTW:A multiple ant colony system for vehicle routing problems with time windows, New Ideas in Optimization McGraw-Hill, London, UK, pp.63-76, 1999.
9. Geng-jia Wang, Yuan-Biao Zhang, Jia-Wei Chen, "A Novel Algorithm to Solve the Vehicle Routing Problem with Time Windows: Imperialist Competitive Algorithm", AISS, Vol. 3, No. 5, pp. 108-116, 2011.
10. J. Homberger, H. Gehring, "Two evolutionary metaheuristics for the vehicle routing problem with time windows", Metaheuristics for Location and Routing Problems. Information Systems and Operational Research, vol. 37 (Special issue), pp.297-318, 1999.
11. J. Homberger, H. Gehring, "A two-phase hybrid metaheuristic for the vehicle routing roblem with time windows", European Journal of Operational Research vol. 162, pp.220-238, 2005.
12. J. Lenstra, A. Rinnooy Kan, "Complexity of vehicle routing and scheduling problems", Networks vol. 11, pp.221-227, 1981.
13. C. Rego, "A subpath ejection method for the vehicle routing problem", Management Science, vol. 44, pp.1447-1459, 1998.
14. M. Reimann, K. Doerner, & R.F. Hartl, "D-ants: Savings based ants divide and conquer the vehicle routing problem", Computers & Operations Research, vol. 31, no. 4, pp.563-591, 2004.
15. L.M. Rousseau, M. Gendreau, G. Pesant, "Using constraint-based operators to solve the vehicle routing problem with time windows", Journal of Heuristics, vol. 8, pp.43-58, 2002.
16. M.M. Solomon, "Algorithms for the vehicle routing and scheduling problems with time window constraints", Oper. Res., vol. 35, pp.254-265, 1987.
17. Stützle Thomas, Holger H. Hoos, MAX-MIN Ant System, Future Generation Computer Systems, vol. 16, pp.889-914, 2000.