The Coupled EigenAnt algorithm for shortest path problems

被引：0

作者：

Kaszkurewicz, Eugenius ^{[1
]}

Bhaya, Amit ^{[1
]}

Jayadeva

Meirelles da Silva, Joao Marcos ^{[1
,2
]}

机构：

[1] Indian Inst Technol, Dept Elect Engn, Delhi, India

[2] Univ Fed Fluminense, Dept Telecommun Engn, BR-24220000 Niteroi, RJ, Brazil

来源：

2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) | 2014年

关键词：

ANT COLONY OPTIMIZATION;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper introduces an ACO model and associated algorithm, called Coupled EigenAnt, for the problem of finding the shortest of N paths between a source and a destination node. It is based on the recently introduced EigenAnt algorithm, the novelty being that it allows probabilistic path choice on both the forward and return journeys, as well as the fact that it introduces decay of pheromone deposition following a geometric progression. Equilibrium points of the model are calculated and the local stability of the two path synchronous version analyzed. Simulations illustrate the main features of the algorithm.

引用

页码：1729 / 1735

页数：7

共 50 条

[41] Robot path planning using fusion algorithm of ant colony optimization and genetic algorithm [J].

Ma, Kangkang ;

Wang, Lei ;

Cai, Jingcao ;

Li, Dongdong ;

Wang, Anheng ;

Tan, Tielong .

INTERNATIONAL JOURNAL OF MODELING SIMULATION AND SCIENTIFIC COMPUTING, 2023, 14 (06)

[42] A comparative study on Ant Colony Optimization algorithm approaches for solving multi-objective path planning problems in case of unmanned surface vehicles [J].

Ntakolia, Charis ;

Lyridis, Dimitrios, V .

OCEAN ENGINEERING, 2022, 255

[43] A comparative study on Ant Colony Optimization algorithm approaches for solving multi-objective path planning problems in case of unmanned surface vehicles [J].

Ntakolia, Charis ;

Lyridis, Dimitrios, V .

OCEAN ENGINEERING, 2022, 255

[44] DESIGN OF EXPERIMENT FOR TUNING PARAMETERS OF AN ANT COLONY OPTIMIZATION METHOD FOR THE CONSTRAINED SHORTEST HAMILTONIAN PATH PROBLEM IN THE GRID NETWORKS [J].

Abdolhosseinzadeh, Mohsen ;

Alipour, Mir Mohammad .

NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2021, 11 (02) :321-332

[45] The Ant Search Algorithm: An Ant Colony Optimization Algorithm for the Optimal Searcher Path Problem with Visibility [J].

Morin, Michael ;

Lamontagne, Luc ;

Abi-Zeid, Irene ;

Maupin, Patrick .

ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2010, 6085 :196-+

[46] Hybrid routing algorithm for improving path selection in sustainable network [J].

Jayanthi, N. ;

Valluvan, K. R. .

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 1) :323-334

[47] Optimal path planning for drones based on swarm intelligence algorithm [J].

Rashid A. Saeed ;

Mohamed Omri ;

S. Abdel-Khalek ;

Elmustafa Sayed Ali ;

Maged Faihan Alotaibi .

Neural Computing and Applications, 2022, 34 :10133-10155

[48] An investigation of parameters in ant colony optimization for a path optimization algorithm [J].

Gholami, Farnood ;

Mahjoob, M. J. .

2007 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION, VOLS I-V, CONFERENCE PROCEEDINGS, 2007, :463-+

[49] An Improved Swarm Optimization Algorithm For Vehicle Path Planning Problem [J].

Mouhcine, Elgarej ;

Mansouri, Khalifa ;

Mohamed, Youssfi .

2016 4TH IEEE INTERNATIONAL COLLOQUIUM ON INFORMATION SCIENCE AND TECHNOLOGY (CIST), 2016, :707-712

[50] Toward Optimization of AGV Path Planning: An RRT* -ACO Algorithm [J].

Wang, Wenjuan ;

Li, Jiaye ;

Bai, Zongning ;

Wei, Zhonghua ;

Peng, Jingxuan .

IEEE ACCESS, 2024, 12 :18387-18399

← 1 2 3 4 5 →