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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zhang Q, Leung YW (1999) An orthogonal genetic algorithm for multimedia multicast routing. IEEE Trans. Evol. Comput., vol. 3, no. 1, pp. 53–62.
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.
Leung YW (1999) Interactive multiobjective programming using uniform design. FRG Research Grant Proposal, Hong Kong Baptist University.
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.
Goldberg DE (1989) Genetic Algorithm in Search, Optimization and Machine Learning, Addison Wesley, Reading, MA.
Back T, Fogel DB, Michalewicz Z (ed.) (1997) Handbook of Evolutionary Computation, Institute of Physics Publishing.
Gen M, Cheng R (1999) Genetic Algorithms and Engineering Optimization, Wiley.
Montgomery DC (1991) Design and Analysis of Experiments, 3rd ed., John Wiley, NY.
Hicks CR (1993) Fundamental Concepts in the Design of Experiments, 4th ed., Saunders College Publishing, Texas.
Wu Q (1978) On the optimality of orthogonal experimental design. Acta Mathematical Applacatae Sinica, vol. 1, no. 4, pp. 283–299.
Math. Stat. Research Group in Chinese Academy of Science (1975) Orthogonal Design (in Chinese), People Education Pub., Beijing.
Leung YW, Yum TS (1996) Connection optimization for two types of videoconferences. IEEE Proc. Commun., vol. 143, no. 3, pp. 133–140.
Yum TS, Chen MS, Leung YW (1995) Video bandwidth allocation for multimedia teleconferences. IEEE Trans. Commun., vol. 43, no. 2, pp. 457–465.
IEICE Trans. Info. Syst. (1997) Special Issue on Educational System Using Multimedia and Communication Technology, vol. E80-D, no. 2.
Fonseca NLSD, Facanha RA (2002) The look-ahead-maximize-batch batching policy. IEEE Trans. Multimedia, vol. 4, no. 1, pp. 114–120.
Kompella VP, Pasquale JC, Polyzos GC (1993) Multicast routing for multimedia communication. IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 286–292.
Zhu Q, Parsa M, Aceves JJGL (1995) A source-based algorithm for delayconstrained minimum-cost multicasting. Proc. IEEE INFOCOM, pp. 377–385.
Halsall F (2001) Multimedia Communications, Addison Wesley.
Papadimitriou CH, Steiglitz K (1982) Combinatorial Optimization: Algorithms and Complexity, Prentice Hall.
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.
Ramaswami R, Sivarajan KN (1995) Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Network., vol. 3, no. 5, pp. 489–500.
Lee KC, Li VOK (1993) A wavelength-convertible optical networks. IEEE J. Light. Tech., vol. 11, no. 5, pp. 962–970.
Author information
Authors and Affiliations
Rights 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