Construction and Improvement Heuristics applied to the Capacitated Vehicle Routing Problem

被引：0

作者：

Tavares, Leonardo G. ^{[1
]}

Lopes, Heitor S. ^{[2
]}

Lima, Carlos R. Erig ^{[2
]}

机构：

[1] Posit Univ, Dept Elect Engn, Rua Prof Pedro Viriato P de Souza 5300, BR-81280330 Curitiba, Parana, Brazil

[2] Federal Univ Technol Parana UTFPR, Bioinformat Lab, BR-8023090 Curitiba, Parana, Brazil

来源：

2009 WORLD CONGRESS ON NATURE & BIOLOGICALLY INSPIRED COMPUTING (NABIC 2009) | 2009年

关键词：

Heuristics; Capacitated Vehicle Routing Problem; Combinatorial optimization; TRAVELING-SALESMAN PROBLEM; TABU SEARCH; DISPATCHING PROBLEM; ALGORITHM;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The capacitated vehicle routing is a combinatorial optimization problem of that has aroused major interest because it is present in critical areas (logistics, transport and other) and it is a problem of considerable difficulty There are currently several techniques that have been developed to try to solve this problem efficiently. In this paper, we present a solution to this problem based on the strategy of different single techniques combination to obtain the best results. Computing experiments have been conducted on six instances of well-known data sets available in literature.

引用

页码：689 / +

页数：2

共 14 条

[1]

[Anonymous], 2001, TION ENGRG

[2] Separating capacity constraints in the CVRP using tabu search [J].