Ensemble for Solving Quadratic Assignment Problems
暂无分享,去创建一个
Ponnuthurai N. Suganthan | Meng-Hiot Lim | Li Qin Song | V. K. Doan | P. Suganthan | M. Lim | L. Song | V. K. Doan
[1] Jing Tang,et al. Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems , 2006, Soft Comput..
[2] Éric D. Taillard,et al. Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..
[3] Ying Wang,et al. A Tabu search algorithm for static routing and wavelength assignment problem , 2005, IEEE Communications Letters.
[4] Sigeru Omatu,et al. Efficient Genetic Algorithms Using Simple Genes Exchange Local Search Policy for the Quadratic Assignment Problem , 2000, Comput. Optim. Appl..
[5] Shin Ishii,et al. Constrained neural approaches to quadratic assignment problems , 1998, Neural Networks.
[6] Jing J. Liang,et al. Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.
[7] Thomas Stützle,et al. Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..
[8] Kazuyuki Aihara,et al. A novel chaotic search for quadratic assignment problems , 2002, Eur. J. Oper. Res..
[9] Panos M. Pardalos,et al. A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.
[10] P. N. Suganthan,et al. Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization , 2009, IEEE Transactions on Evolutionary Computation.
[11] Amit Agarwal,et al. Hybrid ant colony algorithms for path planning in sparse graphs , 2008, Soft Comput..
[12] Vittorio Maniezzo,et al. The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..
[13] Meng Joo Er,et al. PARALLEL MEMETIC ALGORITHM WITH SELECTIVE LOCAL SEARCH FOR LARGE SCALE QUADRATIC ASSIGNMENT PROBLEMS , 2006 .
[14] B. Freisleben,et al. A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[15] Bernd Freisleben,et al. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..
[16] Yu Yuan,et al. Extensive Testing of a Hybrid Genetic Algorithm for Solving Quadratic Assignment Problems , 2002, Comput. Optim. Appl..
[17] Per S. Laursen. Simulated annealing for the QAP. Optimal tradeoff between simulation time and solution quality , 1993 .
[18] Natalio Krasnogor,et al. Editorial to the first issue , 2009, Memetic Comput..
[19] Jadranka Skorin-Kapov,et al. Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..
[20] David Connolly. An improved annealing scheme for the QAP , 1990 .
[21] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[22] T. Koopmans,et al. Assignment Problems and the Location of Economic Activities , 1957 .
[23] James Kennedy,et al. Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.