Multi-objective microzone-based vehicle routing for courier companies: From tactical to operational planning

European Journal of Operational Research

Volumn 242, Issue 1, 2015, Pages 222-231

  Janssens, Jochen ^a   Van Den Bergh, Joos ^a   Sörensen, Kenneth ^a   Cattrysse, Dirk ^b  

^a UNIVERSITY OF ANTWERP   (Belgium)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Courier companies; Metaheuristics; Multi objective optimization; Variable neighborhood tabu search; Vehicle routing; Workload balancing

Indexed keywords

MULTIOBJECTIVE OPTIMIZATION; TABU SEARCH; VEHICLE ROUTING;

DISTRIBUTION COMPANIES; EFFECTIVE ALGORITHMS; META HEURISTICS; MULTI OBJECTIVE; MULTI-OBJECTIVE OPTIMIZATION PROBLEM; OPERATIONAL PLANNING; VEHICLE ROUTING PROBLEMS; WORKLOAD BALANCING;

VEHICLES;

EID: 84920730650     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.09.026     Document Type: Article

References (38)

1. Bodie, Z., Kane, A., & Marcus, A. J. (2005). Investments (International ed.). McGraw-Hill,.
2. Brandão, J. (2004). A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research, 157, 552-564.
3. Caballero, R., Gonzalez, M., Guerrero, F., Molina, J., & Paralera, C. (2007). Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia. European Journal of Operational Research, 177, 1751-1763.
4. Caramia, M., & Dell'Olmo, P. (2008). Multi-objective Management in Freight Logistics. Springer London, Limited.
5. Daganzo, C. F. (1984). The distance traveled to visit n points with a maximum of c stops per vehicle: An analytic model and an application. Transportation Science, 18, 331-350.
6. Delaunay, B. N. (1934). Sur la sphère vide. Bulletin of Academy of Sciences of the USSR, 6, 793-800.
7. Ehrgott, M., & Gandibleux, X. (2000). An annotated bibliography of multi-objective combinatorial optimization. OR Spectrum, 22, 425-460.
8. Expósito Izquierdo, C., Rossi, A.,& Sevaux, M. (2013). Modeling and solving the clustered capacitated vehicle routing problem. In Proceedings of the 14th EU/ME workshop (pp. 110-115).
9. FedEx (2006). FedEx: Powering Global Access. http://images.fedex.com/us/about/today/ access/GreaterAccessChange-global.pdf Accessed 13.03.13.
10. Fleszar, K., Osman, I.H., & Hindi, K. S. (2009). Avariable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research, 195, 803-809.
11. Geiger, M. J. (2008). Genetic algorithms for multiple objective vehicle routing. 1 (pp. 349-354). Program Operational Ciencia, Tecnologia, Inovaçao do Quadro Comunitário de Apoio III de Fundac¸ao para a Ciencia e Tecnologia. http://arxiv.org/abs/0809.0416.
12. Groer, C. (2008). Parallel and serial algorithms for vehicle routing problems (Ph.D. thesis). University of Maryland http://hdl.handle.net/1903/9011.
13. Hansen, P., & Mladenović, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130, 449-467.
14. Imran, A., Salhi, S., & Wassan, N. A. (2009). A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 197, 509-518.
15. Jozefowiez, N., Semet, F., & Talbi, E. (2008a). From single-objective to multi-objective vehicle routing problems: Motivations, case studies, and methods. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The vehicle routing problem: Latest advances and new challenges (pp. 445-471). Springer USA Operations Research/Computer Science Interfaces Series: Vol. 43.
16. Jozefowiez, N., Semet, F., & Talbi, E. (2008b). Multi-objective vehicle routing problems. European Journal of Operational Research, 189, 293-309.
17. Konak, A., Coit, D., & Smith, A. (2006). Multi-objective optimization using genetic algorithms: A tutorial. Reliability Engineering and System Safety, 91, 992-1007.
18. Krasnogor, N., Moscato, P., & Norman, M. (1995). A new hybrid heuristic for large geometric traveling salesman problems based on the delaunay triangulation. Anales del XXVII simposio Brasileiro de Pesquisa Operacional.
19. Kunkel, M., & Schwind, M. (2012). Vehicle routing with driver learning for real world CEP problems. In 45th Hawaii international conference on system science (HICSS) (pp. 1315-1322).
20. Lau, S., & Shue, L. (2001). Solving travelling salesman problems with an intelligent search approach. Asia-Pacific Journal of Operational Research, 18, 77-87.
21. Liu, C.-M., Chang, T.-C., & Huang, L.-F. (2006). Multi-objective heuristics for the vehicle routing problem. International Journal of Operations Research, 3, 173-181.
22. Lyster, C. (2012). Learning from fedex: Lessons for the city. Journal of Landscape Architecture, 7, 54-67.
23. Marler, R., & Arora, J. (2004). Survey of multi-objective optimization methods for engineering. Structural Multidisciplinary Optimization, 26, 369-395.
24. Messac, A., Puemi-Sukam, C., & Melachrinoudis, E. (2000a). Aggregate objective functions and Pareto frontiers: Required relationships and practical implications. Optimization and Engineering, 1, 171-188.
25. Messac, A., Renaud, J. E., Sundararaj, G. J., & Tappeta, R. V. (2000b). Ability of objective functions to generate points on nonconvex pareto frontiers. AIAA Journal, 38, 1084-1091.
26. Mourgaya, M. (2004). The periodic vehicle routing problem: Planning before routing (Ph.D. thesis). Laboratoire de Mathématiques Appliquées de Bordeaux, Université de Bordeaux 1 Bordeaux, France.
27. Mourgaya, M., & Vanderbeck, F. (2006). Periodic vehicle routing problem: Classification and heuristic. RAIRO Operational Research, 40, 169-194.
28. Mourgaya, M., & Vanderbeck, F. (2007). Column generation based heuristic for tactical planning in multi period vehicle routing. European Journal of Operational Research, 183, 1028-1041.
29. Nikolakopoulou, G., Kortesis, S., Synefaki, A., & Kalfakakou, R. (2004). Solving a vehicle routing problem by balancing the vehicles time utilization. European Journal of Operational Research, 152, 520-527.
30. Okabe, T., Jin, Y.,& Sendhoff, B. (2003). Acritical survey of performance indices for multiobjective optimisation. In The 2003 congress on evolutionary computation (CEC'03) (Vol. 2, pp. 878-885).
31. Ouyang, Y. (2007). Design of vehicle routing zones for large-scale distribution systems. Transportation Research Part B: Methodological, 41, 1079-1093.
32. Rodrigue, J.-P., Comtois, C., & Slack, B. (2006). The Geography of Transport Systems. New York: Routledge, Taylor & Francis.
33. Santiago, A., Melián-Batista, B., Álvarez, A., & AngelBello, F. (2013). Effect of the initial solutions to balance routes in vehicle routing problem with time windows. In I. Rojas, G. Joya, & J. Cabestany (Eds.), Advances in computational intelligence (pp. 46-52). Springer Berlin/Heidelberg Lecture Notes in Computer Science: Vol. 7903.
34. Waldheim, C., & Berger, A. (2008). Logistics landscape. Landscape Journal, 27, 219-246.
35. Zhiping, Q., & Yuxing, Z. (2010). Parametric optimization design of aircraft based on hybrid parallel multi-objective tabu search algorithm. Chinese Journal of Aeronautics, 23, 430-437.
36. Zhong, H., Hall, R., & Dessouky, M. (2007). Territory planning and vehicle dispatching with driver learning. Transportation Science, 41, 74-89.
37. Zitzler, E., & Thiele, L. (1998). Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. Parallel Problem Solving from Nature, 1498, 292-301.
38. Zitzler, E., & Thiele, L. (1999). Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation, 3, 257-271.