2011
DOI: 10.1080/02533839.2011.565574
|View full text |Cite
|
Sign up to set email alerts
|

An ant colony optimization approach for the preference-based shortest path search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0
2

Year Published

2014
2014
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(15 citation statements)
references
References 8 publications
0
10
0
2
Order By: Relevance
“…One of the algorithm-related techniques used to provide an evacuation path to evacuees is the heuristic method [18], which determines the shortest route using the ant colony system (ACS) algorithm. This algorithm involves searching for the numerous possible cases to eliminate any inappropriate paths and leaving only the efficient paths as a means to find the optimum path.…”
Section: Evacuation Path Algorithmmentioning
confidence: 99%
“…One of the algorithm-related techniques used to provide an evacuation path to evacuees is the heuristic method [18], which determines the shortest route using the ant colony system (ACS) algorithm. This algorithm involves searching for the numerous possible cases to eliminate any inappropriate paths and leaving only the efficient paths as a means to find the optimum path.…”
Section: Evacuation Path Algorithmmentioning
confidence: 99%
“…Young, et al, [11] proposed an improved ant colony algorithm for robot path planning. Garro, et al, [12], Seung, et al, [13] and Chen, et al, [16] have proposed a different and improved approach for the mobile robot path planning in preference based technique. In Ant System, it is essentially required to design a path that is dynamically available may be in network or locally.…”
Section: Ant System and Shortest Path: Previous Workmentioning
confidence: 99%
“…The probability of choosing a non-optimal path is equal to the convergence rate. Ok et al (2011) proposed another variable-based short path-selection algorithm based on map link properties. Their findings show that increasing the number of ants reduces the probability of discovering non-preferred paths.…”
Section: Variable-based Acpmentioning
confidence: 99%
“…Ok et al (2011) Path length Although the best values for a set of number of links parameters (e.g., number of ants and iteration) are introduced to improve ACO performance, the algorithm is unsuitable for finding the shortest path based on preference. Nahar and Hashim (2011) Traffic distribution This approach is analogous to proposed algorithm by travel time Ok et al (2011). However this technique does not perform well when the number of agent in the network is less than 100 agents, which leads to high overhead.…”
Section: Referencesmentioning
confidence: 99%
See 1 more Smart Citation