Heuristic Procedures for the Capacitated Vehicle Routing Problem |
| |
Authors: | V. Campos E. Mota |
| |
Affiliation: | (1) Departament d'Estadística i Investigació Operativa, Universitat de València, Spain |
| |
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. |
| |
Keywords: | vehicle routing heuristics tabu search combinatorial optimization |
本文献已被 SpringerLink 等数据库收录! |
|