Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Windows
Christoph Hertrich (),
Philipp Hungerländer () and
Christian Truden ()
Additional contact information
Christoph Hertrich: Technische Universität Kaiserslautern
Philipp Hungerländer: Alpen-Adria-Universität Klagenfurt
Christian Truden: Alpen-Adria-Universität Klagenfurt
A chapter in Operations Research Proceedings 2018, 2019, pp 127-133 from Springer
Abstract:
Abstract The capacitated Vehicle Routing Problem with structured Time Windows (cVRPsTW) is concerned with finding optimal tours for vehicles with given capacity constraints to deliver goods to customers within assigned time windows. In our problem variant these time windows have a special structure, namely they are non-overlapping and each time window holds several customers. This is a reasonable assumption for Attended Home Delivery services. Sweep algorithms are known as simple, yet effective heuristics for the classical capacitated Vehicle Routing Problem. We propose variants of the sweep algorithm that are not only able to deal with time windows, but also exploit the additional structure of the time windows in a cVRPsTW. Afterwards we suggest local improvement heuristics to decrease our objective function even further. A carefully constructed benchmark set that resembles real-world data is used to prove the efficacy of our algorithms in a computational study.
Keywords: Vehicle routing; Time windows; Sweep algorithm; Attended home delivery; Transportation; Logistics (search for similar items in EconPapers)
Date: 2019
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:oprchp:978-3-030-18500-8_17
Ordering information: This item can be ordered from
http://www.springer.com/9783030185008
DOI: 10.1007/978-3-030-18500-8_17
Access Statistics for this chapter
More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().