參考文獻

[1] Shi Jinhua，Lu Hui，Mao Kefei.Solving the test task scheduling problem with a genetic algorithm based on the scheme choice rule[C].In：Tan Y，Shi Y，Li L（Eds.），Advances in Swarm Intelligence.ICSI2016.Lecture Notes in Computer Science，Springer，Cham，2016：19-27.

[2] Lu Hui，Niu Ruiyao，Liu Jing，et al.A chaotic non-dominated sorting genetic algorithm for the multi-objec-tive automatic test task scheduling problem[J].Applied Soft Computing，2013，13（5）：2790-2802.

[3] JAIN A S，MEERAN S.Deterministic job-shop scheduling：past，present and future[J].European Journal of Operational Research，1999.113（2）：390-434.

[4] Wang Xiaojun，Gao Liang，Zhang Chaoyong，et al.A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem[J].International Journal of Advanced Manufactur- ing Technology，2010，51：757-767.

[5] VALLADA E，RUIZ R.A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times[J].European Journal of Operational Research，2011，211（3）：612-622.

[6] 付新華，肖明清，夏銳.基于蟻群算法的測試任務調度[J].系統仿真學報，2008，20（16）：4352-4356.

[7] 付新華，肖明清，劉萬俊，周越文.一種新的并行測試任務調度算法[J].航空學報，2009，30（12）：2363-2370.

[8] SAIDI-MEHRABAD M，FATTAHI P.Flexible job shop scheduling with tabu search algorithms[J].Interna- tional Journal of Advanced Manufacturing Technology，2007，3：563-570.

[9] Liu Hongbo，ABRAHAM A，Wang Zuwen.A multi-swarm approach to multi-objective flexible job shop scheduling problems[J].Fundamenta Informaticae，2009，95（4）：465-489.

[10] BENAVENT E，MARTíNEZ A.Multi-depot Multiple TSP：a polyhedral study and computational results[J]. Annals of Operations Research，2013，207：7-25.

[11] 黃嵐，王康平，周春光，等.粒子群優化算法求解旅行商問題[J].吉林大學學報，2003，41（4）：477-480.

[12] 馬欣，朱雙東，楊斐.旅行商問題（TSP）的一種改進遺傳算法[J].計算機仿真，2003，20（4）：36-37.

[13] SINHA A，ZOLTNERS A.The multiple-choice knapsack problem[J].Operations Research，1979，27（3）：507-515.

[14] 馬良，王龍德.背包問題的螞蟻優化算法[J].計算機應用，2001，21（8）：4-5.

[15] MARTELLO S，VIGO D.Exact solution of the two-dimensional finite bin packing problem[J].Management science，1998，44（3）：388-399.

[16] 曹先彬，劉克勝.基于免疫遺傳算法的裝箱問題求解[J].小型微型計算機系統，2000，21（4）：361-363.

[17] MCCORMICK S T.Optimal approximation of sparse hessians and its equivalence to a graph coloring problem[J].Mathematical Programming，1983，26：153-171.

[18] 廖飛雄，馬良.圖著色問題的啟發式搜索螞蟻算法[J].計算機工程，2007，33（16）：191-192.

[19] SAKOE H，CHIBA S.Dynamic programming algorithm optimization for spoken word recognition[J].IEEE transactions on acoustics，speech，and signal processing，1978，26（1）：43-49.

[20] 趙子臣，相年德.應用啟發式與逐步動態規劃法進行機組最優組合[J].清華大學學報，1997，37（1）：57-60.

[21] DAVIS P S，RAY T L.A branch-bound algorithm for the capacitated facilities location problem[J].Naval Research Logistics Quarterly，1969，16（3）：331-344.

[22] WRIGHT S.The roles of mutation，inbreeding，crossbreeding，and selection in evolution，1932.

[23] WEINBERGER E.Correlated and uncorrelated fitness landscapes and how to tell the difference[J].Biologi- cal Cybernetics，1990，63：325-336.

[24] LIPSITCH M.Adaptation on rugged landscapes generated by iterated local interactions of neighboring genes[C].in：BELEW R K，BOOKER L B（Eds.），Proceedings of the 4th International Conference on Genetic Algorithms，Morgan Kaufmann，San Diego，CA，USA，1991：128-135.

[25] VESSELIN K VASSILEV，TERENCE C FOGARTY，JULIANF MILLER.Information Characteristics and the Structure of Landscapes[J].Evolutionary Computation，2000，8：31-60.

[26] HORDIJK W，STADLER P F.Amplitude Spectra of Fitness Landscapes[J].Advances in Complex Systems，1998，1：39-66.

[27] DAVIDOR Y.Epistasis variance：a viewpoint on GA-hardness[J].Found Genetic Algorithms，1991：23-35.

[28] FONLUPT C，Robilliard D，Preux P.A bit-wise epistasis measure for binary searchspaces[C].In： EIBEN A，B?CK T，SCHOENAUER M，SCHWEFEL H P（Eds.），Parallel Problem Solving from Nature-PPSN V，Springer，Berlin Heidelberg，1998：47-56.

[29 ]REIDYS C M，STADLER P F.Neutrality in fitness landscapes[J].Applied Mathematics and Computation，2001，117：321-350.

[30] VEREL S，OCHOA G，TOMASSINI M.Local optima networks of NK landscapes with neutrality[J].IEEE Transactions on Evolutionary Computation，2011，15：783-797.

[31] SMITH T，HUSBANDS P，LAYZELL P，et al.Fitness landscapes and evolvability[J].Evolutionary Com-putation，2002，10：1-34.

[32] VEREL S，COLLARD P，CLERGUE M.Where are bottlenecks in NK fitness landscapes[C].The 2003 Congress on Evolutionary Computation，2003：273-280.

[33] VANNESCHI L，CLERGUE M，COLLARD P，et al.Fitness Clouds and Problem Hardness in Genetic Pro-gramming[C].In：Deb K（Eds.），Genetic and Evolutionary Computation-GECCO 2004.Springer Ber-lin Heidelberg，2004：690-701.

[34] Lu Guanzhou，Li Jinlong，Yao Xin.Fitness-Probability Cloud and a Measure of Problem Hardness for Evolu-tionary Algorithms[C].In：Merz P，Hao J K（Eds.），Evolutionary Computation in Combinatorial Optimi-zation.Springer，Berlin Heidelberg，2011：108-117.

[35] DEB K，GOLDBERG D.Sufficient conditions for deceptive and easy binary functions[J].Annals of Mathe-matics and Artificial Intelligence，1994，10：385-408.

[36] WHITLEY D，HECKENDORN R B，STEVENS S.Hyperplane ranking，nonlinearity and the simple genetic algorithm[J].Information Sciences，2003，156：123-145.

[37] ROHLFSHAGEN P，YAO X.Dynamic Combinatorial Optimization Problems：A Fitness Landscape Analysis[C].In：Alba E，Nakib A，Siarry P（Eds.），Metaheuristics for Dynamic Optimization，Springer，Berlin Heidelberg，2013：79-97.

[38] TINO＇S R，YANG S X.Analysis of fitness landscape modifications in evolutionary dynamic optimization[J].Information Sciences，2014，282：214-236.

[39] COTTA C，FERNáNDEZ A J.Analyzing fitness landscapes for the optimal golomb ruler problem[C].Evolu-tionary Computation in Combinatorial Optimization Lecture Notes in Computer Science，2005，3448：68-79.

[40] 文峰.基于適應度地形理論的作業車間調度方法研究[D].武漢：華中科技大學，2012.

[41] Lu Hui，Liu Jing，Niu Ruiyao，et al.Fitness distance analysis for parallel genetic algorithm in the test task scheduling problem[J].Soft Comptuing，2014，18（12）：2385-2396.

[42] VEREL S，LLEFOOGHE A，JOURDAN L，et al.On the structure of multiobjective combinatorial search space：MNK-landscapes with correlated objectives[J].European Journal of Operational Research，2013，227（2）：331-342.

[43] FABRE M G，PULIDO G T，TELLO E R.Multi-objectivization，fitness landscape transformation and search performance：A case of study on the hp model for protein structure prediction[J].European Journal of Oper-ational Research，2015，243（2）：405-422.

[44] He Jun，Chen Tianshi，Yao Xin.On the Easiest and Hardest Fitness Functions[J].IEEE Transactions on Evolutionary Computation，2015，19（2）：295-305.

[45] BASSEUR M，GOE··FFON A.Climbing combinatorial fitness landscapes[J].Applied Soft Computing，2015，30：688-704.

[46] Huang Dong，Shen Zhigi，Miao Chunyan，et al.Fitness landscape analysis for resource allocation in multiuser OFDM based cognitive radio systems[J].ACM SIGMOBILE Mobile Computing and Communications Review，2009，13（2）：26-36.

[47] Lu Hui，Zhou Rongrong，Cheng Shi，et al.Multi-center variable-scale search algorithm for combinatorial optimization problems with the multimodal property[J].Applied Soft Computing，2019，（84）：105726.