The natural crossover for the 2D Euclidean TSP
暂无分享,去创建一个
[1] David S. Johnson,et al. Local Optimization and the Traveling Salesman Problem , 1990, ICALP.
[2] L. Darrell Whitley,et al. The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt , 1998, PPSN.
[3] Shigenobu Kobayashi,et al. Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.
[4] L. Darrell Whitley,et al. A Comparison of Genetic Sequencing Operators , 1991, ICGA.
[5] James P. Cohoon,et al. Genetic Placement , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[6] Claude-Nicolas Fiechter,et al. A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..
[7] Dirk Van Gucht,et al. The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem , 1989 .
[8] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.
[9] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[10] Lawrence Davis,et al. Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.
[11] Andrew B. Kahng,et al. Toward More Powerful Recombinations , 1995, ICGA.
[12] Byung Ro Moon,et al. On Multi-Dimensional Encoding/Crossover , 1995, ICGA.
[13] Jennifer Ryan,et al. A Two-Dimensional Genetic Algorithm for the Ising Problem , 1991, Complex Syst..
[14] Bernd Freisleben,et al. New Genetic Local Search Operators for the Traveling Salesman Problem , 1996, PPSN.
[15] Heinrich Braun,et al. On Solving Travelling Salesman Problems by Genetic Algorithms , 1990, PPSN.
[16] John J. Grefenstette,et al. Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.
[17] Byung Ro Moon,et al. Hyperplane Synthesis for Genetic Algorithms , 1993, ICGA.
[18] Byung Ro Moon,et al. A new genetic approach for the traveling salesman problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[19] Ronald L. Graham,et al. Some NP-complete geometric problems , 1976, STOC '76.
[20] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[21] Edward W. Felten,et al. Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..
[22] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[23] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[24] Jon Louis Bentley,et al. Experiments on traveling salesman heuristics , 1990, SODA '90.
[25] David S. Johnson,et al. Data structures for traveling salesmen , 1993, SODA '93.
[26] Gunar E. Liepins,et al. A New Approach on the Traveling Salesman Problem by Genetic Algorithms , 1993, ICGA.
[27] Jean-Yves Potvin,et al. THE TRAVELING SALESMAN PROBLEM: A NEURAL NETWORK PERSPECTIVE , 1993 .
[28] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[29] Byung Ro Moon,et al. Genetic Algorithm and Graph Partitioning , 1996, IEEE Trans. Computers.
[30] Yun-Sik Lee,et al. GEORG: VLSI circuit partitioner with a new genetic algorithm framework , 1998, J. Intell. Manuf..
[31] B. Freisleben,et al. Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).
[32] K. Katayama,et al. Iterated local search approach using genetic transformation to the traveling salesman problem , 1999 .