The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
An orthogonal genetic algorithm for multimedia multicast routing
Abstract
Many multimedia communication applications require a source to send multimedia information to multiple destinations through a communication network. To support these applications, it is necessary to determine a multicast tree of minimal cost to connect the source node to the destination nodes subject to delay constraints on multimedia communication. This problem is known as multimedia multicast routing and has been proved to be NP-complete. The paper proposes an orthogonal genetic algorithm for multimedia multicast routing. Its salient feature is to incorporate an experimental design method called orthogonal design into the crossover operation. As a result, it can search the solution space in a statistically sound manner and it is well suited for parallel implementation and execution. We execute the orthogonal genetic algorithm to solve two sets of benchmark test problems. The results indicate that for practical problem sizes, the orthogonal genetic algorithm can find near optimal solutions within moderate numbers of generations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
(1979) · Cited by 43,841
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Design and Analysis of Experiments
Srinivasan, S. (1992) · Technometrics · doi:10.1080/00401706.1992.10484919 · Cited by 2,747
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1994) · Springer eBooks · doi:10.1007/978-3-662-07418-3 · Cited by 2,158
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
Hwang, F. K., Richards, D., & Winter, P. (1992) · Cited by 855
Number-theoretic Methods in Statistics
Fang, K.-T., & Wang, Y. (1994) · Springer eBooks · doi:10.1007/978-1-4899-3095-8 · Cited by 638
Number-Theoretic Methods in Statistics.
Ripley, B. D., Fang, K.-T., & Wang, Y. (1995) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983421 · Cited by 621
Design and Analysis of Experiments, 3rd Ed.
Nelson, P. R. (1991) · Journal of Quality Technology · doi:10.1080/00224065.1991.11979363 · Cited by 569
An introduction to genetic algorithms
Loses, R. M. (1997) · Information Processing & Management · doi:10.1016/s0306-4573(97)88274-x · Cited by 513
A dual algorithm for the constrained shortest path problem
Handler, G. Y., & Zang, I. (1980) · Networks · doi:10.1002/net.3230100403 · Cited by 457
Genetic algorithms with multi-parent recombination
Eiben, A. E., Raué, P. E., & Ruttkay, Z. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58484-6_252 · Cited by 391
Parallel recombinative simulated annealing: A genetic algorithm
Mahfoud, S. W., & Goldberg, D. E. (1995) · Parallel Computing · doi:10.1016/0167-8191(94)00071-h · Cited by 320
Metascheduling for continuous media
Anderson, D. P. (1993) · ACM Transactions on Computer Systems · doi:10.1145/152864.152866 · Cited by 129
Orgy in the computer: Multi-parent reproduction in genetic algorithms
Eiben, A. E., van Kemenade, C. H. M., & Kok, J. N. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59496-5_354 · Cited by 95
Cited by
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
Self-citationRM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm
Zhang, Q., Zhou, A., & Jin, Y. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.894202 · Cited by 827
Self-citationOrthogonal Learning Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Shi, Y.-H. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2052054 · Cited by 725
A genetic algorithm for shortest path routing problem and the sizing of populations
Ahn, C. W., & Ramakrishna, R. S. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.804323 · Cited by 683
A Novel Artificial Bee Colony Algorithm Based on Modified Search Equation and Orthogonal Learning
Gao, W.-F., Liu, S.-Y., & Huang, L.-L. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2222373 · Cited by 397
Metadata
- Authors
- Zhang, Q., & Leung, Y.-W.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 1999-04
- Volume
- 3
- Issue
- 1
- Pages
- 53-62
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2166135752
- Cited by
- 269
- References
- 18
- FWCI
- 5.70
- 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
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.