A hybrid biased random key genetic algorithm for the quadratic assignment problem
DOI10.1016/j.ipl.2016.03.002zbMath1358.90160DBLPjournals/ipl/Lalla-RuizIMM16OpenAlexW2306967788WikidataQ57866594 ScholiaQ57866594MaRDI QIDQ280940
Eduardo Lalla-Ruiz, Christopher Expósito-Izquierdo, Belén Melián-Batista, José Marcos Moreno-Vega
Publication date: 10 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.03.002
quadratic assignment problemmetaheuristicapproximation algorithmsbiased random key genetic algorithm
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- The quadratic assignment problem in the context of the printed circuit board assembly process
- A survey for the quadratic assignment problem
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- QAPLIB - a quadratic assignment problem library
- A genetic algorithm for the weight setting problem in OSPF routing
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem
- Assignment Problems and the Location of Economic Activities
- P-Complete Approximation Problems
- Genetic Algorithms and Random Keys for Sequencing and Optimization
This page was built for publication: A hybrid biased random key genetic algorithm for the quadratic assignment problem
