New operators of genetic algorithms for traveling salesman problem

被引：35

作者：

Ray, SS ^{[1
]}

Bandyopadhyay, S ^{[1
]}

Pal, SK ^{[1
]}

机构：

[1] Indian Stat Inst, Machine Intelligence Unit, Kolkata 700108, India

来源：

PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 2 | 2004年

关键词：

knowledge based multiple inversion; order crossover; knowledge based neighborhood swapping;

D O I：

10.1109/ICPR.2004.1334276

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper-describes an application ofgenetic algorithm to the traveling salesman problem. New knowledge based multiple inversion operator and a neighborhood swapping operator are proposed. Experimental results on different benchmark data sets have been found to provide superior results as compared to some other existing methods.

引用

页码：497 / 500

页数：4

共 6 条

[1]

[Anonymous], 1989, GENETIC ALGORITHM SE

[2]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[3]

LALENA M, TSP SOLVER

[4] Genetic algorithms for the travelling salesman problem:: A review of representations and operators [J].

Larrañaga, P ;

Kuijpers, CMH ;

Murga, RH ;

Inza, I ;

Dizdarevic, S .

ARTIFICIAL INTELLIGENCE REVIEW, 1999, 13 (02) :129-170

[5]

Sur-Kolay S., 2003, 1 IND INT C ART INT

[6]

Syswerda G, 1991, HDB GENETIC ALGORITH, P332

← 1 →