Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm

被引：63

作者：

Alba, Enrique ^{[1
]}

Dorronsoro, Bernabe ^{[1
]}

机构：

[1] Univ Malaga, Dept Comp Sci, E-29071 Malaga, Spain

来源：

INFORMATION PROCESSING LETTERS | 2006年 / 98卷 / 06期

关键词：

cellular genetic algorithm; hybrid genetic algorithm; vehicle routing problem; algorithms; approximation algorithms; design of algorithms;

D O I：

10.1016/j.ipl.2006.02.006

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The Vehicle Routing Problem (VRP) is a hard combinatorial problem with numerous industrial applications. Among the large number of extensions to the canonical VRP we Study the Capacitated VRP (CVRP), which is mainly characterized by Using vehicles of the same capacity. A Cellular Genetic Algorithm (cGA)-a kind of decentralized Population based heuristic-is used for solving, CVRP. improving several of the best existing results SO far in the literature. Our study shows a high performance in terms of the quality of the solutions found and the number of function evaluations (effort). (c) 2006 Elsevier B.V. All rights reserved.

引用

页码：225 / 230

页数：6

共 21 条

[1] Alba E, 2004, LECT NOTES COMPUT SC, V3004, P11
[2] THE MOLECULAR TRAVELING SALESMAN
BANZHAF, W
[J]. BIOLOGICAL CYBERNETICS, 1990, 64 (01) : 7 - 14
[3] BREEDMAN AV, 1944, THESIS U ANTWERP RUC
[4] Christofides N., 1979, Combinatorial optimization, P315
[5] A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS
CROES, GA
[J]. OPERATIONS RESEARCH, 1958, 6 (06) : 791 - 812
[6] THE TRUCK DISPATCHING PROBLEM
DANTZIG, GB
RAMSER, JH
[J]. MANAGEMENT SCIENCE, 1959, 6 (01) : 80 - 91
[7] AN EVOLUTIONARY APPROACH TO THE TRAVELING SALESMAN PROBLEM
FOGEL, DB
[J]. BIOLOGICAL CYBERNETICS, 1988, 60 (02) : 139 - 144
[8] Gambardella LM., 1999, New Ideas in Optimization, P63
[9] Golden BL, 1998, FLEET MANAGEMENT AND LOGISTICS, P33
[10] Holland JH, 1992, ADAPTATION NATURAL A, DOI DOI 10.7551/MITPRESS/1090.001.0001

← 1 2 3 →