HYBRID NEWTON-RAPHSON GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
暂无分享,去创建一个
[1] S. Eilon,et al. Profile of Current Members of the Operational Research Society , 1969 .
[2] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[3] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[4] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[5] David J. Sirag,et al. Toward a unified thermodynamic genetic operator , 1987 .
[6] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[7] L. D. Whitley,et al. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, ICGA.
[8] Darrell Whitley,et al. Scheduling problems and traveling salesman: the genetic edge recombination , 1989 .
[9] William H. Press,et al. Numerical recipes , 1990 .
[10] D. Fogel. Applying evolutionary programming to selected traveling salesman problems , 1993 .
[11] Gunar E. Liepins,et al. A New Approach on the Traveling Salesman Problem by Genetic Algorithms , 1993, ICGA.
[12] Michael de la Maza,et al. Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .
[13] David B. Fogel,et al. An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.
[14] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.