Pheromone Model Selection in Ant Colony Optimization for the Travelling Salesman Problem

被引:0
|
作者
LIU Shufen [1 ]
LENG Huang [1 ]
HAN Lu [1 ]
机构
[1] College of Computer Science and Technology,Jilin University
基金
中国国家自然科学基金;
关键词
Ant colony optimization(ACO); Pheromone model selection; The travelling salesman problem;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
As a meta-heuristic approach,Ant colony optimization(ACO) has many applications.In the algorithm selection of pheromone models is the top priority.Selecting pheromone models that don’t suffer negative biases is a natural choice.Specifically for the travelling salesman problem,the first order pheromone is widely recognized.When come across travelling salesman problem,we study the reasons for the success of ant colony optimization from the perspective of pheromone models,and unify different order pheromone models.In tests,we have introduced the concept of sample locations and the similarity coefficient to pheromone models.The first order pheromone model and the second order pheromone model are compared and are further analysed.We illustrate that the second order pheromone model has better global search ability and diversity of population than the former.With appropriate-scale travelling salesman problems,the second order model performs better than the first order pheromone model.
引用
收藏
页码:223 / 229
页数:7
相关论文
共 50 条
  • [1] Pheromone Model Selection in Ant Colony Optimization for the Travelling Salesman Problem
    Liu Shufen
    Leng Huang
    Han Lu
    CHINESE JOURNAL OF ELECTRONICS, 2017, 26 (02) : 223 - 229
  • [2] Modified Ant Colony Optimization with Pheromone Mutation for Travelling Salesman Problem
    Ratanavilisagul, Chiabwoot
    2017 14TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING/ELECTRONICS, COMPUTER, TELECOMMUNICATIONS AND INFORMATION TECHNOLOGY (ECTI-CON), 2017, : 411 - 414
  • [3] A Modified Ant Colony Optimization Algorithm with Pheromone Mutations for Dynamic Travelling Salesman Problem
    Goel, Lavika
    Vaishnav, Giriraj
    Ramola, Siddharth Chand
    Purohit, Tushar
    IETE TECHNICAL REVIEW, 2023, 40 (06) : 767 - 782
  • [4] An ant colony optimization algorithm for multiple travelling salesman problem
    Pan Junjie
    Wang Dingwei
    ICICIC 2006: FIRST INTERNATIONAL CONFERENCE ON INNOVATIVE COMPUTING, INFORMATION AND CONTROL, VOL 1, PROCEEDINGS, 2006, : 210 - +
  • [5] A memetic ant colony optimization algorithm for the dynamic travelling salesman problem
    Michalis Mavrovouniotis
    Shengxiang Yang
    Soft Computing, 2011, 15 : 1405 - 1425
  • [6] A memetic ant colony optimization algorithm for the dynamic travelling salesman problem
    Mavrovouniotis, Michalis
    Yang, Shengxiang
    SOFT COMPUTING, 2011, 15 (07) : 1405 - 1425
  • [7] Deep Intelligent Ant Colony Optimization for Solving Travelling Salesman Problem
    Wang Y.
    Chen M.
    Xing L.
    Wu Y.
    Ma W.
    Zhao H.
    1600, Science Press (58): : 1586 - 1598
  • [8] Variation of Ant Colony Optimization Parameters for Solving the Travelling Salesman Problem
    Cheong, Pui Yue
    Aggarwal, Deepa
    Hanne, Thomas
    Dornberger, Rolf
    2017 IEEE 4TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING & MACHINE INTELLIGENCE (ISCMI), 2017, : 60 - 65
  • [9] Frequency Graphs for Travelling Salesman Problem Based on Ant Colony Optimization
    Wang, Yong
    Wu, Yiwen
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2019, 18 (03)
  • [10] Ant Colony Optimization for Time-Dependent Travelling Salesman Problem
    Tomanova, Petra
    Holy, Vladimir
    2020 4TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS, METAHEURISTICS & SWARM INTELLIGENCE (ISMSI 2020), 2020, : 47 - 51