Skip to main content
SpringerLink
Log in
Book cover

Adaptive and Multilevel Metaheuristics pp 119–132Cite as

Market Based Allocation of Transportation Orders to Vehicles in Adaptive Multi-objective Vehicle Routing

  • Chapter

  • 837 Accesses

Part of the book series: Studies in Computational Intelligence ((SCI,volume 136))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Google Scholar 

  2. Beasley, J.E.: OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990)

    Article  Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. Cahon, S., Simarik, T., Vironda, T.: A graphical user interface for multi objective optimization GUIMOO, http://guimoo.gforge.inria.fr/

  5. 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)

    Google Scholar 

  6. 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)

    Article  MATH  Google Scholar 

  7. Cordeau, J.-F., Gendrau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks (30), 105–119 (1997)

    Article  MATH  Google Scholar 

  8. 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)

    Article  Google Scholar 

  9. 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)

    Article  MATH  Google Scholar 

  10. 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)

    Google Scholar 

  11. Geiger, M.J.: Genetic algorithms for multiple objective vehicle routing. In: de Sousa, P. (ed.) [24], pp. 349–353

    Google Scholar 

  12. 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

    Google Scholar 

  13. 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

    Google Scholar 

  14. 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)

    Google Scholar 

  15. 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)

    Chapter  Google Scholar 

  16. 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)

    Chapter  Google Scholar 

  17. 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)

    Chapter  Google Scholar 

  18. 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)

    Article  Google Scholar 

  19. 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

    Google Scholar 

  20. 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)

    Google Scholar 

  21. 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

    Google Scholar 

  22. Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.): EMO 2007. LNCS, vol. 4403, pp. 3–540. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  23. Pacheco, J., Marti, R.: Tabu search for a multi-objective routing problem. Journal of the Operational Research Society (57), 29–37 (2006)

    Article  MATH  Google Scholar 

  24. de Sousa, J.P.(ed.): MIC 2001: Proceedings of the Forth Metaheuristics International Conference, Porto, Portugal (2001)

    Google Scholar 

  25. 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)

    MATH  Google Scholar 

  26. 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)

    Article  MATH  Google Scholar 

  27. 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

    Google Scholar 

  28. Savelsbergh, M.W.P.: Local search for routing problems with time windows. Annals of Operations Research 4(1), 285–305 (1985)

    Article  MathSciNet  Google Scholar 

  29. Solomon, M.M., Desrosiers, J.: Time window constrained routing and scheduling problems. Transportation Science 22(1), 1–13 (1988)

    MATH  MathSciNet  Google Scholar 

  30. 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)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Industriebetriebslehre, Universität Hohenheim, 70593, Stuttgart, Germany

    Martin Josef Geiger & Wolf Wenger

Authors
  1. Martin Josef Geiger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolf Wenger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Carlos Cotta Marc Sevaux Kenneth Sörensen

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation