A hybrid algorithm of n-OPT and GA to solve dynamic TSP

被引：0
|
作者：
Liu, Z [1 ]
Kang, LS
机构：
[1] China Univ Geosci, Dept Informat Engn, Wuhan 430074, Hubei, Peoples R China
[2] China Univ Geosci, Dept Comp Sci & Technol, Wuhan 430074, Peoples R China
来源：
GRID AND COOPERATIVE COMPUTING, PT 2 | 2004年 / 3033卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We proposed the concept dynamic traveling salesman problem (Dynamic TSP). According to the characteristics of Dynamic TSP, we used a hybrid algorithm of n-OPT and GA to solve it. 2-OPT and 3-OPT are used in GA procedures of mutation and selection. The productivity and quality of solutions under dynamic conditions are evaluated by the experiment.
引用
收藏
页码：1030 / 1033
页数：4
相关论文
共 50 条
  • [1] An Improved 2-opt and ACO Hybrid Algorithm for TSP
    Zhang Yuru
    Wang Chenyang
    Li Hui
    Su Xiaodong
    Zhao Ming
    Zhang Nan
    [J]. 2018 EIGHTH INTERNATIONAL CONFERENCE ON INSTRUMENTATION AND MEASUREMENT, COMPUTER, COMMUNICATION AND CONTROL (IMCCC 2018), 2018, : 547 - 552
  • [2] Hybrid Artificial Fish Algorithm to Solve TSP Problem
    Cheng, Chun-ying
    Li, Hai-Feng
    Bao, Chun-Hua
    [J]. PROCEEDINGS OF THE 6TH INTERNATIONAL ASIA CONFERENCE ON INDUSTRIAL ENGINEERING AND MANAGEMENT INNOVATION, VOL 2: INNOVATION AND PRACTICE OF INDUSTRIAL ENGINEERING AND MANAGMENT, 2016, : 275 - 285
  • [3] An Improved Hybrid Discrete Particle Swarm Optimization Algorithm to Solve the TSP Problem
    Xiao Bin
    Li Zhaohui
    [J]. MECHANICAL AND ELECTRONICS ENGINEERING III, PTS 1-5, 2012, 130-134 : 3589 - 3594
  • [4] A Hybrid Algorithm for TSP
    Huang Zhangcan & Lu liuang(Wuhan Lniversity of Automobile Polytechnic
    [J]. Wuhan University Journal of Natural Sciences, 1996, (Z1) : 461 - 464
  • [5] An efficient algorithm to solve the E-TSP
    AlMulhem, M
    ALMaghrabi, T
    [J]. 1997 CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, CONFERENCE PROCEEDINGS, VOLS I AND II: ENGINEERING INNOVATION: VOYAGE OF DISCOVERY, 1997, : 269 - 272
  • [6] A New Memetic Algorithm to Solve the Stochastic TSP
    Luo, Yueting
    Dib, Omar
    Zian, Jin
    Hu Bingxu
    [J]. PAAP 2021: 2021 12TH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING, 2021, : 69 - 75
  • [7] Using combination of ant algorithm and immune algorithm to solve TSP
    Liu, Zhao-Hua
    Zhang, Ying-Jie
    Zhang, Jing
    Wu, Jian-Hui
    [J]. Kongzhi yu Juece/Control and Decision, 2010, 25 (05): : 695 - 700
  • [8] Smoothed Analysis of the 2-Opt Algorithm for the General TSP
    Englert, Matthias
    Roeglin, Heiko
    Voecking, Berthold
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2016, 13 (01)
  • [9] Optimizing Fruit Fly Algorithm to Solve TSP Problem
    Huang, Yaqing
    Su, Tao
    [J]. 2017 INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS, ELECTRONICS AND CONTROL (ICCSEC), 2017, : 1409 - 1411
  • [10] Study of genetic algorithm with reinforcement learning to solve the TSP
    Liu, Fei
    Zeng, Guangzhou
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (03) : 6995 - 7001
12345