Abstract
This paper concerns the quadratic three-dimensional assignment problem (Q3AP), an extension of the quadratic assignment problem (QAP), and proposes an efficient hybrid evolutionary algorithm combining stochastic optimization and local search with a number of crossover operators, a number of mutation operators and an auto-adaptation mechanism. Auto-adaptation manages the pool of evolutionary operators applying different operators in different computation phases to better explore the search space and to avoid premature convergence. Local search additionally optimizes populations of candidate solutions and accelerates evolutionary search. It uses a many-core graphics processor to optimize a number of solutions in parallel, which enables its incorporation into the evolutionary algorithm without excessive increases in the computation time. Experiments performed on benchmark Q3AP instances derived from the classic QAP instances proposed by Nugent et al. confirmed that the proposed algorithm is able to find optimal solutions to Q3AP in a reasonable time and outperforms best known results found in the literature.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burkard, R., Karisch, S., Rendl, F.: QAPLIB - a quadratic assignment problem library. Journal of Global Optimization 10, 391–403 (1997)
Guignard, M., Hahn, P., Ding, Z., Kim, B.-J., Samra, H., Stutzle, T., Kanthak, S.: Hybrid ARQ Symbol Mapping in Digital Wireless Communication Systems Based on the Quadratic 3-Dimensional Assignment Problem (Q3AP). In: Proceedings of the 2005 NSF Design, Service and Manufacturing Grantees and Research Conference (2005)
Hahn, P., Kim, B.-J., Stutzle, T., Kanthak, S., Hightower, W., Samra, H., Ding, Z., Guignard, M.: The Quadratic Three-Dimensional Assignment Problem: Exact and Approximate Solution Methods. European Journal of Operational Research 184, 416–428 (2008)
Loukil, L., Mehdi, M., Melab, N., Talbi, E.-G., Bouvry, P.: A Parallel Hybrid Genetic Algorithm–Simulated Annealing for Solving Q3AP on Computational Grid. In: Proceedings of the IEEE International Symposium on Parallel and Distributed Processing, pp. 1–8. IEEE Computer Society, Los Alamitos (2009)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Heidelberg (1994)
Nugent, C., Vollman, T., Ruml, J.: An Experimental Comparison of Techniques for the Assignment of Facilities to Locations. Operations Research 16, 150–173 (1968)
Pierskalla, W.: The Multi-Dimensional Assignment Problem, Technical Memorandum No. 93, Operations Research Department, CASE Institute of Technology (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lipinski, P. (2010). A Hybrid Evolutionary Algorithm to Quadratic Three-Dimensional Assignment Problem with Local Search for Many-Core Graphics Processors. In: Fyfe, C., Tino, P., Charles, D., Garcia-Osorio, C., Yin, H. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2010. IDEAL 2010. Lecture Notes in Computer Science, vol 6283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15381-5_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-15381-5_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15380-8
Online ISBN: 978-3-642-15381-5
eBook Packages: Computer ScienceComputer Science (R0)