A hybrid nested partitions optimization algorithm for the QAP problem

zbMATH Open1240.90337MaRDI QIDQ3014348FDOQ3014348

Authors: Wei Wu, Junhu Wei, Xiaohong Guan 

Publication date: 19 July 2011

Recommendations

• A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem
• A hybrid biased random key genetic algorithm for the quadratic assignment problem
• Hybrid nested partitions method for the traveling salesman problem
• scientific article; zbMATH DE number 2201174
• A nested partition-optimization algorithm for flow shop scheduling

zbMATH Keywords

combinatorial optimizationquadratic assignment problemtabu searchnested partitions algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cited In (4)

• Hybrid optimization algorithm based on grid partitioning
• A nested partition-optimization algorithm for flow shop scheduling
• Hybrid nested partitions method for the traveling salesman problem
• Nested Partitions and Its Applications to the Intermodal Hub Location Problem

This page was built for publication: A hybrid nested partitions optimization algorithm for the QAP problem

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