The DOI matches its Crossref record; 1 of the 1 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.
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
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
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-citationA 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
- 1
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An orthogonal genetic algorithm for multimedia multicast routing. https://app.cochat.ai/papers/10.1109/4235.752920
- The paper
- Zhang, Q., & Leung, Y.-W. (1999). An orthogonal genetic algorithm for multimedia multicast routing. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/4235.752920
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.