Solving TSP Problem with Improved Genetic Algorithm

被引:2
|
作者
Fu, Chunhua [1 ]
Zhang, Lijun [1 ]
Wang, Xiaojing [1 ]
Qiao, Liying [1 ]
机构
[1] China Agr Means Prod Assoc, Beijing, Peoples R China
关键词
genetic algorithm; improvement; encode; selection; crossover; mutation;
D O I
10.1063/1.5039131
中图分类号
O59 [应用物理学];
学科分类号
摘要
The TSP is a typical NP problem. The optimization of vehicle routing problem (VRP) and city pipeline optimization can use TSP to solve; therefore it is very important to the optimization for solving TSP problem. The genetic algorithm (GA) is one of ideal methods in solving it. The standard genetic algorithm has some limitations. Improving the selection operator of genetic algorithm, and importing elite retention strategy can ensure the select operation of quality, In mutation operation, using the adaptive algorithm selection can improve the quality of search results and variation, after the chromosome evolved one-way evolution reverse operation is added which can make the offspring inherit gene of parental quality improvement opportunities, and improve the ability of searching the optimal solution algorithm.
引用
收藏
页数:6
相关论文
共 50 条
  • [41] An Improved Genetic Algorithm for Solving Flexible Job shop Scheduling Problem
    Zhou Wei
    Bu Yan-ping
    Zhou Ye-qing
    2013 25TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2013, : 4553 - 4558
  • [42] Solving Job-shop Scheduling Problem by an Improved Genetic Algorithm
    Yang Yanli
    Ke Weiwei
    PRECISION ENGINEERING AND NON-TRADITIONAL MACHINING, 2012, 411 : 588 - 591
  • [43] Improved Genetic Algorithm for Solving Flexible Job Shop Scheduling Problem
    Luo, Xiong
    Qian, Qian
    Fu, Yun Fa
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MECHATRONICS AND INTELLIGENT ROBOTICS (ICMIR-2019), 2020, 166 : 480 - 485
  • [44] Solving Job-Shop Scheduling Problem with Improved Genetic Algorithm
    Wu, Weijun
    Yu, Songnian
    Ding, Wang
    PROCEEDINGS OF 2008 INTERNATIONAL PRE-OLYMPIC CONGRESS ON COMPUTER SCIENCE, VOL II: INFORMATION SCIENCE AND ENGINEERING, 2008, : 348 - 352
  • [45] Improved genetic algorithm for solving optimal communication spanning tree problem
    Hiep, Nguyen Duy
    Binh, Huynh Thi Thanh
    Advances in Intelligent Systems and Computing, 2013, 212 : 405 - 413
  • [46] Solving Multiobjective Flexible Scheduling Problem by Improved DNA Genetic Algorithm
    Li, Jianxiong
    Nie, Shuzhi
    Yang, Fan
    2010 2ND INTERNATIONAL ASIA CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS (CAR 2010), VOL 2, 2010, : 458 - 461
  • [47] Improved immune Genetic Algorithm for solving flow shop scheduling problem
    Liu, M.
    Pang, W.
    Wang, K. P.
    Song, Y. Z.
    Zhou, C. G.
    COMPUTATIONAL METHODS, PTS 1 AND 2, 2006, : 1057 - +
  • [48] An Improved Immune Genetic Algorithm and its Application on TSP
    Ghorab, Ahmed S.
    2021 INTERNATIONAL CONFERENCE ON PROMISING ELECTRONIC TECHNOLOGIES (ICPET 2021), 2021, : 84 - 88
  • [49] Genetic Algorithm Performance with Different Selection Strategies in Solving TSP
    Razali, Noraini Mohd
    Geraghty, John
    WORLD CONGRESS ON ENGINEERING, WCE 2011, VOL II, 2011, : 1134 - 1139
  • [50] An Improved Genetic Algorithm Based on Gene Pool for TSP
    Zhang, Jianping
    Liu, Xiyu
    PERVASIVE COMPUTING AND THE NETWORKED WORLD, 2014, 8351 : 766 - 773