PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID

DOI10.1142/S0129054112400242zbMath1245.68175MaRDI 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)

zbMATH Keywords

metaheuristics; simulated annealing; grid computing; hybridization; parallel genetic algorithms; insular model; quadratic 3-dimensional assignment problem

Mathematics Subject Classification ID

68W10: Parallel algorithms in computer science

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68M14: Distributed systems

Uses Software

• ParaDisEO

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