Heuristic Procedures for the Capacitated Vehicle Routing Problem

Authors:
V. Campos;E. Mota
Affiliations:
Departament d'Estadística i Investigació Operativa, Universitat de València, Spain. vicente.campos@uv.es;Departament d'Estadística i Investigació Operativa, Universitat de València, Spain. enrique.mota@uv.es
Venue:
Computational Optimization and Applications
Year:
2000

Citing 4
Cited 1

A user's guide to tabu search

Annals of Operations Research - Special issue on Tabu search
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
Polyhedral study of the capacitated vehicle routing problem

Mathematical Programming: Series A and B
A tabu search heuristic for the vehicle routing problem

Management Science

Optimization of special vehicle routing problem based on ant colony system

ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we present two new heuristic procedures for the Capacitated Vehicle Routing Problem (CVRP). The first one solves the problem from scratch, while the second one uses the information provided by a strong linear relaxation of the original problem. This second algorithm is designed to be used in a branch and cut approach to solve to optimality CVRP instances. In both heuristics, the initial solution is improved using tabu search techniques. Computational results over a set of known instances, most of them with a proved optimal solution, are given.