A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices

DOI10.1016/j.ejor.2004.08.024zbMath1079.90113OpenAlexW2004631337MaRDI QIDQ2572862

Luís Paquete, Thomas Stützle

Publication date: 4 November 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.08.024

zbMATH Keywords

Combinatorial optimizationMultiple objective programmingStochastic local search

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Facility layout problem with QAP formulation under scenario-based uncertainty, Multiobjective GRASP with path relinking, Anytime Pareto local search, A survey for the quadratic assignment problem, Many-objective Pareto local search, Proper balance between search towards and along Pareto front: biobjective TSP case study, Parameter-less co-clustering for star-structured heterogeneous data, Selection hyper-heuristics for the multi and many-objective quadratic assignment problem, Estimating the number of basins of attraction of multi-objective combinatorial problems, Hierarchical co-clustering: off-line and incremental approaches, Connectedness of efficient solutions in multiple objective combinatorial optimization, On local optima in multiobjective combinatorial optimization problems, On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems, Hybrid population-based algorithms for the bi-objective quadratic assignment problem, Empirical study of exact algorithms for the multi-objective spanning tree, Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems

Uses Software

• QAPLIB
• PAES
• HAS-QAP

Cites Work

• A parametric approach to solving bicriterion shortest path problems
• On bicriterion minimal spanning trees: An approximation
• The quadratic assignment problem. Theory and algorithms
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Local search algorithms for SAT: an empirical evaluation
• Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Solving large quadratic assignment problems on computational grids
• Ant colonies for the quadratic assignment problem
• P-Complete Approximation Problems
• Comparison of iterative searches for the quadratic assignment problem
• The Reactive Tabu Search
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Genetic local search for multi-objective combinatorial optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item