Skip to main content

Orthogonal Genetic Algorithms with Application to Multimedia Multicast Routing

  • Chapter
Soft Computing in Communications

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 136))

  • 177 Accesses

Abstract

Some major steps of a genetic algorithm can be considered to be “experiments”. For example, a crossover operator samples the genes from the parents to produce some potential offspring, and this operation can be considered to be a sampling experiment. Based on this observation, we recently propose to integrate experimental design methods into the genetic algorithms [1–4], so that the resulting algorithms can be more powerful and statistically sound. In this chapter, we summarize our recent results on this research direction [1,2]. In particular, we introduce the basic concept of experimental design methods and describe a well-known experimental design method called orthogonal design. Then we describe how to apply the orthogonal design to design a new type of genetic algorithms called orthogonal genetic algorithms. In additionally, we describe an orthogonal genetic algorithm for an optimization problem in communication networks called multimedia multicast routing. We present numerical results to demonstrate the effectiveness of orthogonal genetic algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zhang Q, Leung YW (1999) An orthogonal genetic algorithm for multimedia multicast routing. IEEE Trans. Evol. Comput., vol. 3, no. 1, pp. 53–62.

    Article  Google Scholar 

  2. Leung YW, Wang Y (2001) An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans. Evol. Comput., vol. 5, no. 1, pp. 41–53.

    Article  Google Scholar 

  3. Leung YW (1999) Interactive multiobjective programming using uniform design. FRG Research Grant Proposal, Hong Kong Baptist University.

    Google Scholar 

  4. Leung YW, Wang Y (2000) Multiobjective porgramming using uniform desgin and genetic algorithm. IEEE Trans. Syst. Man Cyber. Part C, vol. 30, no. 3, pp. 293–304.

    Article  Google Scholar 

  5. Goldberg DE (1989) Genetic Algorithm in Search, Optimization and Machine Learning, Addison Wesley, Reading, MA.

    Google Scholar 

  6. Back T, Fogel DB, Michalewicz Z (ed.) (1997) Handbook of Evolutionary Computation, Institute of Physics Publishing.

    Google Scholar 

  7. Gen M, Cheng R (1999) Genetic Algorithms and Engineering Optimization, Wiley.

    Book  Google Scholar 

  8. Montgomery DC (1991) Design and Analysis of Experiments, 3rd ed., John Wiley, NY.

    MATH  Google Scholar 

  9. Hicks CR (1993) Fundamental Concepts in the Design of Experiments, 4th ed., Saunders College Publishing, Texas.

    MATH  Google Scholar 

  10. Wu Q (1978) On the optimality of orthogonal experimental design. Acta Mathematical Applacatae Sinica, vol. 1, no. 4, pp. 283–299.

    Google Scholar 

  11. Math. Stat. Research Group in Chinese Academy of Science (1975) Orthogonal Design (in Chinese), People Education Pub., Beijing.

    Google Scholar 

  12. Leung YW, Yum TS (1996) Connection optimization for two types of videoconferences. IEEE Proc. Commun., vol. 143, no. 3, pp. 133–140.

    Article  Google Scholar 

  13. Yum TS, Chen MS, Leung YW (1995) Video bandwidth allocation for multimedia teleconferences. IEEE Trans. Commun., vol. 43, no. 2, pp. 457–465.

    Article  Google Scholar 

  14. IEICE Trans. Info. Syst. (1997) Special Issue on Educational System Using Multimedia and Communication Technology, vol. E80-D, no. 2.

    Google Scholar 

  15. Fonseca NLSD, Facanha RA (2002) The look-ahead-maximize-batch batching policy. IEEE Trans. Multimedia, vol. 4, no. 1, pp. 114–120.

    Article  Google Scholar 

  16. Kompella VP, Pasquale JC, Polyzos GC (1993) Multicast routing for multimedia communication. IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 286–292.

    Article  Google Scholar 

  17. Zhu Q, Parsa M, Aceves JJGL (1995) A source-based algorithm for delayconstrained minimum-cost multicasting. Proc. IEEE INFOCOM, pp. 377–385.

    Google Scholar 

  18. Halsall F (2001) Multimedia Communications, Addison Wesley.

    Google Scholar 

  19. Papadimitriou CH, Steiglitz K (1982) Combinatorial Optimization: Algorithms and Complexity, Prentice Hall.

    MATH  Google Scholar 

  20. Khoury BN, Pardalos PM, Du DZ (1993) A test problem generator for the Steiner problem in graphs. ACM Trans. Math. Soft., vol. 19, no. 4, pp. 509–522.

    Article  MATH  Google Scholar 

  21. Ramaswami R, Sivarajan KN (1995) Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Network., vol. 3, no. 5, pp. 489–500.

    Article  Google Scholar 

  22. Lee KC, Li VOK (1993) A wavelength-convertible optical networks. IEEE J. Light. Tech., vol. 11, no. 5, pp. 962–970.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Leung, YW. (2004). Orthogonal Genetic Algorithms with Application to Multimedia Multicast Routing. In: Soft Computing in Communications. Studies in Fuzziness and Soft Computing, vol 136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45090-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45090-0_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53623-6

  • Online ISBN: 978-3-540-45090-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics