A Genetic Algorithm with the Improved 2-opt Method for Quadratic Assignment Problem
暂无分享,去创建一个
[1] Andrew B. Kahng,et al. A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..
[2] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[3] Franz Rendl,et al. QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..
[4] M Dorigo,et al. Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..
[5] Bernd Freisleben,et al. New Genetic Local Search Operators for the Traveling Salesman Problem , 1996, PPSN.
[6] Bernd Freisleben,et al. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..
[7] T. Koopmans,et al. Assignment Problems and the Location of Economic Activities , 1957 .
[8] 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.
[9] Takeshi Yamada,et al. Landscape Analysis of the Flowshop Scheduling Problem and Genetic Local Search , 1998 .
[10] Jon Louis Bentley,et al. Experiments on traveling salesman heuristics , 1990, SODA '90.
[11] B. Freisleben,et al. Genetic algorithms for binary quadratic programming , 1999 .
[12] Bernd Freisleben,et al. A Genetic Local Search Approach to the Quadratic Assignment Problem , 1997, ICGA.