Summary
The article describes a study on vehicle routing problems under multiple objectives. In particular, we investigate the effectiveness of different approaches when assigning orders to vehicles. The resulting clustering problem is studied within a general framework for multi-objective vehicle routing problems where different vehicle agents place bids for orders which are offered on a marketplace. This marketplace gathers information about the current situation and provides the basis for the resolution of the allocation problem. By implementing different specialized but interacting software agents, an adaptation of the concept to various configurations of the studied problem is possible. Experimental investigations of different assignment logics on benchmark instances have been carried out and numerical results are reported. In brief, a tendency towards a particular clustering approach can be observed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alba, E., Almeida, F., Blesa, M., Cotta, C., Diaz, M., Dorta, I., Gabarro, J., Leon, C., Luque, G., Petit, J., Rodriguez, C., Rojas, A., Xhafa, F.: Efficient parallel LAN/WAN algorithms for optimization. the MALLBA project. Parallel Computing 32(5–6), 215–440 (2006)
Beasley, J.E.: OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990)
Cahon, S., Melab, N., Talbi, E.-G.: ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics. Journal of Heuristics 10, 357–380 (2004)
Cahon, S., Simarik, T., Vironda, T.: A graphical user interface for multi objective optimization GUIMOO, http://guimoo.gforge.inria.fr/
Chitty, D.M., Hernandez, M.L.: A hybrid ant colony optimization technique for dynamic vehicle routing. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 48–59. Springer, Heidelberg (2004)
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)
Cordeau, J.-F., Gendrau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks (30), 105–119 (1997)
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)
Ehrgott, M., Rau, A.: Bicriteria cost versus service analysis of a distribution network – a case study. Journal of Multi-Criteria Decision Analysis 8, 256–267 (1999)
Fink, A., Voß, S.: HotFrame: A heuristic optimization framework. In: Voß, S., Woodruff, D.L. (eds.) Optimization Software Class Libraries, ch. 4, pp. 81–154. Kluwer Academic Publishers, Boston (2002)
Geiger, M.J.: Genetic algorithms for multiple objective vehicle routing. In: de Sousa, P. (ed.) [24], pp. 349–353
Geiger, M.J., Wenger, W.: On the interactive resolution of multi-objective vehicle routing problems. In: Obayashi, et al. (eds.) [22], pp. 687–699. ISBN 3-540-70927-4
Geiger, M.J., Wenger, W., Habenicht, W.: Interactive utility maximization in multi-objective vehicle routing problems: A “decision maker in the loop”-approach. In: Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Multicriteria Decision Making (MCDM 2007), Hilton Hawaiian Village, Honolulu, Hawaii, USA, April 2007, pp. 178–184 (2007) ISBN 1-4244-0698-6
Gendreau, M., Bräysy, O.: Metaheuristic approaches for the vehicle routing problem with time windows: A survey. In: MIC 2003: Proceedings of the Fifth Metaheuristics International Conference, Kyoto, Japan, August 2003, pp. 1–10 (2003)
Hansen, P., Mladenović, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, ch. 6. International Series in Operations Research & Management Science, vol. 57, pp. 145–184. Kluwer Academic Publishers, Boston (2003)
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.) PPSN 2002. LNCS, vol. 2439, pp. 271–280. Springer, Heidelberg (2002)
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)
Lee, T.-R., Ueng, J.-H.: A study of vehicle routing problems with load-balancing. International Journal of Physical Distribution & Logistics Management 29(10), 646–658 (1999)
Liefooghe, A., Basseur, M., Jourdan, L., Talbi, E.-G.: ParadisEO-MOEO: A framework for evolutionary multi-objective optimization. In: Obayashi,, et al. (eds.) [22], pp. 386–400. ISBN 3-540-70927-4
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)
Murata, T., Itai, R.: Local search in two-fold EMO algorithm to enhance solution similarity for multi-objective vehicle routing problems. In: Obayashi, et al. (eds.) [22], pp. 201–215. ISBN 3-540-70927-4
Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.): EMO 2007. LNCS, vol. 4403, pp. 3–540. Springer, Heidelberg (2007)
Pacheco, J., Marti, R.: Tabu search for a multi-objective routing problem. Journal of the Operational Research Society (57), 29–37 (2006)
de Sousa, J.P.(ed.): MIC 2001: Proceedings of the Forth Metaheuristics International Conference, Porto, Portugal (2001)
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)
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)
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, P. (ed.) [24], pp. 527–532
Savelsbergh, M.W.P.: Local search for routing problems with time windows. Annals of Operations Research 4(1), 285–305 (1985)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Geiger, M.J., Wenger, W. (2008). Market Based Allocation of Transportation Orders to Vehicles in Adaptive Multi-objective Vehicle Routing. In: Cotta, C., Sevaux, M., Sörensen, K. (eds) Adaptive and Multilevel Metaheuristics. Studies in Computational Intelligence, vol 136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79438-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-79438-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79437-0
Online ISBN: 978-3-540-79438-7
eBook Packages: EngineeringEngineering (R0)