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
相关论文
共 50 条
  • [21] Genetic Algorithms Based on Clustering for Traveling Salesman Problems
    Tan, Lizhuang
    Tan, Yanyan
    Yun, Guoxiao
    Wu, Yanna
    2016 12TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY (ICNC-FSKD), 2016, : 103 - 108
  • [22] A novel ODV crossover operator-based genetic algorithms for traveling salesman problem
    P. Victer Paul
    C. Ganeshkumar
    P. Dhavachelvan
    R. Baskaran
    Soft Computing, 2020, 24 : 12855 - 12885
  • [23] A novel ODV crossover operator-based genetic algorithms for traveling salesman problem
    Victer Paul, P.
    Ganeshkumar, C.
    Dhavachelvan, P.
    Baskaran, R.
    SOFT COMPUTING, 2020, 24 (17) : 12855 - 12885
  • [24] THE TRAVELING SALESMAN PROBLEM - APPROXIMATE ALGORITHMS
    MELAMED, II
    SERGEEV, SI
    SIGAL, IK
    AUTOMATION AND REMOTE CONTROL, 1989, 50 (11) : 1459 - 1479
  • [25] Approximation algorithms for the traveling salesman problem
    Monnot, J
    Paschos, VT
    Toulouse, S
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2003, 56 (03) : 387 - 405
  • [26] AN ANALYSIS OF ALGORITHMS FOR TRAVELING SALESMAN PROBLEM
    BELLMORE, M
    NEMHAUSE.GL
    OPERATIONS RESEARCH, 1966, S 14 : B208 - &
  • [27] Approximation algorithms for the traveling salesman problem
    Jérôme Monnot
    Vangelis Th. Paschos
    Sophie Toulouse
    Mathematical Methods of Operations Research, 2003, 56 : 387 - 405
  • [28] Genetic algorithms and traveling salesman problems
    Chatterjee, S
    Carrera, C
    Lynch, LA
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (03) : 490 - 510
  • [29] Modified Edge recombination operators of genetic algorithms for the traveling salesman problem
    Nguyen, HD
    Yoshihara, I
    Yasunaga, M
    IECON 2000: 26TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, VOLS 1-4: 21ST CENTURY TECHNOLOGIES AND INDUSTRIAL OPPORTUNITIES, 2000, : 2815 - 2820
  • [30] New Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem
    Radovic, Marija
    Milutinovic, Veljko
    IPSI BGD TRANSACTIONS ON INTERNET RESEARCH, 2006, 2 (02): : 53 - 58
12345