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 条

[21] An Intelligent Evolutionary Computation Approach for Solving the Shortest Path Problem
Moradi, Behzad
JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING, 2018, 30 (4-6) : 335 - 357
[22] SIIoT: A Shortest Path Estimation and Obstacle Avoidance System For Autonomous Cars
Chakraborty, Tanmay
Datta, Soumya Kanti
2018 GLOBAL INTERNET OF THINGS SUMMIT (GIOTS), 2018, : 349 - 354
[23] PATH VS. DESTINATION: A CASE STUDY OF BLIND NOISE ASSESSMENT USING MODIFIED ANT SHORTEST PATH
Huang, Xiaotong
Chen, Li
Tian, Jing
2015 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2015, : 4170 - 4174
[24] Parallelization of the Ant Colony Optimization for the Shortest Path Problem using OpenMP and CUDA
Arnautovic, Maida
Curic, Maida
Dolamic, Emina
Nosovic, Novica
2013 36TH INTERNATIONAL CONVENTION ON INFORMATION AND COMMUNICATION TECHNOLOGY, ELECTRONICS AND MICROELECTRONICS (MIPRO), 2013, : 1273 - 1277
[25] GRACE: A Generational Randomized ACO for the Multi-objective Shortest Path Problem
Bezerra, Leonardo C. T.
Goldbarg, Elizabeth F. G.
Buriol, Luciana. S.
Goldbarg, Marco C.
EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, 2011, 6576 : 535 - +
[26] Ant colony optimization for the shortest path of urban road network based on cloud computing
Yang, Qing-Fang
Mei, Duo
Han, Zhen-Bo
Zhang, Biao
Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2013, 43 (05): : 1210 - 1214
[27] Analyzing the impact of MOACO components: An algorithmic study on the multi-objective shortest path problem
Bezerra, Leonardo C. T.
Goldbarg, Elizabeth F. G.
Goldbarg, Marco C.
Buriol, Luciana S.
EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (01) : 345 - 355
[28] A Composite Metric Routing Approach for Energy-Efficient Shortest Path Planning on Natural Terrains
Saad, Mohamed
Salameh, Ahmed, I
Abdallah, Saeed
El-Moursy, Ali
Cheng, Chi-Tsun
APPLIED SCIENCES-BASEL, 2021, 11 (15):
[29] Study of β,ρ and Q0 parameters for Shortest Path Estimation using Ant Colony Optimization
Chakraborty, Tanmay
Chakrabarti, Sagnik
Hazra, Bikramjit
PROCEEDINGS OF 2019 IEEE REGION 10 SYMPOSIUM (TENSYMP), 2019, : 813 - 818
[30] How to Design Experiments in Animal Behaviour 3. How Do Ants Find the Shortest Path?
Gadagkar, Raghavendra
RESONANCE-JOURNAL OF SCIENCE EDUCATION, 2018, 23 (11): : 1243 - 1257

← 1 2 3 4 5 →