Research on Generalized Traveling Salesman Problem based on Modified Ant Colony Optimization

被引：0
作者：
Li Meng [1 ]
Yu Lin [1 ]
Song Qing [1 ]
Fang Wenjing [1 ]
机构：
[1] Univ Jinan, Coll Elect Engn, Jinan 250022, Peoples R China
来源：
PROCEEDINGS OF THE 2019 31ST CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2019) | 2019年
关键词：
Generalized Traveling Salesman Problem; Ant Colony Optimization; k-opt algorithm; MATLAB;
D O I：
10.1109/ccdc.2019.8833167
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The generalized traveling salesman problem(GTSP) is a typical combinatorial optimization problem. Many practical problems involving the allocation and optimization of multiple tasks can be reduced to the generalized traveling salesman problem. A modified ant colony optimization is proposed for GTSP. The modified ant colony algorithm combines 2-opt algorithm to minimize the total path length, while considering the task balance of different travelers. Simulation results show that the modified ant colony optimization has good optimization accuracy and stability in solving the generalized traveling salesman problem.
引用
收藏
页码：4570 / 4574
页数：5
相关论文
共 15 条
  • [1] [陈建军 Chen Jianjun], 2011, [计算机仿真, Computer Simulation], V28, P268
  • [2] Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892
  • [3] 一种面向对象的多角色蚁群算法及其TSP问题求解
    杜鹏桢
    唐振民
    孙研
    [J]. 控制与决策, 2014, 29 (10) : 1729 - 1736
  • [4] Duan H., 2007, CHINA ENG SCI, V9, P98
  • [5] Duan H. B., 2008, ACTA AERONAUTICA AST, V29, P192
  • [6] Huang X.W., 2008, COMPUTER INTEGRATED, V24, P558
  • [7] Jin H.Y., 2008, NATURE SCI, V18, P887
  • [8] Li Lin, 2010, Control and Decision, V25, P1379
  • [9] Meng Xiang-ping, 2013, Control and Decision, V28, P782
  • [10] Shi EnXiu Shi EnXiu, 2014, Nongye Jixie Xuebao = Transactions of the Chinese Society for Agricultural Machinery, V45, P53
12