A genetic algorithm for shortest path routing problem and the sizing of populations
By Chang Wook Ahn, Rudrapatna S. Ramakrishna. IEEE Transactions on Evolutionary Computation, 2002
783 citations recorded by the source corpus.
Subfields: Building and Construction, Electrical and Electronic Engineering, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/cb69b52b4e38c41d962d79e1f2b8db980b84ea11
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Building and Construction
In Electrical and Electronic Engineering
In Industrial and Manufacturing Engineering
Citations in the corpus
- Indonesian Operations Research Association – International Conference on Operations Research 2017 (2018, positive): “For the test problems, we modified the SPP test problems given [19], [2] and [20].”
- Elitism-based compact genetic algorithms (2003, methodology): “In the interest of fair comparison of the algorithms on the basis of optimality and convergence performance, we investigate the number of correct BBs (solution quality) obtained by each population size that performs the same number of function evaluations [ 7 ], [26].”
- On the practical genetic algorithms (2005, methodology): “From the initial BB supply, practical decision model, and the gambler’s ruin process, a practical population-sizing model can be obtained as [1] Here, n and α are the length of individuals and the probability of GA failure.”