Skip to main content
SpringerLink
Log in

A Survey on Multi-criteria Analysis in Logistics: Focus on Vehicle Routing Problems

  • Chapter
  • First Online:
Applications of Multi-Criteria and Game Theory Approaches

Part of the book series: Springer Series in Advanced Manufacturing ((SSAM))

Abstract

Vehicle routing problems play a central role in logistics. These combinatorial optimization problems have attracted more and more attention these last five decades both in theory and in practice. However, main contributions are dedicated to the single criterion optimization problems. The goal of this chapter is to provide the recent key references dedicated to multi-criteria studies in transportation logistics and especially on vehicle routing problems and to present some interesting research directions.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

References

  • Alumur S, Kara BY (2007) A new model for the hazardous waste location-routing problem. Comput Oper Res 34(5):1406–1423

    Article  MATH  Google Scholar 

  • Androutsopoulos KN, Zografos KG (2009) Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network. Eur J Oper Res 192(1):18–28

    Article  MathSciNet  MATH  Google Scholar 

  • Angus D, Woodward C (2009) Multiple objective ant colony optimization. Swarm Intell 3:69–85

    Article  Google Scholar 

  • Artigues C, Huguet MJ, Gueye F (2011) State-based accelerations and bidirectional search for bi-objective multimodal shortest paths. LAAS Technical report N°11485

    Google Scholar 

  • Baldacci R, Mingozzi A, Roberti R (2012) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur J Oper Res 216:1–6

    Article  MathSciNet  Google Scholar 

  • Belenguer JM, Benavent E, Prins C, Prodhon C, Wolfler-Calvo R (2011) A branch-and-cut method for the capacitated location-routing problem. Comput Oper Res 38:931–941

    Article  MathSciNet  MATH  Google Scholar 

  • Bérubé JF, Gendreau M, Potvin JY (2009) An exact ε-constraint method for bi-objective combinatorial optimization problems: application to the traveling salesman problem with profits. Eur J Oper Res 194(1):39–50

    Article  MATH  Google Scholar 

  • Boffey B (1995) Multi-objective routing problems. Top 3(2):167–220

    Article  MathSciNet  MATH  Google Scholar 

  • Braekers K, Caris A, Janssens GK (2011) A deterministic annealing algorithm for a Bi-objective full truckload vehicle routing problem in drayage operations. Proced Soc Behav Sci 20:344–353

    Article  Google Scholar 

  • Bräysy O, Gendreau M (2005a) Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp Sci 39:104–118

    Article  Google Scholar 

  • Bräysy O, Gendreau M (2005b) Vehicle routing problem with time windows, part II: metaheuristics. Transp Sci 39:119–139

    Article  Google Scholar 

  • Campbell AM, Vandenbussche D, Hermann W (2008) Routing for relief efforts. Transp Sci 42(2):127–145

    Article  Google Scholar 

  • Chand P, Mishra BSP, Dehuri S (2010) A multi objective genetic algorithm for solving vehicle routing problem. Int J Info Tech Knowl Mgmt 2:503–506

    Google Scholar 

  • Chao IM, Golden BL, Wasil EA (1996) The team orienteering problem. Eur J Oper Res 88(3):464–474

    Article  MATH  Google Scholar 

  • Cintron A, Ravindran AR, Ventura JA (2010) Multi-criteria mathematical model for designing the distribution network of a consumer goods company. Comput Ind Eng 58:584–593

    Article  Google Scholar 

  • Coello Coello CA, Pulido G, Montes E (2005) Current and future research trends in evolutionary multi-objective optimization. Inf Process Evol Algorithm Adv Info Knowl Pro 213–231

    Google Scholar 

  • Coello Coello CA (2009) Evolutionary multi-objective optimization: some current research trends and topics that remain to be explored. Front Comput Sci China 3(1):18–30

    Article  Google Scholar 

  • Coutinho-Rodrigues J, Tralhão L, Alçada-Almeida L (2012) Solving a location-routing problem with a multi-objective approach: the design of urban evacuation plans. J Transp Geogr 22:206–218

    Article  Google Scholar 

  • Current JR, Schilling DA (1994) The median tour and maximal covering problems. Eur J Oper Res 73:114–126

    Article  MATH  Google Scholar 

  • Deb K (2002). Multi-objective optimization using evolutionary algorithms, 2nd edn. Wiley-Interscience Series in Systems and Optimization, New York

    Google Scholar 

  • Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Schoenauer M et al (eds) Parallel problem solving from nature (PPSN VI). Lectures notes in computer science, vol 1917. Springer, Berlin, pp 849–858

    Google Scholar 

  • Duhamel C, Lacomme P, Prins C, Prodhon C (2010) A GRASP × ELS approach for the capacitated location-routing problem. Comput Oper Res 37:1912–1923

    Article  MATH  Google Scholar 

  • Farahani RZ, Asgari N, Heidari N, Hosseininia M, Goh M (2012) Covering problems in facility location: a review Comput Ind Eng 62(1):368–407

    Google Scholar 

  • Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problem with profits: an overview. Transp Sci 39:188–205

    Article  Google Scholar 

  • Garcia-Najera A, Bullinaria JA (2011) An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Comput Oper Res 38:287–300

    Article  MathSciNet  MATH  Google Scholar 

  • Ghoseiri K, Ghannadpour SF (2010) Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl Soft Comput 10:1096–1107

    Article  Google Scholar 

  • Ghoseiri K, Nadjari B (2010) An ant colony optimization algorithm for the bi-objective shortest path problem. Appl Soft Comput 10(4):1237–1246

    Article  Google Scholar 

  • Giannikos I (1998) A multi-objective programming model for locating treatment sites and routing hazardous wastes. Eur J Oper Res 104:333–342

    Article  MATH  Google Scholar 

  • Gupta R, Singh B, Pandey D (2010) Multi-objective fuzzy vehicle routing problem: a case study. Int J Contemp Math Sci 5(29):1439–1454

    MATH  Google Scholar 

  • Hoff A, Andersson H, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: fleet composition and routing. Comput Oper Res 37:2041–2061

    Article  MathSciNet  MATH  Google Scholar 

  • Jozefowiez N, Semet F, Talbi EG (2005) Enhancements of NSGA II and its application to the vehicle routing problem with route balancing. In Talbi EG, Liardet P, Collet P, Lutton E, and Schoenauer M, Artificial Evolution 2005, International Conference (EA'2005), Volume 3871, Lecture Notes in Computer Science, Springer, pp. 131–142

    Google Scholar 

  • Jozefowiez N, Semet F, Talbi EG (2007) The bi-objective covering tour problem. Comput Oper Res 34:1929–1942

    Article  MATH  Google Scholar 

  • Jozefowiez N, Glover F, Laguna M (2008a) Multi-objective meta-heuristics for the traveling salesman problem with profits. J Math Modell Algorithm 7(2):177–195

    Article  MathSciNet  MATH  Google Scholar 

  • Jozefowiez N, Semet F, Talbi EG (2008b) Multi-objective vehicle routing problems. Eur J Oper Res 189:293–309

    Article  MathSciNet  MATH  Google Scholar 

  • Jozefowiez N, Semet F, Talbi EG (2009) An evolutionary algorithm for the vehicle routing problem with route balancing. Eur J Oper Res 195:761–769

    Article  MATH  Google Scholar 

  • Keller CP, Goodchild M (1988) The multi-objective vending problem: a generalization of the travelling salesman problem. Environ Plan B 15:447–460

    Article  Google Scholar 

  • Labadie N, Prins C, Reghioui M (2008) A memetic algorithm for the vehicle routing problem with time windows. RAIRO-Oper Res 42:415–431

    Article  MathSciNet  Google Scholar 

  • Labadie N, Melechovský J, Prins C (2011) An evolutionary algorithm for the bi-objective multiple traveling salesman problem. In: Proceedings of the international conference on industrial engineering and systems management (IESM 2011), Metz 25–27 May 2011, Frances, pp 371–379. ISBN 978-2-9600532-3-4

    Google Scholar 

  • Labadie N, Prins C (2012) Vehicle routing nowadays : compact review and emerging problems. In: Mejia G, Velasco N (Ed) Production systems and supply chain management in emerging countries: best practices, Chapter 8, Springer, pp 141–166

    Google Scholar 

  • Lacomme L, Prins C, Sevaux M (2006) A genetic algorithm for a bi-objective capacitated arc routing problem. Comput Oper Res 33:3473–3493

    Article  MATH  Google Scholar 

  • Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408–416

    Article  MathSciNet  Google Scholar 

  • Lau HCW, Chan TM, Tsui WT, Chan FTS, Ho GTS, Choy KL (2009) A fuzzy guided multi-objective evolutionary algorithm model for solving transportation problem. Expert Syst Appl 36:8255–8268

    Article  Google Scholar 

  • Lenstra JK, Rinnooy Kan AHG (1981) Complexity of vehicle routing and scheduling problem. Networks 11:221–227

    Article  Google Scholar 

  • Lin CKY, Kwok RCW (2006) Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data. Eur J Oper Res 175:1833–1849

    Article  MATH  Google Scholar 

  • List G, Mirchandani P (1991) An integrated network/planar multi-objective model for routing and siting for hazardous materials and wastes. Transp Sci 25(2):146–156

    Article  Google Scholar 

  • Marjani MR, Moattar Husseini SM, Karimi B (2012) Bi-objective heuristics for multi-item freights distribution planning problem in cross-docking networks. Int J Adv Manuf Tech 58(9–12):1201–1216

    Article  Google Scholar 

  • Martí R, Campos V, Resende MGC, Duarte A (2011) Multi-objective GRASP with path-relinking. AT&T Labs Research Technical Report

    Google Scholar 

  • Mora AM, Merelo JJ, Castillo PA, Arenas MG (2013) HCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem. Comput Oper Res 40:1524–1551

    Google Scholar 

  • Müller J (2010) Approximative solutions to the bicriterion vehicle routing problem with time windows. Eur J Oper Res 202:223–231

    Article  MATH  Google Scholar 

  • Nagata Y, Bräysy O, Dullaert W (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput Oper Res 37:724–737

    Article  MATH  Google Scholar 

  • Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177(2):649–672

    Article  MathSciNet  MATH  Google Scholar 

  • Nolz PC, Doerner KF, Gutjahr WJ, Hartl RF (2010) A biobjective metaheuristic for disaster relief operation planning. In: Dhaenes C, Jourdan L, Coello Coello CA (eds) Advances in multi-objective nature inspired computing. Studies in computational intelligence. Springer, Berlin, pp 157–177

    Google Scholar 

  • Norouzi N, Tavakkoli-Moghaddam R, Salamatbakhsh A, Alinaghian M (2009) Solving a novel bi-objective open vehicle routing problem in a competitive situation by multi-objective particle swarm optimization. J Appl Oper Res 1(1):15–29

    Google Scholar 

  • Ombuki B, Ross BJ, Hanshar F (2006) Multi-objective genetic algorithms for vehicle routing problem with time windows. App Intell 24(1):17–30

    Article  Google Scholar 

  • Park YB, Koelling CP (1986) A solution of vehicle routing problems in a multiple objective environment. Eng Costs Prod Econ 10:121–132

    Google Scholar 

  • Pinto L, Bornstein C, Maculan N (2009) The tricriterion shortest path problem with at least two bottleneck objective functions. Eur J Oper Res 198:387–391

    Article  MATH  Google Scholar 

  • Pinto L, Pascoal MMB (2010) On algorithms for the tricriteria shortest path problem with two bottleneck objective functions. Comput Oper Res 37:1774–1779

    Article  MathSciNet  MATH  Google Scholar 

  • Prins C, Prodhon C, Soriano P, Ruiz A, Wolfler-Calvo R (2007) Solving the capacitated LRP by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transp Sci 41(4):470–483

    Article  Google Scholar 

  • Prodhon C (2011) A hybrid evolutionary algorithm for the periodic location-routing problem. Eur J Oper Res 210(2):204–212

    Article  MathSciNet  MATH  Google Scholar 

  • Rahoual M, Kitoun B, Mabed H, Bachelet V, Benameur F (2001) Multicriteria genetic algorithms for the vehicle routing problem with time windows. In: Proceedings of fourth metaheuristics international conference, pp 527–532

    Google Scholar 

  • Rajabalipour Cheshmehgaz H, Desa MI, Wibowo A (2013) A flexible three-level logistic network design considering cost and time criteria with a multi-objective evolutionary algorithm. J Intell Manuf 24(2):277–293

    Google Scholar 

  • Raith A, Ehrgott M (2009) A comparison of solution strategies for biobjective shortest path problems. Comput Oper Res 36:1299–1331

    Article  MathSciNet  MATH  Google Scholar 

  • Rath S, Gutjahr WJ (2011) A math-heuristic for the warehouse location–routing problem in disaster relief. Comput Oper Res (in press) doi: 10.1016/j.cor.2011.07.016

  • Reinhardt LB, Pisinger D (2011) Multi-objective and multi-constrained non-additive shortest path problems. Comput Oper Res 38(3):605–616

    Article  MathSciNet  MATH  Google Scholar 

  • Repoussis PP, Tarantilis CD, Ioannou G (2009) Arc-guided evolutionary algorithm for the vehicle routing problem with time windows. IEEE Trans Evol Comput 13:624–647

    Article  Google Scholar 

  • Riera-Ledesma J, Salazar-González JJ (2005) The biobjective travelling purchaser problem. Eur J Oper Res 160(3):599–613

    Article  MATH  Google Scholar 

  • Schilde M, Doerner KF, Hartl RF, Kiechle G (2009) Metaheuristics for the bi-objective orienteering problem. Swamr Intell 3(3):179–201

    Article  Google Scholar 

  • Shimamoto H, Murayama N, Fujiwara A, Zhang J (2010) Evaluation of an existing bus network using a transit network optimisation model: a case study of the Hiroshima city bus network. Transportation 37(5):801–823

    Article  Google Scholar 

  • Si BF, Zhang HY, Zhong M, Yang XB (2011) Multi-criterion system optimization model for urban multimodal traffic network. Sci China Tech Sci 54(4):947–954

    Article  MATH  Google Scholar 

  • Skriver AJV (2000) A classification of bicriterion shortest path (BSP) algorithms. Asia-Pacific J Oper Res 7:199–212

    MathSciNet  Google Scholar 

  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254–265

    Article  MathSciNet  MATH  Google Scholar 

  • Tan KC, Chew YH, Lee LH (2006) A hybrid multi-objective evolutionary algorithm for solving vehicle routing problem with time windows. Comput Opt Appl 34(1):115–151

    Article  MathSciNet  MATH  Google Scholar 

  • Tavakkoli-Moghaddam R, Safaei N, Shariat MA (2005) A multi-criteria vehicle routing problem with soft time windows by simulated annealing. J Indus Eng 1(1):28–36

    Google Scholar 

  • Tavakkoli-Moghaddam R, Makui A, Mazloomi Z (2010) A new integrated mathematical model for a bi-objective multi-depot location-routing problem solved by a multi-objective scatter search algorithm. J Manuf Syst 9:111–119

    Article  Google Scholar 

  • Tavakkoli-Moghaddam R, Gazanfari M, Alinaghian M, Salamatbakhsh A, Norouzi N (2011) A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing. J Manuf Syst 30:83–92

    Article  Google Scholar 

  • Tezcaner D, Köksalan M (2011) An interactive algorithm for multi-objective route planning. J Opt Theor Appl 150:379–394

    Article  MATH  Google Scholar 

  • Toth P, Vigo D (2002) The vehicle routing problem. SIAM, Philadelphia

    Google Scholar 

  • Tricoire F, Graf A, Gutjahr WJ (2012) The bi-objective stochastic covering tour problem. Comput Oper Res 39:1582–1592

    Article  MathSciNet  MATH  Google Scholar 

  • Tzeng GH, Cheng HJ, Huang TD (2007) Multi-objective optimal planning for designing relief delivery systems. Transp Res Part E 43:673–686

    Article  Google Scholar 

  • Vansteenwegen P, Souffriau W, Oudheusden DV (2011) The orienteering problem: a survey. Eur J Oper Res 209(1):1–10

    Article  MATH  Google Scholar 

  • Vitoriano B, Ortuño MT, Tirado G, Montero J (2011) A multi-criteria optimization model for humanitarian aid distribution. J Glob Optim 51:189–208

    Article  MATH  Google Scholar 

  • Viswanath K, Peeta S (2003) Multicommodity maximal covering network design problem for planning critical routes for earthquake response. J Transp Res Board 1857:1–10

    Article  Google Scholar 

  • Wang CH, Li CH (2011) Optimization of an established multi-objective delivering problem by an improved hybrid algorithm. Expert Syst Appl 38(4):4361–4367

    Article  Google Scholar 

  • Wøhlk S (2008) A decade of capacitated arc routing. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem—latest advances and new challenges. Springer, New York, pp 29–48

    Chapter  Google Scholar 

  • Zhou A, Qu BY, Zhao SZ (2011) multi-objective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1:32–49

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ICD/LOSI, Université de Technologie de Troyes, 12 rue Marie Curie, CS 42060, 10004, Troyes Cedex, France

    N. Labadie & C. Prodhon

Authors
  1. N. Labadie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Prodhon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. Labadie .

Editor information

Editors and Affiliations

  1. LSIS, Aix-Marseille University, Marseille, France

    Lyes Benyoucef

  2. LSIS, CNRS, Marseille, France

    Jean-Claude Hennet

  3. Department if Industrial Engineering and, Indian Institute of Technology, Kharagpur, West Bengal, India

    Manoj Kumar Tiwari

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag London

About this chapter

Cite this chapter

Labadie, N., Prodhon, C. (2014). A Survey on Multi-criteria Analysis in Logistics: Focus on Vehicle Routing Problems. In: Benyoucef, L., Hennet, JC., Tiwari, M. (eds) Applications of Multi-Criteria and Game Theory Approaches. Springer Series in Advanced Manufacturing. Springer, London. https://doi.org/10.1007/978-1-4471-5295-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-5295-8_1

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-5294-1

  • Online ISBN: 978-1-4471-5295-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation