An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

Authors:
Claudia Archetti;M. Grazia Speranza;Martin W. P. Savelsbergh
Affiliations:
Department of Quantitative Methods, University of Brescia, 25122 Brescia, Italy;Department of Quantitative Methods, University of Brescia, 25122 Brescia, Italy;School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
Venue:
Transportation Science
Year:
2008

Citing 0
Cited 18

Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

Operations Research
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem

INFORMS Journal on Computing
A tabu search with vocabulary building approach for the vehicle routing problem with split demands

International Journal of Metaheuristics
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic

Transportation Science
An ILP improvement procedure for the Open Vehicle Routing Problem

Computers and Operations Research
Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem

Computers and Operations Research
Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems

INFORMS Journal on Computing
Survey: matheuristics for rich vehicle routing problems

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows

Transportation Science
Kernel Search: a new heuristic framework for portfolio selection

Computational Optimization and Applications
A Column-Generation Based Tactical Planning Method for Inventory Routing

Operations Research
Branch-and-Price guided search

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times

Journal of Intelligent Manufacturing
A branch-and-price guided search approach to maritime inventory routing

Computers and Operations Research
Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem

INFORMS Journal on Computing
Improved Load Plan Design Through Integer Programming Based Local Search

Transportation Science
Local search techniques for a routing-packing problem

Computers and Industrial Engineering
Experience with a framework for developing heuristics for solving rich vehicle routing problems

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The split delivery vehicle routing problem is concerned with serving the demand of a set of customers with a fleet of capacitated vehicles at minimum cost. Contrary to what is assumed in the classical vehicle routing problem, a customer can be served by more than one vehicle, if convenient. We present a solution approach that integrates heuristic search with optimization by using an integer program to explore promising parts of the search space identified by a tabu search heuristic. Computational results show that the method improves the solution of the tabu search in all but one instance of a large test set.