A hybrid biased random key genetic algorithm for the quadratic assignment problem

DOI10.1016/J.IPL.2016.03.002zbMATH1358.90160DBLPjournals/ipl/Lalla-RuizIMM16OpenAlexW2306967788WikidataQ57866594MaRDI QIDQ280940FDOQ280940

Authors Eduardo Lalla-Ruiz, Christopher Expósito-Izquierdo, Belén Melián-Batista, J. 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

zbMATH Keywords

quadratic assignment problemapproximation algorithmsmetaheuristicbiased random key genetic algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem
• A genetic approach to the quadratic assignment problem
• A greedy genetic algorithm for the quadratic assignment problem
• Publication:4247462
• Testing of hybrid genetic algorithms for structured quadratic assignment problems

Cites work

• scientific article; zbMATH DE number 3680932 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• A branch-and-cut algorithm for quadratic assignment problems based on linearizations
• A genetic algorithm for the weight setting problem in OSPF routing
• A survey for the quadratic assignment problem
• An extreme point algorithm for a local minimum solution to the quadratic assignment problem
• Assignment Problems and the Location of Economic Activities
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• P-Complete Approximation Problems
• QAPLIB - a quadratic assignment problem library
• 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

Cited in

(4)

• A biased random-key genetic algorithm for the maximum quasi-clique problem
• A hybrid nested partitions optimization algorithm for the QAP problem
• A parallel water flow algorithm with local search for solving the quadratic assignment problem
• A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem

Describes a project that uses

Uses Software

• QAPLIB

This page was built for publication: A hybrid biased random key genetic algorithm for the quadratic assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280940)