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.

Improved lower bounds for the Split Delivery Vehicle Routing Problem

2010 ◽  
Vol 38 (4) ◽  
pp. 302-306 ◽  
Author(s):  
Lorenza Moreno ◽  
Marcus Poggi de Aragão ◽  
Eduardo Uchoa
Keyword(s):  
Vehicle Routing ◽  
Lower Bounds ◽  
Vehicle Routing Problem ◽  
Delivery Vehicle ◽  
Routing Problem ◽  
Split Delivery
Sign in / Sign up

Export Citation Format

Share Document