Facility layout problem with QAP formulation under scenario-based uncertainty
From MaRDI portal
Publication:5882273
Recommendations
- Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty
- The capacitated facility location-allocation problem under uncertain environment
- Integrated facility location and capacity planning under uncertainty
- A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem
- A new heuristic for the multi-mode resource investment problem
- Robustness of solutions to the capacitated facility location problem with uncertain demand
- Facility location problems with uncertainty on the plane
- Approximating soft-capacitated facility location problem with uncertainty
- A new model for robust facility layout problem
- Fuzzy approach to the robust facility layout in uncertain production environments
Cites work
- scientific article; zbMATH DE number 714537 (Why is no real title available?)
- scientific article; zbMATH DE number 1975087 (Why is no real title available?)
- A genetic approach to the quadratic assignment problem
- A greedy genetic algorithm for the quadratic assignment problem
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- A new exact discrete linear reformulation of the quadratic assignment problem
- A new linearization method for quadratic assignment problems
- A revised reformulation-linearization technique for the quadratic assignment problem
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- A survey for the quadratic assignment problem
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- Algorithms for robust single and multiple period layout planning for manufacturing systems
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Comparison of iterative searches for the quadratic assignment problem
- Compounded genetic algorithms for the quadratic assignment problem
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems
- Evolutionary Computation in Combinatorial Optimization
- Evolutionary Multi-Criterion Optimization
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty
- Lectures on Stochastic Programming
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- P-Complete Approximation Problems
- QAPLIB - a quadratic assignment problem library
- Robust discrete optimization and its applications
- Robust optimization
- Robust optimization - a comprehensive survey
- Robust optimization-methodology and applications
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
Cited in
(7)- An improved genetic algorithm based robust approach for stochastic dynamic facility layout problem
- Fuzzy approach to the robust facility layout in uncertain production environments
- Collaborative optimization of workshop layout and scheduling
- Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty
- Layout optimization considering production uncertainty and routing flexibility
- A continuous approach to considering uncertainty in facility design
- A new model for robust facility layout problem
This page was built for publication: Facility layout problem with QAP formulation under scenario-based uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882273)
