Name
Title | ||
|---|---|---|
A modified ant colony system for finding the expected shortest path in networks with variable arc lengths and probabilistic nodes. |
Abstract | ||
|---|---|---|
•The problem of finding the expected shortest path in stochastic networks has numerous applications.•A new local heuristic is formulated for the proposed algorithm to consider the probabilistic nodes.•The arc lengths are randomly generated based on the arc length distribution functions. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.asoc.2014.03.020 | Applied Soft Computing |
Keywords | Field | DocType |
Ant colony system (ACS),Stochastic networks,Expected shortest path,Probabilistic nodes,Random arc lengths | Ant colony optimization algorithms,Random variable,Heuristic,Mathematical optimization,Shortest path problem,Artificial intelligence,Probabilistic logic,Ant colony,Machine learning,Mathematics,Metaheuristic,K shortest path routing | Journal |
Volume | ISSN | Citations |
21 | 1568-4946 | 2 |
PageRank | References | Authors |
0.44 | 19 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mojtaba Farhanchi | 1 | 2 | 0.44 |
| Reza Hassanzadeh | 2 | 76 | 6.02 |
| Iraj Mahdavi | 3 | 388 | 32.30 |
| Nezam Mahdavi-amiri | 4 | 371 | 39.95 |