A New Generalized Partition Crossover for the Traveling Salesman Problem: Tunneling between Local Optima
暂无分享,去创建一个
[1] Patrick D. Surry,et al. Fitness Variance of Formae and Performance Prediction , 1994, FOGA.
[2] L. Darrell Whitley,et al. Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover , 2018, GECCO.
[3] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[4] Nicholas J. Radcliffe,et al. The algebra of genetic algorithms , 1994, Annals of Mathematics and Artificial Intelligence.
[5] L. Darrell Whitley,et al. Efficient Recombination in the Lin-Kernighan-Helsgaun Traveling Salesman Heuristic , 2018, PPSN.
[6] L. Darrell Whitley,et al. Generalized asymmetric partition crossover (GAPX) for the asymmetric TSP , 2014, GECCO.
[7] Doug Hains,et al. Tunneling between optima: partition crossover for the traveling salesman problem , 2009, GECCO.
[8] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[9] A. Mobius,et al. COMBINATORIAL OPTIMIZATION BY ITERATIVE PARTIAL TRANSCRIPTION , 1999, cond-mat/9902034.
[10] L. Darrell Whitley,et al. A Fusion Mechanism for the Generalized Asymmetric Partition Crossover , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).
[11] Anton V. Eremeev,et al. Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem , 2017, LSSC.
[12] Paul D. Seymour,et al. Tour Merging via Branch-Decomposition , 2003, INFORMS J. Comput..
[13] Shigenobu Kobayashi,et al. A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem , 2013, INFORMS J. Comput..
[14] Thomas Stützle,et al. On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem , 2014, Eur. J. Oper. Res..
[15] L. Darrell Whitley,et al. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.
[16] Isao Ono,et al. A parallel genetic algorithm with edge assembly crossover for 100,000-city scale TSPs , 2013, 2013 IEEE Congress on Evolutionary Computation.
[17] Doug Hains,et al. A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover , 2010, PPSN.
[18] Darrell Whitley,et al. NK Hybrid Genetic Algorithm for Clustering , 2018, IEEE Transactions on Evolutionary Computation.
[19] Keld Helsgaun,et al. General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..
[20] Julia V. Kovalenko,et al. Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II , 2014 .
[21] Doug Hains,et al. Improving Lin-Kernighan-Helsgaun with Crossover on Clustered Instances of the TSP , 2012, PPSN.
[22] L. Darrell Whitley,et al. Building a better heuristic for the traveling salesman problem: combining edge assembly crossover and partition crossover , 2017, GECCO.
[23] L. Darrell Whitley,et al. Partition Crossover for Pseudo-Boolean Optimization , 2015, FOGA.
[24] Shigenobu Kobayashi,et al. Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.
[25] J. Lenstra,et al. In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation , 2016 .
[26] L. Darrell Whitley,et al. Tunnelling Crossover Networks for the Asymmetric TSP , 2016, PPSN.