Skip to main content
SpringerLink
Log in

Recent Heuristics and Algorithms for Solving the Vehicle Routing Problems

  • Conference paper
  • First Online:
International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012) Proceedings

Abstract

The exponential rise in the advances of computing power has opened new domains for better solutions for the different classes of the Vehicle Routing Problems (VRP). This paper sheds some light on the recent work published in this field of interest and provides a classification of different problem structures and the solution methodologies used to tackle every class. The classification is made considering the limited space and to the best of our knowledge. Some of the current applications of the vehicle routing problem are also included in this paper. Finally, a discussion on the possible future directions and conclusion is presented in the last section.

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 389.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 499.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  • Ai TJ, Kachitvichyanukul V (2009a) A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 36:1693–1702

    Article  MATH  Google Scholar 

  • Ai TJ, Kachitvichyanukul V (2009b) Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput Ind Eng 56:380–387

    Article  Google Scholar 

  • Baker B, Ayechew M (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30:787–800

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Barnhart C, Laporte G (eds) Vehicle routing. Handbook in OR & MS, vol 14, chap 6. Elsevier, Amsterdam

    Google Scholar 

  • Bin Y, Zhong-Zhen Y, Baozhen Y (2009) An improved ant colony optimization for vehicle routing problem. Eur J Oper Res 196:171–176

    Article  MATH  Google Scholar 

  • Chan Y, Carter WB, Burnes MD (2001) A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Comput Oper Res 28:803–826

    Article  MathSciNet  MATH  Google Scholar 

  • Dantzig G, Fulkerson D, Johnson D (1954) Solution of large-scale travelling salesman problem. Oper Res 2:393–410

    Article  MathSciNet  Google Scholar 

  • Dantzig G, Ramser J (1959) The truck dispatching problem. Manage Sci 6:80–91

    Article  MathSciNet  MATH  Google Scholar 

  • Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57:1472–1483

    Article  Google Scholar 

  • Ghose MK, Dikshit AK, Sharma SK (2006) A GIS based transportation model for solid waste disposal—a case study on Asansol municipality. Waste Manag 26:1287–1293

    Article  Google Scholar 

  • Ghoseiria K, Ghannadpoura 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 

  • Godinho M, Gouveia L, Magnanti T (2008) Combined route capacity and route length models for unit demand vehicle routing problems. Discrete Optim 5:350–372

    Article  MathSciNet  MATH  Google Scholar 

  • Hadjar A, Soumis F (2009) Dynamic window reduction for the multi-depot vehicle scheduling with time window. Comput Ind Eng 36:2160–2172

    MATH  Google Scholar 

  • Ho SC, Haugland D (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput Oper Res 31:1947–1964

    Article  MATH  Google Scholar 

  • Ho W, Ho GT, Ji P, Lau H (2008) A hybrid genetic algorithm for the multi-depot vehicle routing problem. Eng Appl Artif Intell 21:548–557

    Article  Google Scholar 

  • Imai A, Nishimura E, Current J (2007) Lagrangian relaxation-based heuristic for the vehicle routing with full container load. Eur J Oper Res 176:87–105

    Article  MathSciNet  MATH  Google Scholar 

  • Kang K, Lee B, Lee Y, Lee Y (2008) A heuristic for the vehicle routing problem with due times. Comput Ind Eng 54:421–431

    Article  Google Scholar 

  • Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks. pp 1942–1948

    Google Scholar 

  • Le Bouthillier A, Crainic TG (2005) A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Comput Oper Res 32:1685–1708

    Article  MATH  Google Scholar 

  • Lin CKY (2008) A cooperative strategy for a vehicle routing problem with pickup and delivery time windows. Comput Ind Eng 55:766–782

    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 

  • Marinakis Y, Marinaki M (2010a) A hybrid genetic—particle swarm optimization algorithm for the vehicle routing problem. Expert Syst Appl 37:1446–1455

    Article  MathSciNet  Google Scholar 

  • Marinakis Y, Marinaki M (2010b) A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem. Comput Oper Res 37:432–442

    Article  MathSciNet  MATH  Google Scholar 

  • Marinakis Y, Marinaki M, Dounias G (2010) A hybrid particle swarm optimization algorithm for the vehicle routing problem. Eng Appl Artif Intell 23:463–472

    Article  Google Scholar 

  • Nolz PC, Absi N, Feillet D (2011) Optimization of infectious medical waste collection using RFID. In: Böse JW et al (eds) Proceedings of ICCL 2011, vol 6971. LNCS, pp 86–100

    Google Scholar 

  • Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34:2403–2435

    Article  MathSciNet  MATH  Google Scholar 

  • Rieck J, Zimmermann J (2009) A hybrid algorithm for vehicle routing of less-than-truckload carriers. Geiger MJ et al (eds) Metaheuristics in the service industry. Lecture Notes in Economics and Mathematical Systems, vol 624

    Google Scholar 

  • Ropke S, Pisinger D (2006) A unified heuristic for a large class of vehicle routing problems with backhauls. Eur J Oper Res 171:750–775

    Article  MathSciNet  MATH  Google Scholar 

  • Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of IEEE international conference on evolutionary computation, pp 69–73

    Google Scholar 

  • Subramanian A, Drummonda LMA, Bentes C, Ochi LS, Farias R (2010) A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 37:1899–1911

    Article  MATH  Google Scholar 

  • Tang J, Zhang J, Pan Z (2010) A scatter search algorithm for solving vehicle routing problem with loading cost. Expert Syst Appl 37:4073–4083

    Article  Google Scholar 

  • Tavakkoli-Moghaddam R, Saremi A, Ziaee M (2006) A memetic algorithm for the vehicle routing problem with backhauls. Appl Math Comput 181:1049–1060

    Article  MathSciNet  MATH  Google Scholar 

  • Ustundug A, Cevican E (2008) Vehicle routing optimization for RFID integrated waste collection system. Int J Inf Technol Decis Making 7(4):611–625

    Article  Google Scholar 

  • Wassan NA, Wassan AH, Nagy G (2008) A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J Comb Optim 15(368):386

    MathSciNet  Google Scholar 

Download references

Acknowledgments

This research project is sponsored by the Egyptian ministry of higher education grant and the Japanese International Cooperation Agency (JICA) in the scope of the Egypt Japan University of Science and Technology.

Author information

Authors and Affiliations

  1. Industrial Engineering and Systems Management, Egypt Japan University of Science and Technology, New Borg El-Arab City, Alexandria, 21934, Egypt

    A. A. Abdelhalim & A. B. Eltawil

Authors
  1. A. A. Abdelhalim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. B. Eltawil
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. A. Abdelhalim .

Editor information

Editors and Affiliations

  1. Industrial Engineering Institution of CM, 92 Wenjin Road, Nankai District, Tianjin, 300072, China, People's Republic

    Ershi Qi

  2. Industrial Engineering Institution of CM, 92 Wenjin Road, Nankai District, Tianjin, 300072, China, People's Republic

    Jiang Shen

  3. , College of Management and Economics, Tianjin University, 92 Wenjin Road, Tianjin, 300072, China, People's Republic

    Runliang Dou

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdelhalim, A.A., Eltawil, A.B. (2013). Recent Heuristics and Algorithms for Solving the Vehicle Routing Problems. In: Qi, E., Shen, J., Dou, R. (eds) International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012) Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38445-5_114

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38445-5_114

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38444-8

  • Online ISBN: 978-3-642-38445-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation