Hill-Climbing Algorithm: Let's Go for a Walk Before Finding the Optimum
暂无分享,去创建一个
[1] Bernd Freisleben,et al. Memetic Algorithms for the Traveling Salesman Problem , 2002, Complex Syst..
[2] Adam Prügel-Bennett,et al. Quadratic assignment problem: a landscape analysis , 2015, Evol. Intell..
[3] Adam Prügel-Bennett,et al. Maximum Satisfiability: Anatomy of the Fitness Landscape for a Hard Combinatorial Optimization Problem , 2012, IEEE Transactions on Evolutionary Computation.
[4] Adam Prügel-Bennett,et al. Anatomy of the fitness landscape for dense graph-colouring problem , 2015, Swarm Evol. Comput..
[5] Vassilis Zissimopoulos,et al. On the Hardness of the Quadratic Assignment Problem with Metaheuristics , 2002, J. Heuristics.
[6] Sébastien Vérel,et al. Complex-network analysis of combinatorial spaces: The NK landscape case , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.
[7] Sébastien Vérel,et al. Local Optima Networks of the Permutation Flow-Shop Problem , 2013, Artificial Evolution.
[8] Kathleen Steinhöfel,et al. Combinatorial landscape analysis for k-SAT instances , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).
[9] Sébastien Vérel,et al. Clustering of Local Optima in Combinatorial Fitness Landscapes , 2011, LION.
[10] É. Taillard. Some efficient heuristic methods for the flow shop sequencing problem , 1990 .
[11] Adam Prügel-Bennett,et al. On the Landscape of Combinatorial Optimization Problems , 2014, IEEE Transactions on Evolutionary Computation.
[12] Christian M. Reidys,et al. Combinatorial Landscapes , 2002, SIAM Rev..
[13] Irene Moser,et al. Identifying Features of Fitness Landscapes and Relating Them to Problem Difficulty , 2017, Evolutionary Computation.
[14] Franz Rendl,et al. QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..
[15] Sébastien Vérel,et al. Local Optima Networks of NK Landscapes With Neutrality , 2011, IEEE Transactions on Evolutionary Computation.
[16] Sébastien Vérel,et al. The Connectivity of NK Landscapes' Basins - A Network Analysis , 2008, ALIFE.
[17] Peter Merz,et al. Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms , 2004, Evolutionary Computation.
[18] Cyril Fonlupt,et al. Fitness Landscapes and Performance of Meta-Heuristics , 1999 .
[19] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[20] Gabriela Ochoa,et al. Evolutionary computation in combinatorial optimization : 14th European Conference, EvoCOP 2014, Granada, Spain, April 23-25, 2014 : revised selected papers , 2014 .
[21] Colin R. Reeves,et al. Estimating the Number of Solutions for SAT Problems , 2004, PPSN.
[22] T. Stützle,et al. The Linear Ordering Problem: Instances, Search Space Analysis and Algorithms , 2004 .
[23] Marco Baioletti,et al. Fitness Landscape Analysis of the Permutation Flowshop Scheduling Problem with Total Flow Time Criterion , 2017, ICCSA.
[24] Sébastien Vérel,et al. Local Optima Networks of the Quadratic Assignment Problem , 2010, IEEE Congress on Evolutionary Computation.
[25] Enrique Alba,et al. Local Optima Networks, Landscape Autocorrelation and Heuristic Search Performance , 2012, PPSN.
[26] C. R. Reeves,et al. Landscapes, operators and heuristic search , 1999, Ann. Oper. Res..
[27] Kathleen Steinhöfel,et al. Analysis of Local Search Landscapes for k-SAT Instances , 2010, Math. Comput. Sci..