A column generation approach for the split delivery vehicle routing problem

Networks ◽  
2011 ◽  
Vol 58 (4) ◽  
pp. 241-254 ◽  
Author(s):  
C. Archetti ◽  
N. Bianchessi ◽  
M. G. Speranza
Keyword(s):  
Vehicle Routing ◽  
Column Generation ◽  
Vehicle Routing Problem ◽  
Delivery Vehicle ◽  
Routing Problem ◽  
Split Delivery

A Column Generation Procedure for the Split Delivery Vehicle Routing Problem Using a Route-Based Formulation

2014 ◽  
Vol 5 (4) ◽  
pp. 44-63
Author(s):  
Joseph Hubert Wilck IV ◽  
Tom M. Cavalier
Keyword(s):  
Vehicle Routing ◽  
Column Generation ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Computer Time ◽  
Delivery Vehicle ◽  
Solution Quality ◽  
Routing Problem ◽  
Split Delivery ◽  
Generation Procedure

The Split Delivery Vehicle Routing Problem (SDVRP) allows customers to be assigned to multiple routes. A column generation procedure using a route-based formulation is developed for the SDVRP and computational results are given for thirty-two data sets from previous literature. The SDVRP route-based formulation appears tighter (stronger) linear relaxation than a comparable SDVRP flow formulation. With respect to the total travel distance and computer time, the column generation procedure compares favorably versus previously published methods. The result is important for real-world since both the tractability and solution quality of larger (e.g., many vehicle routes, many customers) problems are both key issues when making vehicle routing decisions. The column generation method, along with the route-based formulation, provides an improved solution procedure that would be more appropriate for real-world problems than the previously published methods.

Branch-and-cut algorithms for the split delivery vehicle routing problem

2014 ◽  
Vol 238 (3) ◽  
pp. 685-698 ◽  
Author(s):  
Claudia Archetti ◽  
Nicola Bianchessi ◽  
M. Grazia Speranza
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Branch And Cut ◽  
Delivery Vehicle ◽  
Routing Problem ◽  
Split Delivery

A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts

2012 ◽  
Vol 7 (7) ◽  
pp. 1597-1609 ◽  
Author(s):  
Yupei Xiong ◽  
Damon Gulczynski ◽  
Daniel Kleitman ◽  
Bruce Golden ◽  
Edward Wasil
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Case Analysis ◽  
Worst Case Analysis ◽  
Delivery Vehicle ◽  
Worst Case ◽  
Routing Problem ◽  
Split Delivery

A novel approach to solve the split delivery vehicle routing problem

2016 ◽  
Vol 24 (1-2) ◽  
pp. 27-41 ◽  
Author(s):  
Ping Chen ◽  
Bruce Golden ◽  
Xingyin Wang ◽  
Edward Wasil
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Delivery Vehicle ◽  
Routing Problem ◽  
Split Delivery ◽  
Novel Approach

Practical aspects of the split delivery vehicle routing problem (SDVRP)

2018 ◽  
Vol 120 ◽  
pp. 155-166
Author(s):  
Marek Karkula
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Route Planning ◽  
Product Distribution ◽  
Delivery Vehicle ◽  
Routing Problem ◽  
Split Delivery ◽  
Delivery Planning ◽  
Distribution Company ◽  
Planning Problems

Transport process arrangement and delivery route planning is one of the most important tasks of managers in distribution, trade and production enterprises. The problem of route planning concerns the rationalization of product distribution processes offered by company for the customer's network. In operational research, such a problem is included in the class of issues of Vehicle Routing Problem – VRP. The VRP delivery planning problems constitute a wide family of issues arising primarily from the conditions and constraints of the practice. The paper presents the practical application of one of the VRP variants – the problem of arranging routes for the Split Delivery Vehicle Routing Problem – SDVRP, and the results of analyses based on research carried out in a distribution company.

Sign in / Sign up

Export Citation Format

Share Document