Skip to main content
Springer Nature Link
Log in

A Particular Multiobjective Vehicle Routing Problem Solved by Simulated Annealing

  • Conference paper
Metaheuristics for Multiobjective Optimisation

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 535))

Abstract

A particular vehicle routing problem is considered: a customer asks to load a quantity at one place and to tran sport it to another one. The aim is to determine the daily routes of a fleet of trucks satisfying the requests of a set of customers. Several constraints must be considered: maximal duration of the daily routes; time-windows at the loading points; request of a particular type of trucks.

Several objectives are taken into account. A Multiobjective Simulated Annealing approach is applied to generate an approximation of the set of efficient solutions.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Belenguer J.M. Martinez M.C. and Mota E. A lower bound for the split delivery vehicle routing problem. Operations Research 485 2000), 801–81

    Article  Google Scholar 

  2. Clarke G. and Wright W.: Scheduling of vehicles from a central depot to a number of delivery point. Operations Research 12 (1964), 568–581.

    Article  Google Scholar 

  3. Cordeau J.F., Desaulniers G., Desrosiers J., Solomon M.M. and Soumis F.: VRP with time windows in [34].

    Google Scholar 

  4. Crainic T.G. and Laporte G. (Eds). Fleet management and logistics. Kluwer Academic Publishers (2000).

    Google Scholar 

  5. Desaulniers G., Desrosiers J., Erdmann A., Solomon M.M. and Soumis F.: VRP with pickup and delivery in [34].

    Google Scholar 

  6. Desrosiers J., Laporte G., Sauve M., Soumis F. and Taillefer S.: Vehicle routing with full loads. Computers and Operations Research 15(3) (1988) 219–226.

    Google Scholar 

  7. Dror M., Trudeau P.: Split delivery routing. Naval Research Logistics 37(3) (1990), 383–402.

    Google Scholar 

  8. Dror M., Laporte G. and Trudeau P.: Vehicle routing with split deliveries. Discrete Applied Mathematics 50(3) (1994), 239–254.

    Article  Google Scholar 

  9. Dumas Y., Desrosiers J. and Soumis F.: The pickup and delivery problem with time windows. European Journal of Operational Research 5(1) (1991), 7–22.

    Article  Google Scholar 

  10. El-Sherbeny N.: Resolution of a vehicle routing problem with Multiobjec-tive simulated annealing method. Ph.D. Dissertation. Faculté Polytechnique de Mons (2001)

    Google Scholar 

  11. Ehrgott M. and Gandibleux X. (Eds). Multiple Criteria Optimization: State of the Art Annotated Biliographic Surveys. Kluwer Academic Publishing (2002).

    Google Scholar 

  12. Geiger M.J.: Genetic algorithms for multiple objective vehicle routing, in MIC’2001 (2001) 349–354.

    Google Scholar 

  13. Gendreau M., Laporte G. and Vigo D.: Heuristics for the traveling salesman problem with pickup and delivery. Computers and Operations Research 26 (1999), 699–714.

    Article  Google Scholar 

  14. Gendreau M., Laporte G. and Potvin J-Y.: Metaheuristics for the capacited VRP in [5].

    Google Scholar 

  15. Gendreau M., Laporte G., Potvin J.Y. and Semet F.: Approches basées sur les métaheuristiques pour le problème de tournées de véhicules in [24].

    Google Scholar 

  16. Golden B.L., Wasil E.A., Kelly J.P. and Chao I.M.: Metaheuristics in vehicle routing in [24].

    Google Scholar 

  17. Gronalt M., Hartl R.F. and Reimann M.: New savings based algorithms for time constrained pickup and delivery of full truckloads. To appear in European Journal of Operational Research (2003).

    Google Scholar 

  18. Ho S.C and Haugland D.: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. To appear in Computers and Operations Research (2003).

    Google Scholar 

  19. Jaszkiewicz A. and Teghem J.: Multiple objective metaheuristics for combinatorial optimization: a tutorial. Technical report, Poznan University, submitted for publication.

    Google Scholar 

  20. Jozefowiez N., Semet F. and Talbi E.: An evolutionary algorithm for a Multi-objective vehicle routing problem, submitted for publication.

    Google Scholar 

  21. Laporte G., Gendreau M., Potvin J-Y. and Semet F.: Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7 (2000) 285–300.

    Article  Google Scholar 

  22. Laporte G. and Semet F.: Classical heuristics for the capacited VRP in [37].

    Google Scholar 

  23. Nanry W.P. and Barnes J.W.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B (2000), 107–121.

    Google Scholar 

  24. Pirlot M. and Teghem J.: Outils nouveaux de la Recherche Opérationnelle. Collection IC2, Hermès to appear in 2003.

    Google Scholar 

  25. Rahoual M., Kitoun B., Mabed M., Bachelet V. and Benameur F.: Multicriteria genetic algorithms for the vehicle routing problem with time windows, in MIC’2001 (2001), 527–532.

    Google Scholar 

  26. Ribeiro R. and Loureno R.: A Multiobjective model for a multi period distribution management problem, in MIC’2001 (2001), 97–102.

    Google Scholar 

  27. Ruland K.S. and Rodin E.Y.: The pickup and delivery problem: Faces and branch-and-cut algorithm. Computers Math. Applic. 33(12) (1997) 1–13.

    Google Scholar 

  28. Savelsbergh M.W.P. and Sol M.: The general pickup and delivery problem. Transportation Science 29(1) (1995) 17–29.

    Article  Google Scholar 

  29. Slowinski R.: Fuzzy sets in decision analysis, Operations Research and Statistics. The handbooks of Fuzzy sets series. Kluwer Academic Publishers (1998).

    Google Scholar 

  30. Solomon M.M.: The vehicle routing and scheduling problems with time window constraints. Operations Research 35(2) (1987), 254–265.

    Article  Google Scholar 

  31. Tan K.C., Lee L.H., Zhu Q.L. and Ou K.: Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence in Engineering 15 (2001) 281–295.

    Article  Google Scholar 

  32. Teghem J., Tuyttens D. and Ulungu E.L.: An interactive heuristic method for Multiobjective combinatorial optimization. Computers & Operations Research 27 (2000), 621–634.

    Article  Google Scholar 

  33. Teghem J., Ulungu E.L. and Tuyttens D.: Adaptation des mtaheuristiques en optimization combinatoire multicritre. Collection IC2, Hermès to appear in 2003.

    Google Scholar 

  34. Toth P. and Vigo D.: The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications (2002).

    Google Scholar 

  35. Tuyttens D., Teghem J., Fortemps Ph. & Van Nieuwenhuyse K.: Performance of the MOSA method for the bicriteria assignment problem. Journal of Heuristics 6 (2000), 295–310.

    Article  Google Scholar 

  36. Tzoreff T.E., Granot D., Granot F. and Sosie G.: The vehicle routing problem with pickups and deliveries on some special graphs. Discrete Applied Mathematics 116 (2002) 193–229.

    Article  Google Scholar 

  37. Ulungu E.L. and Teghem J.: Multiobjective combinatorial optimization problems: A survey. Journal of Multiple-Criteria Decision Analysis, 3/2 (1994), 83–104.

    Article  Google Scholar 

  38. Ulungu E.L., Teghem, Fortemps Ph. and Tuyttens D.: MOSA method: a tool for solving MOCO problems. Journal of Multi-Criteria Decision Analysis 8 (1999), 221–236.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Mathematics and Operations Research, Faculté Polytechnique de Mons, 9, Rue de Houdain, 7000, Mons, Belgium

    Daniel Tuyttens, Jacques Teghem & Nasser El-Sherbeny

Authors
  1. Daniel Tuyttens
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Teghem
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nasser El-Sherbeny
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LAMIH - ROI, University of Valenciennes, UMR CNRS 8530 Campus Le Mont Houy, 59313, Valenciennes Cedex 9, France

    Xavier Gandibleux

  2. LAMIH - SP, University of Valenciennes, UMR CNRS 8530 Campus Le Mont Houy, 59313, Valenciennes Cedex 9, France

    Marc Sevaux

  3. University of Antwerp Faculty of Applied Economics, Prinsstraat 13, 2000, Antwerp, Belgium

    Kenneth Sörensen

  4. Department of Computer Science Polytech’ Tours, University of Tours, 64 avenue Jean Portalis, 37200, Tours, France

    Vincent T’kindt

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tuyttens, D., Teghem, J., El-Sherbeny, N. (2004). A Particular Multiobjective Vehicle Routing Problem Solved by Simulated Annealing. In: Gandibleux, X., Sevaux, M., Sörensen, K., T’kindt, V. (eds) Metaheuristics for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems, vol 535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17144-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17144-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20637-8

  • Online ISBN: 978-3-642-17144-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics