Facility layout problem with QAP formulation under scenario-based uncertainty

DOI10.1080/03155986.2018.1424445OpenAlexW2790022662MaRDI QIDQ5882273

Mert Şahinkoç, Ümit Bilge

Publication date: 15 March 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.2018.1424445

zbMATH Keywords

stochastic programmingmulti-objective optimizationquadratic assignment problemgenetic algorithmrobust optimizationscenario-based uncertainty

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Robustness in mathematical programming (90C17)

Related Items

Collaborative optimization of workshop layout and scheduling

Uses Software

• QAPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
• Experimental analysis of crossover and mutation operators on the quadratic assignment problem
• A survey for the quadratic assignment problem
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Robust optimization - a comprehensive survey
• Algorithms for robust single and multiple period layout planning for manufacturing systems
• An algorithm for the quadratic assignment problem using Benders' decomposition
• A genetic approach to the quadratic assignment problem
• Robust discrete optimization and its applications
• QAPLIB - a quadratic assignment problem library
• A greedy genetic algorithm for the quadratic assignment problem
• Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems
• Robust optimization-methodology and applications
• A new exact discrete linear reformulation of the quadratic assignment problem
• A revised reformulation-linearization technique for the quadratic assignment problem
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
• Compounded genetic algorithms for the quadratic assignment problem
• A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
• A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
• A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
• Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty
• The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
• A new linearization method for quadratic assignment problems
• Lectures on Stochastic Programming
• P-Complete Approximation Problems
• Comparison of iterative searches for the quadratic assignment problem
• Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
• Evolutionary Computation in Combinatorial Optimization
• Evolutionary Multi-Criterion Optimization