Traveling Salesman Problem of Optimization based on Genetic Algorithms

被引：0

作者：

Ellili, Walid ^{[1
]}

Samet, Mounir ^{[1
]}

Kachouri, Abdennaceur ^{[1
]}

机构：

[1] Univ Sfax, LETI, ENIS Sfax, Sfax, Tunisia

来源：

2017 INTERNATIONAL CONFERENCE ON SMART, MONITORED AND CONTROLLED CITIES (SM2C) | 2017年

关键词：

Fitness; Optimization; Distance; Genetic Algorithms; Traveling Salesman Problem;

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Traveling Salesman Problem consists in finding the shortest distance commercial representatives should undertake on visiting the 24 cities in Tunisia prior to resuming the initial departure point. Such a deceptive issue appears to stand as a remarkable challenge in computational mathematics. The purpose of this paper lies in implementing genetic Mat lab's algorithms toolbox gads in a bid to cope with such a problem.

引用

页码：123 / 127

页数：5

共 8 条

[1]

[Anonymous], 1964, On the Origin of Species, DOI 10.5962/bhl.title.82303

[2] DYNAMIC PROGRAMMING TREATMENT OF TRAVELLING SALESMAN PROBLEM [J].

BELLMAN, R .

JOURNAL OF THE ACM, 1962, 9 (01) :61-&

[3] TRAVELING SALESMAN PROBLEM - A SURVEY [J].

BELLMORE, M ;

NEHAUSE.GL .

OPERATIONS RESEARCH, 1968, 16 (03) :538-&

[4]

Bourazza S., 2006, THESIS

[5] Genetic algorithms and traveling salesman problems [J].

Chatterjee, S ;

Carrera, C ;

Lynch, LA .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (03) :490-510

[6]

Goldberg D.E., 1989, Complex Syst., V3, P493, DOI DOI 10.1007/978-1-4757-3643-4

[7]

Huang L, 2003, PROG NAT SCI-MATER, V13, P295

[8]

Rego C, 1994, PROBLEME TOURNEES VE

← 1 →