Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of GIS pp 1795–1804Cite as

Routing Vehicles, Algorithms

  • Reference work entry
  • First Online:

  • 230 Accesses

Synonyms

Distribution logistics; Fleet management; Record-to-record travel method; Simulated annealing; Threshold accepting method; Vehicle routing problem

Definition

The Vehicle Routing Problem (VRP) (Toth and Vigo 2002) embraces a class of complex combinatorial optimization problems that target the derivation of minimum total cost routes for a number of resources (vehicles) located at a central point (depot) in order to service efficiently a number of demand points (customers). The standard version of VRP (known as basic VRP) is defined on a graph G = (V, A), where V = { u0, u1, …, u n } is the vertex set and A = { (u i , u j ): u i , u j ∈ V, i ≠ j} is the arc set of G. Vertex u0represents a depot (warehouse or distribution centre) that hosts a homogeneous fleet of m vehicles with capacity Q. The remaining vertices correspond to demand points (or equivalently, customers). Each customer u i has a non-negative demand q i . The vector of all customer demands is denoted by q(V)....

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   1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   1,999.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

References

  • Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, Chichester, pp 315–338

    Google Scholar 

  • Dueck G (1993) New optimization heuristics: the great deluge algorithm and the record to record travel. J Comput Phys 104:86–92

    Article  MATH  Google Scholar 

  • Dueck G, Scheuer T (1990) Threshold accepting. A general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90: 161–175

    Article  MathSciNet  MATH  Google Scholar 

  • Golden BL, Wasil EA, Kelly JP, Chao I-M (1998) The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic T, Laporte G (eds) Fleet management and logistics. Kluwer, Boston, pp 33–56

    Chapter  Google Scholar 

  • Gendreau M, Laporte MG, Potvin J-Y (2002) Metaheuristics for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 129–154

    Chapter  Google Scholar 

  • Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  MathSciNet  MATH  Google Scholar 

  • Laporte G, Semet F (2002) Classical heuristics for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 109–128

    Chapter  Google Scholar 

  • Li F, Golden BL, Wasil EA (2004, forthcoming) Very large-scale vehicle routing: new test problems, algorithms, and results. In: Computers & operations research

    Google Scholar 

  • Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41:421–451

    Article  MATH  Google Scholar 

  • Tarantilis CD, Kiranoudis CT (2001) Using the vehicle routing problem for the transportation of hazardous materials. Oper Res Int J 1(1):67–78

    Article  Google Scholar 

  • Tarantilis CD, Kiranoudis CT (2002) Using a spatial decision support system for solving the vehicle routing problem. Inf Manag 39(5):359–375

    Article  Google Scholar 

  • Tarantilis CD, Kiranoudis CT, Vassiliadis VS (2002a) A backtracking adaptive threshold accepting metaheuristic method for the vehicle routing problem. Syst Anal Model Simul 42(5):631–644

    MathSciNet  MATH  Google Scholar 

  • Tarantilis CD, Kiranoudis CT, Vassiliadis VS (2002b) A list based threshold accepting algorithm for the capacitated vehicle routing problem. Int J Comput Math 79(5):537–553

    Article  MATH  Google Scholar 

  • Tarantilis CD, Gendreau M, Spinellis D (2005) The impact of metaheuristic strategies in transportation and logistics applications. IEEE Intell Syst 20(4):16–18

    Article  Google Scholar 

  • Toth P, Vigo D (2002) The vehicle routing problem. SIAM monographs on discrete mathematics and applications, Philadelphia

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Science & Technology, Athens University of Economics & Business, Athens, Greece

    Christos D. Tarantilis

Authors
  1. Christos D. Tarantilis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Minnesota, Minneapolis, MN, USA

    Shashi Shekhar

  2. Management Science and Information Systems Department, Rutgers Business School, Rutgers, The State University of New Jersey, Newark, NJ, USA

    Hui Xiong

  3. Department of Management Sciences, Tippie College of Business, University of Iowa, Iowa City, IA, USA

    Xun Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Tarantilis, C.D. (2017). Routing Vehicles, Algorithms. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_1147

Download citation

Publish with us

Policies and ethics

Search

Navigation