2015
DOI: 10.1016/j.eswa.2015.02.046
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective path finding in stochastic time-dependent road networks using non-dominated sorting genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0
1

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 56 publications
(25 citation statements)
references
References 25 publications
0
23
0
1
Order By: Relevance
“…However, mutation only changes one node and two edges (road segments). Thus, the overall score of the route does not alter dramatically (Rajabi-Bahaabadi, Shariat-Mohaymany, Babaei, & Ahn, 2015).…”
Section: Mutationmentioning
confidence: 99%
“…However, mutation only changes one node and two edges (road segments). Thus, the overall score of the route does not alter dramatically (Rajabi-Bahaabadi, Shariat-Mohaymany, Babaei, & Ahn, 2015).…”
Section: Mutationmentioning
confidence: 99%
“…It can make dynamic path planning, but the shortest path is still influenced by the density of grid [17]. In addition, AC needs grid to compute the matrix of pheromone concentration [18] and GA needs grid to make genetic operation [19]. Both of the methods rely on infinite iterations to approach a theoretical optimum.…”
Section: Introductionmentioning
confidence: 99%
“…NSGA-II with a low computational complexity, effective elite strategy and the unnecessity to specify the sharing radius, has become one of the main methods for the multi-objective genetic algorithm and has been successfully applied to solve a variety of complex engineering optimization problems [26] . In view of this, the NSGA-II algorithm is chosen to optimize the parameters of the boom suspension.…”
Section: The Optimization Algorithm Of Nsga-iimentioning
confidence: 99%