Abstract
The article presents a framework for the resolution of rich vehicle routing problems which are difficult to address with standard optimization techniques. We use local search on the basis on variable neighborhood search for the construction of the solutions, but embed the techniques in a flexible framework that allows the consideration of complex side constraints of the problem such as time windows, multiple depots, heterogeneous fleets, and, in particular, multiple optimization criteria. In order to identify a compromise alternative that meets the requirements of the decision maker, an interactive procedure is integrated in the resolution of the problem, allowing the modification of the preference information articulated by the decision maker. The framework is implemented in a computer system. Results of test runs on multiple depot multi-objective vehicle routing problems with time windows are reported.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Solomon, M.M., Desrosiers, J.: Time window constrained routing and scheduling problems. Transportation Science 22(1), 1–13 (1988)
Taillard, É., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31(2), 170–186 (1997)
Geiger, M.J.: Genetic algorithms for multiple objective vehicle routing. In: de Sousa, J.P. (ed.) Proceedings of the Metaheuristics International Conference, MIC 2001, Porto, Portugal, July, pp. 349–353 (2001)
Potvin, J.Y., Kervahut, T., Garcia, B.L., Rousseau, J.M.: The vehicle routing problem with time windows part i: Tabu search. INFORMS Journal on Computing 8(2), 158–164 (1996)
Potvin, J.Y., Bengio, S.: The vehicle routing problem with time windows part ii: Genetic search. INFORMS Journal on Computing 8(2), 165–172 (1996)
Gendreau, M., Bräysy, O.: Metaheuristic approaches for the vehicle routing problem with time windows: A survey. In: Ibaraki, T., Yagiura, M., Nonobe, K. (eds.) Proceedings of the Fifth Metaheuristics International Conference - MIC2003, Kyoto, Japan, August, pp. 1–10 (2003)
Beasley, J.E.: OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990)
Fink, A., Voß, S.: HotFrame: A heuristic optimization framework. In: Voß, S., Woodruff, D.L. (eds.) Optimization Software Class Libraries, pp. 81–154. Kluwer Academic Publishers, Dordrecht (2002)
Di Gaspero, L., Schaerf, A.: Easylocal++: an object-oriented framework for the flexible design of local-search algorithms. Software: Practice & Experience 33(8), 733–765 (2003)
Cahon, S., Melab, N., Talbi, E.G.: ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics
Rahoual, M., Kitoun, B., Mabed, M.H., Bachelet, V., Benameur, F.: Multicriteria genetic algorithms for the vehicle routing problem with time windows. In: de Sousa, J.P. (ed.) Proceedings of the Metaheuristics International Conference MIC 2001, Porto, Portugal, July, pp. 527–532 (2001)
Jozefowiez, N., Semet, F., Talbi, E.G.: Parallel and hybrid models for multi-objective optimization: Application to the vehicle routing problem. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN VII. LNCS, vol. 2439, pp. 271–280. Springer, Heidelberg (2002)
Murata, T., Itai, R.: Multi-objective vehicle routing problems using two-fold EMO algorithms to enhance solution similarity on non-dominated solutions. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 885–896. Springer, Heidelberg (2005)
Jozefowiez, N., Semet, F., Talbi, E.G.: Enhancements of NSGA II and its application to the vehicle routing problem with route balancing. In: Talbi, E.-G., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds.) EA 2005. LNCS, vol. 3871, pp. 131–142. Springer, Heidelberg (2006)
Stacey, P.J.: Practical vehicle routeing using computer programs. Journal of the Operational Research Society 34(10), 975–981 (1983)
Waters, C.D.J.: Interactice vehicle routeing. Journal of the Operational Research Society 35(9), 821–826 (1984)
Park, Y.B., Koelling, C.P.: A solution of vehicle routing problems in a multiple objective environment. Engineering Costs and Production Economics 10, 121–132 (1986)
Park, Y.B., Koelling, C.P.: An interactive computerized algorithm for multicriteria vehicle routing problems. Computers & Industrial Engineering 16(4), 477–490 (1989)
Phelps, S.P., Köksalan, M.: An interactive evolutionary metaheuristic for multiobjective combinatorial optimization. Management Science 49, 1726–1738 (2003)
Cahon, S., Simarik, T., Vironda, T.: A graphical user interface for multi objective optimization guimoo. http://guimoo.gforge.inria.fr/
Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 52, 928–936 (2001)
de Sousa, J.P. (ed.): Proceedings of the Metaheuristics International Conference MIC 2001, Porto, Portugal, July (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Geiger, M.J., Wenger, W. (2007). On the Interactive Resolution of Multi-objective Vehicle Routing Problems. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds) Evolutionary Multi-Criterion Optimization. EMO 2007. Lecture Notes in Computer Science, vol 4403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70928-2_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-70928-2_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70927-5
Online ISBN: 978-3-540-70928-2
eBook Packages: Computer ScienceComputer Science (R0)