A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
From MaRDI portal
Publication:439505
DOI10.1016/j.ejor.2011.10.052zbMath1244.90123MaRDI QIDQ439505
Publication date: 16 August 2012
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.10.052
heuristics; integer programming; simulated annealing; facilities planning and design; graph-pair representation
90C35: Programming involving graphs or networks
90C10: Integer programming
90C11: Mixed integer programming
90C59: Approximation methods and heuristics in mathematical programming
90B90: Case-oriented studies in operations research
90B80: Discrete location and assignment
Related Items
A biased random-key genetic algorithm for the unequal area facility layout problem, An improved two-stage optimization-based framework for unequal-areas facility layout, A model to optimize rack layout in a retail store, Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions, A new solution method of ant colony-based logistic center area layout problem, A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Efficient models for the facility layout problem
- Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
- Applying ant system for solving unequal area facility layout problems
- A nonlinear optimization approach for solving facility layout problems
- Optimal facility layout design
- Simulated annealing and genetic algorithms for the facility layout problem: A survey
- Applying the sequence-pair representation to optimal facility layout designs
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Enhanced Model Formulations for Optimal Facility Layout
- A simulated annealing algorithm for allocating space to manufacturing cells
- A new simulated annealing algorithm for the facility layout problem
- Static and Dynamic Layout Problems with Varying Areas
- Spine layout design