High Performance Ant Colony Optimizer (HPACO) for Travelling Salesman Problem (TSP)

被引：0
|
作者：
Sahana, Sudip Kumar [1 ]
Jain, Aruna [1 ]
机构：
[1] Birla Inst Technol, Dept CSE, Ranchi, Jharkhand, India
来源：
ADVANCES IN SWARM INTELLIGENCE, PT1 | 2014年 / 8794卷
关键词：
Travelling Salesman Problem (TSP); Ant Colony Optimization (ACO); Combinatorial Optimization (CO); Pheromone; Meta-heuristics; ALGORITHM;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Travelling Salesman Problem (TSP) is a classical combinatorial optimization problem. This problem is NP-hard in nature and is well suited for evaluation of unconventional algorithmic approaches based on natural computation. Ant Colony Optimization (ACO) technique is one of the popular unconventional optimization technique to solve this problem. In this paper, we propose High Performance Ant Colony Optimizer (HPACO) which modifies conventional ACO. The result of implementation shows that our proposed technique has a better performance than the conventional ACO.
引用
收藏
页码：165 / 172
页数：8
相关论文
共 50 条
  • [21] The optimisation of travelling salesman problem based on parallel ant colony algorithm
    Jarrah, Amin
    Al Bataineh, Ali S.
    Almomany, Abedalmuhdi
    INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, 2022, 69 (04) : 309 - 321
  • [22] An improved ant colony optimization (I-ACO) method for the quasi travelling salesman problem (Quasi-TSP)
    Yang, Jianyi
    Ding, Ruifeng
    Zhang, Yuan
    Cong, Maoqin
    Wang, Fei
    Tang, Guoan
    INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2015, 29 (09) : 1534 - 1551
  • [23] Ant colonies for the travelling salesman problem
    Dorigo, M
    Gambardella, LM
    BIOSYSTEMS, 1997, 43 (02) : 73 - 81
  • [24] An Ant Colony Optimization Based Memetic Algorithm for the Dynamic Travelling Salesman Problem
    Mavrovouniotis, Michalis
    Mueller, Felipe Martins
    Yang, Shengxiang
    GECCO'15: PROCEEDINGS OF THE 2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2015, : 49 - 56
  • [25] A modified ant colony system for solving the travelling salesman problem with time windows
    Cheng, Chi-Bin
    Mao, Chun-Pin
    MATHEMATICAL AND COMPUTER MODELLING, 2007, 46 (9-10) : 1225 - 1235
  • [26] Adaptive Ant Colony Optimization with node clustering applied to the Travelling Salesman Problem
    Stodola, Petr
    Otrisal, Pavel
    Hasilova, Kamila
    SWARM AND EVOLUTIONARY COMPUTATION, 2022, 70
  • [27] Improved Dynamic Ant Colony System (DACS) on symmetric Traveling Salesman Problem (TSP)
    Rais, Helmi Md
    Othman, Zulaiha Ali
    Hamdan, Abdul Razak
    ICIAS 2007: INTERNATIONAL CONFERENCE ON INTELLIGENT & ADVANCED SYSTEMS, VOLS 1-3, PROCEEDINGS, 2007, : 43 - 48
  • [28] A Travelling Salesman Problem (TSP) with Multiple Job Facilties
    Shila Das
    Nazimuddin Ahmed
    OPSEARCH, 2001, 38 (4) : 394 - 406
  • [29] Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors
    Mavrovouniotis, Michalis
    Yang, Shengxiang
    APPLIED SOFT COMPUTING, 2013, 13 (10) : 4023 - 4037
  • [30] Efficiency Analysis of Genetic Algorithm and Ant Colony Optimization Techniques for Travelling Salesman Problem
    Binod, Bajracharya
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INTELLIGENT COMMUNICATION, 2015, 16 : 263 - 266
12345