An Overview on the Split Delivery Vehicle Routing Problem

Claudia Archetti () and Maria Grazia Speranza ()
Additional contact information
Claudia Archetti: University of Brescia
Maria Grazia Speranza: University of Brescia

A chapter in Operations Research Proceedings 2006, 2007, pp 123-127 from Springer

Abstract: Abstract In the classical Vehicle Routing Problem (VRP) a fleet of capacitated vehicles is available to serve a set of customers with known demand. Each customer is required to be visited by exactly one vehicle and the objective is to minimize the total distance traveled. In the Split Delivery Vehicle Routing Problem (SDVRP) the restriction that each customer has to be visited exactly once is removed, i.e., split deliveries are allowed. In this paper we present a survey of the state-of-the-art on this important problem.

Keywords: Tabu Search; Valid Inequality; Vehicle Route Problem; Tabu Search Algorithm; Local Search Heuristic (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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_20

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

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

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