The vehicle routing problem
Exploring relaxation induced neighborhoods to improve MIP solutions
Mathematical Programming: Series A and B
A general heuristic for vehicle routing problems
Computers and Operations Research
The open vehicle routing problem: Algorithms, large-scale test problems, and computational results
Computers and Operations Research
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem
Transportation Science
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
INFORMS Journal on Computing
Survey: matheuristics for rich vehicle routing problems
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
An integer programming-based local search for the covering salesman problem
Computers and Operations Research
Hi-index | 0.01 |
We address the Open Vehicle Routing Problem (OVRP), a variant of the ''classical'' (capacitated and distance constrained) Vehicle Routing Problem (VRP) in which the vehicles are not required to return to the depot after completing their service. We present a heuristic improvement procedure for OVRP based on Integer Linear Programming (ILP) techniques. Given an initial feasible solution to be possibly improved, the method follows a destruct-and-repair paradigm, where the given solution is randomly destroyed (i.e., customers are removed in a random way) and repaired by solving an ILP model, in the attempt of finding a new improved feasible solution. The overall procedure can be considered as a general framework which could be extended to cover other variants of Vehicle Routing Problems. We report computational results on benchmark instances from the literature. In several cases, the proposed algorithm is able to find the new best known solution for the considered instances.