Solving Large-Scale Vehicle Routing Problems

Luca Accorsi and Daniele Vigo ()
Additional contact information
Luca Accorsi: Google
Daniele Vigo: University of Bologna, Department of Electrical, Electronic and Information Engineering “G. Marconi”

Chapter 55 in Handbook of Heuristics, 2025, pp 1673-1695 from Springer

Abstract: Abstract Vehicle routing problems (VRPs) are challenging combinatorial optimization problems that, given their significant impact on distribution logistics, continue to attract considerable research efforts to develop efficient and effective solution methods. As the instance size grows, the combinatorial nature of these problems makes traditional approaches unable to find adequate solutions within a reasonable computing time. Large problem instances typically require the use of specialized scalability techniques that, coupled with the raw computing power of modern machines, make their heuristic resolution possible. This chapter reviews some of the most effective techniques for designing heuristics for large-scale VRPs.

Keywords: Vehicle routing problems; Large-scale instances; Scalability techniques; Heuristics (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-032-00385-0_80

Ordering information: This item can be ordered from
http://www.springer.com/9783032003850

DOI: 10.1007/978-3-032-00385-0_80

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().