Comparative Analysis of Two Different Ant Colony Algorithm for Model of TSP

被引：0

作者：

Joshi, Sourabh ^{[1
]}

Kaur, Sarabjit ^{[1
]}

机构：

[1] CT Inst Technol & Res, Dept Comp Sci Engn, Jalandhar, India

来源：

2015 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER ENGINEERING AND APPLICATIONS (ICACEA) | 2015年

关键词：

Ant Colony Optimization; Ant System; Max-Min Ant System; Travelling Salesman Problem;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Travelling Salesman Problem is well - known and extensively studied problem which plays an important role in combinatorial optimization and in context of ACO. Ant Colony Optimization is heuristic Algorithm which was initially applied on TSP and is an advance technique applied on various other optimization problems. In the research we study two different kinds of Ant Colony algorithms named as Ant System and the improved version of Ant system known as Max-Min Ant System performed in MATLAB to solve travelling Salesman Problem and their respective results are shown by using graphical implementation. In this paper both systems are analyzed by solving the same example of TSP and depict which system solve the problem efficiently with respect to cost and time.

引用

页码：669 / 671

页数：3

共 50 条

[41] Optimization of the Ebola Medicine Delivery System Based on TSP and Ant Colony Algorithm
Xing, Jiani
2015 4th International Conference on Social Sciences and Society (ICSSS 2015), Pt 3, 2015, 72 : 397 - 401
[42] Application research for TSP based on neural network-ant colony algorithm
Department of Computer Science and Technology, Nanchang University, Nanchang 330031, China
Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao, 2007, 5 (600-603):
[43] An improvement of the ant colony optimization algorithm for solving Travelling Salesman Problem (TSP)
Li, Tiankun
Chen, Wanzhong
Zheng, Xin
Zhang, Zhuo
2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 3931 - 3933
[44] Hybrid Ant Colony Algorithm Using Improved Circle Strategy for TSP Problem
Li, Qingshun
Dong, Xueshi
Guo, Qingteng
INTERNATIONAL JOURNAL OF SWARM INTELLIGENCE RESEARCH, 2022, 13 (01)
[45] Reactive Memory Model for Ant Colony Optimization and Its Application to TSP
Sagban, Rafid
Mahamud, Ku Ruhana Ku
Abu Bakar, Muhamad Shahbani
2014 IEEE INTERNATIONAL CONFERENCE ON CONTROL SYSTEM COMPUTING AND ENGINEERING, 2014, : 310 - 315
[46] Convergence Analysis for Ant Colony Algorithm
Zhao, Baojiang
2015 8TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL 1, 2015, : 362 - 365
[47] Comparative Analysis of Determinant Elimination Method, Ant Colony Algorithms and Genetic Algorithm
Xin, Fu
ADVANCED DEVELOPMENT IN AUTOMATION, MATERIALS AND MANUFACTURING, 2014, 624 : 509 - 511
[48] Analysis of the efficacy of a Two-Stage methodology for ant colony optimization: Case of study with TSP and QAP
Puris, Amilkar
Bello, Rafael
Herrera, Francisco
EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (07) : 5443 - 5453
[49] Ant Colony System with a Restart Procedure for TSP
Skinderowicz, Rafal
COMPUTATIONAL COLLECTIVE INTELLIGENCE, ICCCI 2016, PT II, 2016, 9876 : 91 - 101
[50] A RESEARCH ON ANT COLONY ALGORITHMS TO SOLVE TSP
Wu Honghua
Chen Jun
Wu Guifang
Tu Qinglong
3RD INTERNATIONAL SYMPOSIUM ON INFORMATION ENGINEERING AND ELECTRONIC COMMERCE (IEEC 2011), PROCEEDINGS, 2011, : 247 - 250

← 1 2 3 4 5 →