清华大学遗传算法PPT——cn06-basicNetDesign-v100.pptVIP

Soft Computing Lab. 6. Basic Network Design 6. Basic Network Design Genetic Algorithms (GAs) are one of the most powerful and broadly applicable stochastic search and optimization techniques based on principles from evolution theory (Holland, 1976): Michalewicz, Z. : Genetic Algorithm + Data Structure = Evolution Programs, 2nd ed., Springer-Verlag, New York, 1994 Gen, M. R. Cheng: Genetic Algorithms Engineering Design, John Wiley Sons, New York, 1997. Recent advances in evolutionary computation have made it possible to solve such practical network optimization problems: Ali, M. F. Kamoun： “Neural Networks for Shortest Path Computation and Routing in Computer Networks”, IEEE Trans. on Neural Networks, vol.4, pp.941-954, 1993. Perfetti, R. : “Optimization Neural Network for Solving Flow Problems”, IEEE Trans. on Neural Network, Vol.6, No.5, pp.1287-1291, 1995. Gen, M. K. Ida: Neural Networks and Optimization with Mathematica, Kyoritsu Shuppan, 1998 in Japanese. Ahn, C. W., R. Ramakrishna, C. Kang I. Choi: “Shortest Path Routing Algorithm using Hopfield Neural Network”, Electronic Letter, Vol.37, No.19, pp.1176-1178, 2001. 6. Basic Network Design In the past few years, the genetic algorithms community has turned much of its attention toward the optimization of network design problems: Munakata, T. D. J. Hashier: “A genetic algorithm applied to the maximum flow problem”, Proc. of the 5th Inter. Conf. on Genetic Algorithms, San Francisco, pp.488-493, 1993. Gen, M. R. Cheng: Genetic Algorithms and Engineering Design, John Wiley Sons, New York, 1997. Munetomo, M., Y. Takai Y. Sato: “A migration Scheme for the Genetic Adaptive routing Algorithm”, Proc. of IEEE Int. Conf. Systems, Man, and Cybernetics, pp.2774-2779, 1998. Inagaki, J., M. Haseyama H. Kitajima: “A Genetic Algorithm for Determining Multiple Routes and Its Applications”, Proc. of IEEE Int. Symp. Circuits and Systems, pp.137-140, 1999. Gen, M. R. Cheng: Genetic Algorithms and Engineering Optimizati