The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A genetic algorithm for shortest path routing problem and the sizing of populations
Abstract
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for encoding the problem. The crossover operation exchanges partial chromosomes (partial routes) at positionally independent crossing sites and the mutation operation maintains the genetic diversity of the population. The proposed algorithm can cure all the infeasible chromosomes with a simple repair function. Crossover and mutation together provide a search capability that results in improved quality of solution and enhanced rate of convergence. This paper also develops a population-sizing equation that facilitates a solution with desired quality. It is based on the gambler ruin model; the equation has been further enhanced and generalized. The equation relates the size of the population, quality of solution, cardinality of the alphabet, and other parameters of the proposed algorithm. Computer simulations show that the proposed algorithm exhibits a much better quality of solution (route optimality) and a much higher rate of convergence than other algorithms. The results are relatively independent of problem types for almost all source-destination pairs. Furthermore, simulation studies emphasize the usefulness of the population-sizing equation. The equation scales to larger networks. It is felt that it can be used for determining an adequate population size in the SP routing problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
Uniform crossover in genetic algorithms
Syswerda, G. (1989) · international conference on Genetic algorithms · Cited by 1,965
An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems.
Jong, K. A. D. (1975) · Deep Blue (University of Michigan) · doi:10.7302/10966 · Cited by 1,290
Efficient and Accurate Parallel Genetic Algorithms
Cantú‐Paz, E. (2001) · Genetic algorithms and evolutionary computation · doi:10.1007/978-1-4615-4369-5 · Cited by 869
Hedrick, C. L. (1988) · doi:10.17487/rfc1058 · Cited by 765
Genetic algorithms, noise, and the sizing of populations
Goldberg, D. E., Deb, K., & Clark, J. H. (1991) · Cited by 584
Cited by
On the practical genetic algorithms
Ahn, C. W., Oh, S., & Ramakrishna, R. S. (2005) · Proceedings of the 7th annual conference on Genetic and evolutionary computation · doi:10.1145/1068009.1068270 · Cited by 379
Self-citationSelf-organization of nodes in mobile ad hoc networks using evolutionary games and genetic algorithms
Kusyk, J., Sahin, C. S., Umit Uyar, M., Urrea, E., & Gundry, S. (2011) · Journal of Advanced Research · doi:10.1016/j.jare.2011.04.006 · Cited by 45
Metadata
- Authors
- Ahn, C. W., & Ramakrishna, R. S.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2002-12
- Volume
- 6
- Issue
- 6
- Pages
- 566-579
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2117473144
- Cited by
- 683
- References
- 16
- FWCI
- 11.38
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A genetic algorithm for shortest path routing problem and the sizing of populations. https://app.cochat.ai/papers/10.1109/tevc.2002.804323
- The paper
- Ahn, C. W., & Ramakrishna, R. S. (2002). A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2002.804323
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.