State-of-the-Art Decision-Making Tools in the Information-Intensive Age 2008
DOI: 10.1287/educ.1080.0046
|View full text |Cite
|
Sign up to set email alerts
|

Recent Developments in Modeling and Solving the Split Delivery Vehicle Routing Problem

Abstract: In the split delivery vehicle routing problem, a customer's demand can be split among several vehicles. In the last five years or so, researchers have proposed exact and approximate solution methods, modeled variants with time windows and pickups, and developed large-scale benchmark problems. In this tutorial, we summarize the recent literature on the split delivery vehicle routing problem, describe solution procedures and results of computational experiments, and suggest directions for future research.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 27 publications
0
6
0
Order By: Relevance
“…Customer demands can be satisfied by several vehicles, each moving a partial load. This variant is called VRP with split deliveries (SDVRP), as reviewed in Chen et al (2007), Gulczynski et al (2008) and Archetti and Speranza (2011). Instances with up to 50 customers (Belenguer et al 2000, Lee et al 2006) can be exactly solved.…”
Section: Heuristics For Vrp Variants With Assign Attributesmentioning
confidence: 99%
“…Customer demands can be satisfied by several vehicles, each moving a partial load. This variant is called VRP with split deliveries (SDVRP), as reviewed in Chen et al (2007), Gulczynski et al (2008) and Archetti and Speranza (2011). Instances with up to 50 customers (Belenguer et al 2000, Lee et al 2006) can be exactly solved.…”
Section: Heuristics For Vrp Variants With Assign Attributesmentioning
confidence: 99%
“…Dergis, Li & Vogel [9] added a local search-based heuristic to SDVRP. Studies conducted by Archetti, Savelsbergh, and Spranza [10] as well as those by Gulczynski, Golden, and Wasil [11] are good sources for understanding the recent advances in SDVRP modeling and solutions [12].…”
Section: Research Literaturementioning
confidence: 99%
“…Several more advanced pairing strategies were proposed by Lei et al (2012); Erera et al (2009). A better collaborative representative, however, is that of Split Deliveries Trudeau, 1989, 1990;Mullaseril et al, 1997) (for reviews, see: (Gulczynski et al, 2008;Archetti and Speranza, 2012)). In this case, individual tasks may be served by more than a single vehicle, allowing distance-cost savings of up to 50% on static instances (in extreme cases), provided the Triangle Inequality holds.…”
Section: Collaborative Routingmentioning
confidence: 99%