A parallel hybrid genetic algorithm on cloud computing for the vehicle routing problem with time windows

Proceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013

Volumn , Issue , 2013, Pages 2467-2472

  Ruela, André Siqueira ^a   Guimar̃aes, Frederico Gadelha ^a   Oliveira, Ricardo Augusto Rabelo ^b   Neves, Brayan ^b   Amorim, Vicente Peixoto ^b   Fraga, Larissa Maiara ^b  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b FEDERAL UNIVERSITY OF OURO PRETO   (Brazil)

Author keywords

Optimization on cloud computing; Parallel hybrid metaheuristics; VRPTW

Indexed keywords

COMPUTATIONAL TIME; ON-LINE APPLICATIONS; PARALLEL HYBRID-GENETIC ALGORITHMS; PARALLEL HYBRIDS; REAL-WORLD PROBLEM; SHARED RESOURCES; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VRPTW;

CYBERNETICS; GENETIC ALGORITHMS; WEB SERVICES;

CLOUD COMPUTING;

EID: 84893521260     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMC.2013.421     Document Type: Conference Paper

References (27)

1. L. D. Bodin, "A taxonomic structure for vehicle routing and scheduling problems, " Computers & Urban Society, vol. 1, no. 1, pp. 11 - 29, 1975. [Online]. Available: http://www.sciencedirect.com/science/article/ pii/0305709775900034.
2. B. Eksioglu, A. V. Vural, and A. Reisman, "The vehicle routing problem: A taxonomic review, " Computers & Industrial Engineering, vol. 57, no. 4, pp. 1472 - 1483, 2009. [Online]. Available: http://www. sciencedirect.com/science/article/pii/S0360835209001405.
3. M. M. Solomon, "Algorithms for the vehicle routing and scheduling problems with time window constraints, " Operations Research, vol. 35, pp. 254-265, 1987.
4. M. Savelsbergh, "Local search in routing problems with time windows, " Annals of Operations Research, vol. 4, pp. 285-305, 1985. [Online]. Available: http://dx.doi.org/10.1007/BF02022044.
5. M. Desrochers, J. Desrosiers, and M. Solomon, "A new optimization algorithm for the vehicle routing problem with time windows, " Oper. Res., vol. 40, no. 2, pp. 342-354, Mar. 1992. [Online]. Available: http://dx.doi.org/10.1287/opre.40.2.342.
6. J.-Y. Potvin and J.-M. Rousseau, "An exchange heuristic for routeing problems with time windows, " Journal of the Operational Research Society, vol. 45, pp. 1433-1446, 1995.
7. O. Braysy, G. Hasle, and W. Dullaert, "A multi-start local search algorithm for the vehicle routing problem with time windows, " European Journal of Operational Research, vol. 159, no. 3, pp. 586 - 605, 2004. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0377221703004351.
8. J.-Y. Potvin and J.-M. Rousseau, "A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, " European Journal of Operational Research, vol. 66, no. 3, pp. 331 - 340, 1993. [Online]. Available: http://www.sciencedirect.com/science/article/pii/ 0377221793902218.
9. Y. Rochat and E. Taillard, "Probabilistic diversification and intensification in local search for vehicle routing, " Journal of Heuristics, vol. 1, pp. 147-167, 1995. [Online]. Available: http://dx.doi.org/ 10.1007/BF02430370.
10. Z. J. Czech and P. Czarnas, "A parallel simulated annealing for the vehicle routing problem with time windows, " in 10th Euromicro Workshop on Parallel, Distributed and Network-basedProcessing, Canary Islands, Spain, January 2002, pp. 376-383.
11. D. Mester, "An evolutionary strategies algorithm for large scale vehicle routing problem with capacitate and time windows restrictions, " Working Paper, Institute of Evolution, University of Haifa, Israel, 2002.
12. D. Mester and O. Braysy, "Active guided evolution strategies for large-scale vehicle routing problems with time windows, " Computers & Operations Research, vol. 32, no. 6, pp. 1593 - 1614, 2005. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0305054803003605.
13. J. Homberger, H. Gehring, F. Hagen, L. Wirtschaftsinformatik, D.Hagen, and B. Deutschland, "Two evolutionary metaheuristics for the vehicle routing problem with time windows, " INFOR, vol. 37, pp. 297-318, 1999.
14. J. Berger, M. Barkaoui, and O. Braysy, "A parallel hybrid genetic algorithm for the vehicle routing problem with time windows, " Working paper, Defense Research Establishment Valcartier, Canada, 2001.
15. C. Prins, "A simple and effective evolutionary algorithm for the vehicle routing problem, " Computers & Operations Research, vol. 31, no. 12, pp. 1985 - 2002, 2004. [Online]. Available: http://www.sciencedirect. com/science/article/pii/S0305054803001588.
16. N. Labadi, P. Lacomme, and C. Prins, "A memetic algorithm for the heterogeneous fleet vrp, " in Proceedings of Odysseus 2006, E. B. et al. (Eds.), Ed. Univ. of Valencia, 2006, pp. 209-213.
17. C. Prins, "Two memetic algorithms for heterogeneous fleet vehicle routing problems, " Engineering Applications of Artificial Intelligence, vol. 22, no. 6, pp. 916 - 928, 2009, ¡ce:titleArtificial Intelligence Techniques for Supply Chain Management¡/ce:title¿. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0952197608001693.
18. Y. Chang and L. Chen, "Solve the vehicle routing problem with time windows via a genetic algorithm, " in Proceedings of the 6th AIMS International Conference, Poitiers, France, 2007, pp. 240-249.
19. M. Błocho and Z. J. Czech, "A parallel algorithm for minimizing the number of routes in the vehicle routing problem with time windows, " in Parallel Processing and Applied Mathematics, ser. Lecture Notes in Computer Science, R. Wyrzykowski, J. Dongarra, K. Karczewski, and J. Wásniewski, Eds. Springer Berlin Heidelberg, 2012, vol. 7203, pp. 255-265. [Online]. Available: http://dx.doi.org/10.1007/978-3-642-31464-3\26.
20. S. Ryza, "Solving hard problems with lots of computers, " 2012, undergraduate Honors Theses, Brown Computer Science. [Online]. Available: http://cs.brown.edu/research/pubs/theses/ugrad/2012/ryza.pdf.
21. S. Kumar and R. Panneerselvam, "A survey on the vehicle routing problem and its variants, " Intelligent Information Management, vol. 4, no. 3, pp. 66-74, 2012.
22. M. Gendreau and C. D. Tarantilis, Solving large-scale vehicle routing problems with time windows: The state-of-the-art. CIRRELT, 2010.
23. D. Wilson, K. Veeramachaneni, and U.-M. O'Reilly, "Cloud scale distributed evolutionary strategies for high dimensional problems, " in Applications of Evolutionary Computation, ser. Lecture Notes in Computer Science, A. Esparcia-Alcazar, Ed. Springer Berlin Heidelberg, 2013, vol. 7835, pp. 519-528. [Online]. Available: http://dx.doi.org/10.1007/978-3-642-37192-952.
24. W.-C. Chiang and R. A. Russell, "Simulated annealing metaheuristics for the vehicle routing problem with time windows, " Annals of Operations Research, vol. 63, no. 1, pp. 3-27, 1996.
25. S. R. Thangiah, "A hybrid genetic algorithms, simulated annealing and tabu search heuristic for vehicle routing problems with time windows, " Practical handbook of genetic algorithms, vol. 3, pp. 347-381, 1999.
26. P. Moscato et al., "On genetic crossover operators for relative order preservation, " C3P Report, vol. 778, 1989.
27. sintef. Top/vrptw: Best known solutions for the 100 customer instances of solomon's vrptw benchmark problems from 1987. SINTEF. [Online]. Available: http://www.sintef.no/Projectweb/TOP/VRPTW/Solomon-benchmark/100-customers/.