A convex optimisation framework for the unequal-areas facility layout problem
From MaRDI portal
Publication:2275810
DOI10.1016/j.ejor.2011.04.013zbMath1218.90102OpenAlexW1964970764MaRDI QIDQ2275810
Anthony Vannelli, Chaomin Luo, Ibolya Jankovits, Miguel F. Anjos
Publication date: 10 August 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.04.013
Semidefinite programming (90C22) Convex programming (90C25) Discrete location and assignment (90B80)
Related Items (8)
Strong mixed-integer formulations for the floor layout problem ⋮ Beating the SDP bound for the floor layout problem: a simple combinatorial idea ⋮ An improved two-stage optimization-based framework for unequal-areas facility layout ⋮ Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach ⋮ On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ Mathematical optimization approach for facility layout on several rows ⋮ An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Semidefinite programming for discrete optimization and matrix completion problems
- An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages
- Detailed layout planning for irregularly-shaped machines with transportation path design
- Graph theory applications
- A nonlinear optimization approach for solving facility layout problems
- Genetic algorithms, function optimization, and facility layout design
- Optimal facility layout design
- Geometric algorithms and combinatorial optimization.
- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- An attractor-repeller approach to floorplanning
- Hope: A genetic algorithm for the unequal area facility layout problem.
- FACOPT: A user friendly FACility layout OPTimization system.
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Solving large quadratic assignment problems on computational grids
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- A parallel heuristic for quadratic assignment problems
- Applying the sequence-pair representation to optimal facility layout designs
- A New Mathematical-Programming Framework for Facility-Layout Design
- A branch and bound algorithm for locating input and output points of departments on the block layout
- Enhanced Model Formulations for Optimal Facility Layout
- DISCON: A New Method for the Layout Problem
- A simulated annealing algorithm for allocating space to manufacturing cells
- A new simulated annealing algorithm for the facility layout problem
- An iterative facility layout algorithm
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A spring-embedding approach for the facility layout problem
- Handbook of semidefinite programming. Theory, algorithms, and applications
- An efficient two-staged approach for generating block layouts
This page was built for publication: A convex optimisation framework for the unequal-areas facility layout problem
