[1] 马永杰,云文霞.遗传算法研究进展[J].计算机应用研究,2012,29(4):1201-1206.(MA Y J, YUN W X. Research progress of genetic algorithm[J]. Application Research of Computers, 2012, 29(4):1201-1206.) [2] AGGARWAL S, GARG R, GOSWAMI P. A review paper on different encoding schemes used in genetic algorithms[J]. International Journal on Advanced Research in Computer Science and Software Engineering, 2014, 4(1):596-600. [3] 张超群,郑建国,钱洁.遗传算法编码方案比较[J].计算机应用研究,2011,28(3):819-822.(ZHANG C Q, ZHENG J G, QIAN J. Comparison of coding schemes for genetic algorithms[J]. Application Research of Computers, 2011, 28(3):819-822.) [4] HOLLAND J H. Genetic algorithms and the optimal allocation of trials[J]. SIAM Journal on Computing, 1973, 2(2):88-105. [5] MICHALEWICZ Z, JANIKOW C Z, KRAWCZYK J B. A modified genetic algorithm for optimal control problems[J]. Computers & Mathematics with Applications, 1992, 23(12):83-94. [6] 马德良,陆昌辉,王小乐.基于改进遗传算法的智能组卷方法[J].计算机应用,2009,29(7):1884-1886.(MA D L, LU C H, WANG X L. Intelligent test paper generation based on improved genetic algorithm[J]. Journal of Computer Applications, 2009, 29(7):1884-1886.) [7] 张理洪,谢长生,张玉萍,等.基于位矩阵编码实现模拟集成电路模块布局的遗传算法[J].计算机学报,2003,26(9):1157-1164.(ZHANG L H, XIE C S, ZHANG Y P, et al. A bit-matrix genetic approach to analog module placement[J]. Chinese Journal of Computers, 2003, 26(9):1157-1164.) [8] 蔡美玲,陈荣平,陈明.基于树型编码遗传算法的Web服务组合[J].计算机应用与软件,2008,25(11):60-62.(CAI M L, CHEN R P, CHEN M. Web service composition based on tree-coding genetic algorithm[J]. Application Research of Computers, 2008, 25(11):60-62.) [9] 章文俊,程浩忠,王一,等.基于树形结构编码单亲遗传算法的配电网优化规划[J].电工技术学报,2009,24(5):154-160.(ZHANG W J, CHENG H Z, WANG Y, et al. Distribution network optimal planning based on tree structure encoding partheno-genetic algorithm[J]. Transactions of China Electrotechnical Society, 2009, 24(5):154-160.) [10] 梁昌勇,柏桦,蔡美菊,等.量子遗传算法研究进展[J].计算机应用研究,2012,29(7):2401-2405.(LIANG C Y, BAI H, CAI M J, et al. Advances in quantum genetic algorithm[J]. Application Research of Computers, 2012, 29(7):2401-2405.) [11] GOLDBERG D E, HOLLAND J H. Genetic algorithms and machine learning[J]. Machine Learning, 1988, 3(2):95-99. [12] MICHALEWICZ Z. Genetic Algorithm+Data Structures=Evolution Programs[M]. 3rd ed. Berlin:Springer, 1996:31-62. [13] ANTONISSE H J, RAWLINS G J E. A grammar-based genetic algorithm[M]//Foundations of Genetic Algorithms. San Francisco, CA:Morgan Kaufmann, 1990:193-204. [14] CHELLAPILLA K, FOGEL D B. Fitness distributions in evolutionary computation:motivation and examples in the continuous domain[J]. BioSystems, 1999, 54(1/2):15-29. [15] FOGEL D, GHOZEIL A. A note on representations and variation operators[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(2):159-161. [16] CHAKRABORTY U K, JANIKOW C Z. An analysis of gray versus binary encoding in genetic search[J]. Information Sciences, 2003, 156(3/4):253-269. [17] WOLPERT D, MACREADY W. No free lunch theorems for optimization[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1):67-82. [18] IGEL C. No free lunch theorems:limitations and perspectives of metaheuristics[M]//Theory and Principled Methods for the Design of Metaheuristics. Berlin:Springer, 2014:1-23. [19] ALABERT A, BERTI A, CABALLERO R, et al. No-free-lunch theorems in the continuum[J]. Theoretical Computer Science, 2015, 600:98-106. [20] MO H, LI Z, TIAN L, et al. Selection of encoding cardinality for a class of fitness functions to obtain order-1 building blocks[J]. International Journal of Computational Intelligence Systems, 2015, 8(1):62-74. [21] MO H, LI Z, PARK J B, et al. On the supply of superior order-1 building blocks for a class of periodical fitness functions[J]. International Journal of Computational Intelligence Systems, 2009, 2(1):91-98. [22] WHITLEY D. An overview of evolutionary algorithms:practical is-sues and common pitfalls[J]. Information and Software Technology, 2001, 43(14):817-831. [23] GOLDBERG D E. The Design of Innovation:Lessons from and for Competent Genetic Algorithms[M]. Rotterdam:Springer Science & Business Media, 2013:59-93. [24] LU G. Characterising fitness landscapes with fitness-probability cloud and its applications to algorithm configuration[D]. Birmingham:University of Birmingham, 2014:133-149. [25] PAPADIMITRIOU C H, STEIGLITZ K. Combinatorial Optimization:Algorithms and Complexity[M]. Massachusetts:Courier Corporation, 2013:156-182. [26] MERZ P. Advanced fitness landscape analysis and the performance of memetic algorithms[J]. Evolutionary Computation, 2004, 12(3):303-325. [27] LU G, LI J, YAO X. Fitness landscapes and problem difficulty in evolutionary algorithms:from theory to applications[M]//Recent Advances in the Theory and Application of Fitness Landscapes. Berlin:Springer, 2014:133-152. [28] VANNESCHI L, CLERGUE M, COLLARD P, et al. Fitness clouds and problem hardness in genetic programming[C]//GECCO 2004:Proceedings of the 2004 Genetic and Evolutionary Computation Conference, LNCS 3103. Berlin:Springer, 2004:690-701. |