Genetic Algorithms with Oracle for the Traveling Salesman Problem

被引：0
|
作者：
Gremlich, Robin
Hamfelt, Andreas [1 ]
de Pereda, Hector
Valkovsky, Vladislav [1 ]
机构：
[1] Uppsala Univ, Dept Informat Sci, Uppsala, Sweden
来源：
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 7 | 2005年 / 7卷
关键词：
Genetic algorithms; Traveling Salesman Problem; optimal decision distribution; Oracle;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
By introducing the concept of Oracle we propose an approach for improving the performance of genetic algorithms for large-scale asymmetric Traveling Salesman Problems. The results have shown that the proposed approach allows overcoming some traditional problems for creating efficient genetic algorithms.
引用
收藏
页码：27 / 32
页数：6
相关论文
共 50 条
  • [41] An Efficient Genetic Algorithm for the Traveling Salesman Problem
    Sun, Guangfu
    Li, Chengjun
    Zhu, Jiacheng
    Li, Yanpeng
    Liu, Wei
    [J]. COMPUTATIONAL INTELLIGENCE AND INTELLIGENT SYSTEMS, 2010, 107 : 108 - 116
  • [42] An improved genetic algorithm for the traveling salesman problem
    Li, Lijie
    Zhang, Ying
    [J]. ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF CONTEMPORARY INTELLIGENT COMPUTING TECHNIQUES, 2007, 2 : 208 - +
  • [43] Genetic Algorithm for the Dubins Traveling Salesman Problem
    Yu, Xin
    Hung, John Y.
    [J]. 2012 IEEE INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS (ISIE), 2012, : 1256 - 1261
  • [44] Genetic codes optimized as a traveling salesman problem
    Attie, Oliver
    Sulkow, Brian
    Di, Chong
    Qiu, Weigang
    [J]. PLOS ONE, 2019, 14 (10):
  • [45] A novel ODV crossover operator-based genetic algorithms for traveling salesman problem
    P. Victer Paul
    C. Ganeshkumar
    P. Dhavachelvan
    R. Baskaran
    [J]. Soft Computing, 2020, 24 : 12855 - 12885
  • [46] An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem
    Jin, HD
    Leung, KS
    Wong, ML
    Xu, ZB
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2003, 33 (06): : 877 - 888
  • [47] Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
    Liu, Yu-Hsin
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2010, 216 (01) : 125 - 137
  • [48] Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms
    Albayrak, Murat
    Allahverdi, Novruz
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (03) : 1313 - 1320
  • [49] A novel ODV crossover operator-based genetic algorithms for traveling salesman problem
    Victer Paul, P.
    Ganeshkumar, C.
    Dhavachelvan, P.
    Baskaran, R.
    [J]. SOFT COMPUTING, 2020, 24 (17) : 12855 - 12885
  • [50] Using Genetic Algorithms to minimize the distance and balance the routes for the multiple Traveling Salesman Problem
    Alves, Raulcezar M. F.
    Lopes, Carlos R.
    [J]. 2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 3171 - 3178
12345