PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID
DOI10.1142/S0129054112400242zbMath1245.68175OpenAlexW2116735668MaRDI QIDQ2909213
El-Ghazali Talbi, Lakhdar Loukil, Pascal Bouvry, Malika Mehdi, Nouredine Melab
Publication date: 30 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054112400242
metaheuristicssimulated annealinggrid computinghybridizationparallel genetic algorithmsinsular modelquadratic 3-dimensional assignment problem
Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14)
Uses Software
Cites Work
- An improved annealing scheme for the QAP
- QAPLIB-A quadratic assignment problem library
- A genetic approach to the quadratic assignment problem
- Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Iterated local search for the quadratic assignment problem
- Trellis-coded, type-I hybrid-ARQ protocols based on CRC error-detecting codes
- The Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Numerical investigations on quadratic assignment problems
- Parallel Metaheuristics
This page was built for publication: PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID