A hybrid meta-heuristic for multi-objective Vehicle Routing Problems with Time Windows

Computers and Industrial Engineering

Volumn 65, Issue 2, 2013, Pages 286-296

  Baños, Raúl ^a   Ortega, Julio ^a   Gil, Consolación ^b   Márquez, Antonio L ^b   De Toro, Francisco ^a  

^a UNIVERSITY OF GRANADA   (Spain)

^b UNIVERSITY OF ALMERÍA   (Spain)

Author keywords

Hybrid meta heuristics; Load imbalance; Multi objective optimization; Time windows; Travelling distance; Vehicle routing problems

Indexed keywords

BENCHMARKING; COMBINATORIAL OPTIMIZATION; FLEET OPERATIONS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; HYBRID VEHICLES; MULTIOBJECTIVE OPTIMIZATION; OPTIMIZATION; SIMULATED ANNEALING; VEHICLES;

HYBRID METAHEURISTICS; LOAD IMBALANCE; TIME WINDOWS; TRAVELLING DISTANCE; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

EID: 84893703258     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2013.01.007     Document Type: Article

References (40)

1. Alabas-Uslu, C, & Dengiz, B. (2011). A self-adaptive local search algorithm for the classical vehicle routing problem. Expert Systems with Applications, 38(7), 8990-8998.
2. Alba, E., & Dorronso, B. (2006). Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm. Information Processing Letters, 98(6), 225-230.
3. Alvarenga, G. B., Mateus, G. R., & de Tomic, G. (2007). A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Computers & Operations Research, 34(6), 1561-1584.
4. Banos, R., Ortega, J., Gil, C., Fernandez, A., & De Toro, F. (2011). A multi-start hybrid algorithm for vehicle routing problems with time windows. Online Conference on Soft Computing in Industrial Applications (WSC 16).
5. Banos, R., Gil, C., Ortega, J., & Montoya, F. G. (2004). A parallel multilevel metaheuristic for graph partitioning. Journal of heuristics, 10(3), 315-336.
6. Bochtis, D. D., & Sorensen, C. G. (2009). The vehicle routing problem in field logistics: part I. Biosystems Engineering, 104(4), 447-457.
7. Borgulya, I. (2008). An algorithm for the capacitated vehicle routing problem with route balancing. Central European Journal ofOperations Research, 16(4), 331-343.
8. Bräysy, O., Hasle, G., & Dullaert, W. (2004). A multi-start local search algorithm for the vehicle routing problem with time windows. European Journal of Operational Research, 159(3), 586-605.
9. Coello, C. A., Lamont, G. B., & Van Veldhuizen, D. A. (2007). Evolutionary algorithms for solving multi-objective problems. Genetic and evolutionary computation series. Springer.
10. Cordeau, J-F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal ofthe Operational Research Society, 52(8), 928936.
11. Dabia, S., Talbi, E-G., van Woensel, T., & de Kok, A. G. (2013). Approximating multi-objective scheduling problems. Computers & Operations Research. http:// dx.doi.org/10.1016/j.cor.2012.12.001.
12. Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80-91.
13. Deb, K. (2002). Multi-objective optimization using evolutionary algorithms. John Wiley & Sons.
14. Deb, K., Agrawal, S., Pratap, A., & Meyarivan, T. (2001). A fast elitist non-dominated sorting genetic algorithm for multiobjective optimization: NSGA-II. Lecture notes in computer science 1917 (pp. 849-858). Springer.
15. Eksioglu, B., Vural, A. V., & Reisman, A. (2009). The vehicle routing problem: A taxonomic review. Computers & Industrial Engineering, 57(4), 1472-1483.
16. El-Sherbeny, N. A. (2010). Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods. Journal of King Saud University (Science), 22(3), 123-131.
17. Figliozzi, M. A. (2010). An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transportation Research Part C, 18(5), 668-679.
18. Garcia-Najera, A., & Bullinaria, J. A. (2011). An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Computers & Operations Research, 38(1), 287-300.
19. Gendreau, M., & Potvin, J-Y. (Eds.). (2010). Handbook of metaheuristics. International series in operations research & management science (vol. 156, pp. erlag). Rome: Springer.
20. Ghoseiri, K., & Ghannadpou, S. F. (2010). Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Applied Soft Computing, 10(4), 1096-1107.
21. Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. New York: Addison Wesley.
22. Holland, J. (1975). Adaptation in natural and artificial systems. MIT Press.
23. Hosny, M. I., & Mumford, C. L. (2010). The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms. Journal ofHeuristics, 16(3), 417-439.
24. Jozefowiez, N., Semet, F., & Talbi, E-G. (2007). Target aiming Pareto search and its application to the vehicle routing problem with route balancing. Journal of Heuristics, 13(5), 455-469.
25. Jozefowiez, N., Semet, F., & Talbi, E-G. (2008). Multi-objective vehicle routing problems. European Journal ofOperational Research, 189(2), 293-309.
26. Jozefowiez, N., Semet, F., & Talbi, E-G. (2009). An evolutionary algorithm for the vehicle routing problem with route balancing. European Journal ofOperational Research, 195(3), 761-769.
27. Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680.
28. Kritikos, M. N., & Ioannou, G. (2010). The balanced cargo vehicle routing problem with time windows. International Journal ofProduction Economics, 123(1), 42-51.
29. Kuo, Y. (2010). Using simulated annealing to minimize fuel consumption for the time dependent vehicle routing problem. Computers & Industrial Engineering, 59(1), 157-165.
30. Lee, C-Y., Lee, Z-J., & Lin, S-W. (2008). An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem. Applied Intelligence, 32, 88-95.
31. Lenstra, J. K., & Rinnooy Kan, A. H. G. R. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11, 221-227.
32. Mester, D., & Bräysy, O. (2007). Active-guided evolution strategies for large-scale capacitated vehicle routing problem. Computers & Operations Research, 34(10), 2964-2975.
33. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A., & Teller, E. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21 (6), 1087-1092.
34. Nagata, Y., Bräysy, O., & Dullaert, W. (2010). A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research, 37(4), 724-737.
35. Scheffermann, R., Bender, M., & Cardeneo, A. (2009). Robust solutions for vehicle routing problems via evolutionary multiobjective optimization. In Proceedings of IEEE congress on evolutionary computation (CEC'09), Trondheim, Norway (pp. 1605-1612).
36. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254-265.
37. Tan, K. C., Chew, Y. H., & Lee, L. H. (2006). A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Computational Optimization and Applications, 34(1), 115-151.
38. While, L., Hingston, P., Barone, L., & Huband, S. (2006). A faster algorithm for calculating hypervolume. IEEE Transactions on Evolutionary Computation, 10(1), 29-38.
39. Zitzler, E., Laumanns, M., & Thiele, L. (2001). SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization. In Proceedings of evolutionary methods for design, optimisation, and control, Barcelona, Spain (pp. 95-100).
40. Zitzler, E., & Thiele, L. (1999). Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3(4), 257-271.