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

DOI10.1016/J.IPL.2016.03.002zbMATH Open1358.90160DBLPjournals/ipl/Lalla-RuizIMM16OpenAlexW2306967788WikidataQ57866594 ScholiaQ57866594MaRDI QIDQ280940FDOQ280940

Eduardo Lalla-Ruiz, J. Marcos Moreno-Vega, Christopher Expósito-Izquierdo, Belén Melián-Batista

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

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
• scientific article; zbMATH DE number 1302195
• Testing of hybrid genetic algorithms for structured quadratic assignment problems

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)

Cites Work

• QAPLIB - a quadratic assignment problem library
• Title not available (Why is that?)
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Assignment Problems and the Location of Economic Activities
• A branch-and-cut algorithm for quadratic assignment problems based on linearizations
• 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
• Title not available (Why is that?)
• P-Complete Approximation Problems
• 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

Cited In (2)

• A biased random-key genetic algorithm for the maximum quasi-clique problem
• A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem

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)