Homotopic Convex Transformation: A New Landscape Smoothing Method for the Traveling Salesman Problem.
暂无分享,去创建一个
[1] R. Ho. Algebraic Topology , 2022 .
[2] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[3] P. Stadler,et al. The landscape of the traveling salesman problem , 1992 .
[4] Lawrence. Davis,et al. Handbook Of Genetic Algorithms , 1990 .
[5] Qingfu Zhang,et al. EB-GLS: an improved guided local search based on the big valley structure , 2017, Memetic Comput..
[6] Bernd Freisleben,et al. Memetic Algorithms for the Traveling Salesman Problem , 2002, Complex Syst..
[7] Adam Prügel-Bennett,et al. An Analysis of the Fitness Landscape of Travelling Salesman Problem , 2016, Evolutionary Computation.
[8] Edward P. K. Tsang,et al. Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..
[9] Fan Guo,et al. Stochastic Local Search Using the Search Space Smoothing Meta-Heuristic: A Case Study , 2006, JCIS.
[10] William J. Cook,et al. Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.
[11] Jon Jouis Bentley,et al. Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..
[12] Bernd Freisleben,et al. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..
[13] Bruce L. Golden,et al. A computational study of smoothing heuristics for the traveling salesman problem , 2000, Eur. J. Oper. Res..
[14] Manabu Hasegawa,et al. Mutually beneficial relationship in optimization between search-space smoothing and stochastic search , 2013 .
[15] R. Eberhart,et al. Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[16] Irène Charon,et al. Mixing Different Components of Metaheuristics , 1996 .
[17] Jean-Paul Watson,et al. An Introduction to Fitness Landscape Analysis and Cost Models for Local Search , 2010 .
[18] William J. Cook,et al. The Traveling Salesman Problem: A Computational Study , 2007 .
[19] Michael Affenzeller,et al. A Comprehensive Survey on Fitness Landscape Analysis , 2012, Recent Advances in Intelligent Engineering Systems.
[20] Manuel Laguna,et al. Tabu Search , 1997 .
[21] Jun Gu,et al. Efficient Local Search With Search Space Smoothing: A Case Study of the Traveling Salesman Problem (TSP) , 1994, IEEE Trans. Syst. Man Cybern. Syst..
[22] T. Ormerod,et al. Human performance on the traveling salesman problem , 1996, Perception & psychophysics.
[23] George C. Runger,et al. See the forest before the trees: fine-tuned learning and its application to the traveling salesman problem , 1998, IEEE Trans. Syst. Man Cybern. Part A.
[24] James Smith,et al. A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.
[25] Adam Prügel-Bennett,et al. On the Landscape of Combinatorial Optimization Problems , 2014, IEEE Transactions on Evolutionary Computation.
[26] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[27] Peter Merz,et al. Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms , 2004, Evolutionary Computation.
[28] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[29] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[30] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[31] Zbigniew Michalewicz,et al. Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem , 2014, IEEE Computational Intelligence Magazine.
[32] T. Stützle,et al. Iterated Local Search: Framework and Applications , 2018, Handbook of Metaheuristics.
[33] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[34] J. M. Singer,et al. Search-space smoothing for combinatorial optimization problems , 1997 .
[35] Kathryn A. Dowsland,et al. Simulated Annealing , 1989, Encyclopedia of GIS.
[36] Weixiong Zhang,et al. A Novel Local Search Algorithm for the Traveling Salesman Problem that Exploits Backbones , 2005, IJCAI.
[37] Gabriela Ochoa,et al. Deconstructing the Big Valley Search Space Hypothesis , 2016, EvoCOP.
[38] Chris Walshaw,et al. Multilevel Refinement for Combinatorial Optimisation Problems , 2004, Ann. Oper. Res..
[39] Doug Hains,et al. Revisiting the big valley search space structure in the TSP , 2011, J. Oper. Res. Soc..
[40] Christian M. Reidys,et al. Combinatorial Landscapes , 2002, SIAM Rev..
[41] Thomas Stützle,et al. Ant Colony Optimization , 2009, EMO.