A genetic algorithm with the improved 2-opt method
暂无分享,去创建一个
[1] Jon Louis Bentley,et al. Experiments on traveling salesman heuristics , 1990, SODA '90.
[2] Bernd Freisleben,et al. A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[3] É. Taillard. COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .
[4] Éric D. Taillard,et al. FANT: Fast ant system , 1998 .
[5] É. Taillard,et al. Adaptive memories for the Quadratic Assignment Problems , 1997 .
[6] T. Koopmans,et al. Assignment Problems and the Location of Economic Activities , 1957 .
[7] Franz Rendl,et al. QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..
[8] S. E. Karisch,et al. QAPLIB-A quadratic assignment problem library , 1991 .
[9] K. Katayama,et al. A Variant k-opt Local Search Heuristic for Binary Quadratic Programming , 2001 .
[10] Bernd Freisleben,et al. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..
[11] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[12] Ric,et al. Adaptive Memories for the Quadratic Assignment Problem , 1997 .
[13] Roberto Battiti,et al. The Reactive Tabu Search , 1994, INFORMS J. Comput..