Genetic algorithm-based decomposition method for multidisciplinary design optimization

[1] Papalambors P Y. Extending the optimization paradigm in engineering design Fourer R. Third Symposium on Tools and Method of Competitive Engineering. Netherlands: Delft University of Technology Press, 2000: 19-28 [2] 钟毅芳,陈柏鸿,王周宏.多学科综合优化设计原理与方法[M].武汉:华中科技大学出版社,2006:42-50 Zhong Yifang, Chen Bohong, Wang Zhouhong. Theory and application of multidisciplinary integrating optimization[M]. Wuhan: Huazhong University of Science & Technology Press, 2006:42-50(in Chinese) [3] Kusaik A, Chow W S. Efficient solving of the group technology problem[J]. Journal of Manufacturing System, 1987, 6(2):177-123 [4] Kusiak A, Cheng C. A branch-and-bound algorithm for solving group technology problems[J]. Annals of Operational Research, 1990, 26(2): 415-431 [5] 刘勇,康立山,陈毓屏.非数值并行算法——遗传算法[M].北京:科学出版社, 1994:26-32 Liu Yong, Kang Lishan, Chen Yuping. Non-numeric parallel arithmetic-genetic algorithm[M]. Beijing: Scientific Press, 1994: 26-32 (in Chinese) [6] Holland J H. Adaptation in natural and artificial systems[M]. Ann Arbor: University of Michigan Press, 1975: 56-68 [7] Goldberg D E. Genetic algorithms in search, optimization and machine learning[J]. MA: Addison-Wesley, 1989, 28(3):172-174 [8] Sutton R S, Butto A G. Reinforcement learning: introduction[M]. Cambridge: MIT Press, 1998:77-89 [9] 邢文训,谢金星.现代优化计算方法[M].北京:清华大学出版社, 2005: 113-147 Xing Wenxun, Xie Jinxing. Modern optimization algorithm[M]. Beijing: Tsinghua University Press, 2005: 113-147(in Chinese)