Heuristic Procedures for the Capacitated Vehicle Routing Problem

被引：0
|
作者：
V. Campos
E. Mota
机构：
[1] Universitat de València,Departament d'Estadística i Investigació Operativa
来源：
Computational Optimization and Applications | 2000年 / 16卷
关键词：
vehicle routing; heuristics; tabu search; combinatorial optimization;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：265 / 277
页数：12
相关论文
共 50 条
12345