Advanced intelligent technique of real genetic algorithm for Traveling Salesman Problem optimization

被引:0
|
作者
Awad, A. R. [1 ]
Von Poser, I. [2 ]
Aboul-Ela, M. T. [3 ]
机构
[1] Tishreen Univ, Dept Environm Engn, Latakia, Syria
[2] Merck KGaA, Darmstadt, Germany
[3] Menia Univ, Dept Civil Engn, Al Minya, Egypt
关键词
intelligent technique; real genetic algorithms; optimization; traveling salesman problem; large-scale example;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This work aims at solving the Traveling Salesman Problem (TSP) through developing an advanced intelligent technique based on real genetic algorithm (GA). The used GA comprises real-value coding with specific behavior taking each code as it is (whether binary, integer, or real), rank selection, and efficient uniform genetic operators. The results indicated, in comparison with the other applied optimization methods (linear, dynamic, Monte Carlo and heuristic search methods), that the real GA produces significantly the lowest distance (least cost tour) solution. It is concluded that real GA approach is robust and it represents an efficient search method and is easily applied to nonlinear and complex problems of the TSP in the field of solid waste routing system in the large cities.
引用
收藏
页码:447 / 453
页数:7
相关论文
共 50 条
  • [1] An advanced Genetic Algorithm for Traveling Salesman Problem
    Wang Youping
    Li Liang
    Chen Lin
    THIRD INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTING, 2009, : 101 - +
  • [2] Traveling Salesman Problem Optimization with Parallel Genetic Algorithm
    Cakir, Murat
    Yilmaz, Guray
    2015 23RD SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2015, : 2557 - 2560
  • [3] Optimization for multiple traveling salesman problem based on genetic algorithm
    Management School, Hangzhou Dianzi University, Hangzhou, China
    不详
    J Mech Eng Res Dev, 2 (62-69):
  • [4] Enhanced Traveling Salesman Problem Solving by Genetic Algorithm Technique (TSPGA)
    Al-Dulaimi, Buthainah Fahran
    Ali, Hamza A.
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 28, 2008, 28 : 296 - 302
  • [5] Solving Traveling Salesman Problem by Genetic Ant Colony Optimization Algorithm
    Gao, Shang
    DCABES 2008 PROCEEDINGS, VOLS I AND II, 2008, : 597 - 602
  • [6] Optimization of multiple traveling salesman problem based on hierarchical genetic algorithm
    Zhou, Hui-Ren
    Tang, Wan-Sheng
    Niu, Ben
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2009, 31 (11): : 2630 - 2633
  • [7] A genetic algorithm for the generalized traveling salesman problem
    Tasgetiren, M. Fatih
    Suganthan, P. N.
    Pan, Quan-Ke
    Liang, Yun-Chia
    2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 2382 - +
  • [8] Novel genetic algorithm for traveling salesman problem
    Congwen Zeng
    Tianlong Gu
    Lingzhong Zhao
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2006, 13 : 859 - 863
  • [9] Genetic Algorithm for the Dubins Traveling Salesman Problem
    Yu, Xin
    Hung, John Y.
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS (ISIE), 2012, : 1256 - 1261
  • [10] An improved genetic algorithm for the traveling salesman problem
    Li, Lijie
    Zhang, Ying
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF CONTEMPORARY INTELLIGENT COMPUTING TECHNIQUES, 2007, 2 : 208 - +