A Sampling Procedure for Real-Life Rich Vehicle Routing Problems

Julia Rieck () and Jürgen Zimmermann
Additional contact information
Julia Rieck: Clausthal University of Technology
Jürgen Zimmermann: Clausthal University of Technology

A chapter in Operations Research Proceedings 2006, 2007, pp 355-360 from Springer

Abstract: Abstract In this paper we address a rich variant of the vehicle routing problem which occurs in real-life applications. Among other aspects we take into consideration time windows, simultaneous delivery and pick-up at customer locations, multiple use of vehicles, and timely allocation of vehicles to loading bays at the depot. In order to solve practical instances of the resulting real-life rich vehicle routing problem, efficient methods are required. For this reason, we present a sampling procedure, which is a multi-start algorithm that executes in each call a substantial extension of the well-known savings algorithm. Using a set of suitable benchmark instances, we assess the performance of the proposed sampling procedure.

Keywords: Planning Horizon; Vehicle Rout Problem; Real Vehicle; Feasible Assignment; Simultaneous Delivery (search for similar items in EconPapers)
Date: 2007
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-540-69995-8_58

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

DOI: 10.1007/978-3-540-69995-8_58

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 ().