A Novel Max-Min Ant System Algorithm for Traveling Salesman Problem

被引：5

作者：

Zhang, Zhaojun ^{[1
]}

Feng, Zuren ^{[1
]}

机构：

[1] Xi An Jiao Tong Univ, Syst Engn Inst, State Key Lab Mfg Syst Engn, Xian 710049, Shaanxi, Peoples R China

来源：

2009 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND INTELLIGENT SYSTEMS, PROCEEDINGS, VOL 1 | 2009年

关键词：

ant colony optimization; Max-Min ant system; pheromone; traveling salesman problem; COLONY OPTIMIZATION; SCHEDULING PROBLEM;

D O I：

10.1109/ICICISYS.2009.5357792

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A novel Max-Min ant system algorithm is proposed for the problem of setting pheromone trail value which is caused by uncertainty of the objective function value The upper and lower bounds of pheromone are determined according to the range of objective function value by a random sampling And the update quantity of pheromone is determined As result of this process is not using the objective function value, so they are independent of it Then, pheromone is updated by two phases to keep an appropriate balance of the exploration and the exploitation In the early phase of algorithm, the first / iterative optimal solutions are employed to enhance exploration capability Then, in the later phase of algorithm, iteration-best optimal solution is used to update pheromone tail to accelerate the convergence rate An example of traveling salesman problem is given, which is simulated by proposed algorithm, Max-Min ant system, and other improved ant algorithms Simulation results show the effectiveness of the proposed algorithm

引用

页码：508 / 511

页数：4

共 50 条

[21] Max-Min Ant System to solve the Software Project Scheduling Problem
Crawford, Broderick
Soto, Ricardo
Johnson, Franklin
Paredes, Fernando
Olivares Suarez, Miguel
PROCEEDINGS OF THE 2014 9TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI 2014), 2014,
[22] Multivalent Graph Matching Problem Solved by Max-Min Ant System
Ho, Kieu Diem
Ramel, Jean Yves
Monmarche, Nicolas
STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, S+SSPR 2020, 2021, 12644 : 227 - 237
[23] The Undirected Rural Postman Problem Solved by the MAX-MIN Ant System
Luisa Perez-Delgado, Maria
7TH INTERNATIONAL CONFERENCE ON PRACTICAL APPLICATIONS OF AGENTS AND MULTI-AGENT SYSTEMS (PAAMS 2009), 2009, 55 : 179 - 187
[24] On MAX-MIN ant system's parameters
Pellegrini, Paola
Favaretto, Daniela
Moretti, Elena
ANT COLONY OPTIMIZATION AND SWARM INTELLIGENCE, PROCEEDINGS, 2006, 4150 : 203 - 214
[25] Exploratory Path Planning Using the Max-Min Ant System Algorithm
Santos, Valeria de C.
Osorio, Fernando S.
Toledo, Claudio F. M.
Otero, Fernando E. B.
Johnson, Colin G.
2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 4229 - 4235
[26] On the Explorative Behavior of MAX-MIN Ant System
Favaretto, Daniela
Moretti, Elena
Pellegrini, Paola
ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2009, 5752 : 115 - 119
[27] MAX-MIN Ant System in Image Preprocessing
Laptik, R.
Navakauskas, D.
ELEKTRONIKA IR ELEKTROTECHNIKA, 2009, (01) : 21 - 24
[28] Analysis of Max-Min Ant System with Local Search Applied to the Asymmetric and Dynamic Travelling Salesman Problem with Moving Vehicle
Schmitt, Joao P.
Parpinelli, Rafael S.
Baldo, Fabiano
ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, 2019, 11544 : 202 - 218
[29] Convergence analysis of a Max-Min ant colony algorithm
Wang, Honghao
Liu, Qing
DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2006, 13E : 3901 - 3904
[30] Pareto max-min ant system algorithm and its application to hot rolling batch planning problem
Jia, Shu-Jin
Zhu, Jun
Du, Bin
Yue, Heng
Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2012, 29 (02): : 137 - 144

← 1 2 3 4 5 →