Applying ant system for solving unequal area facility layout problems
From MaRDI portal
Publication:1040995
DOI10.1016/j.ejor.2009.06.016zbMath1176.90358MaRDI QIDQ1040995
Publication date: 27 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.06.016
metaheuristic; facility layout; ant system; unequal area facility layout problem; slicing tree representation
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Related Items
A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem, A slicing tree representation and QCP-model-based heuristic algorithm for the unequal-area block facility layout problem, A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
Cites Work
- Unnamed Item
- A genetic ant colony optimisation system (GenANT) for quadratic assignment problems
- Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
- Heuristics for the dynamic facility layout problem with unequal-area departments
- Floorplan design of VLSI circuits
- A nonlinear optimization approach for solving facility layout problems
- Optimal facility layout design
- Ant colony optimisation for machine layout problems
- Ant colony optimization for solving an industrial layout problem
- Applying the sequence-pair representation to optimal facility layout designs
- A New Mathematical-Programming Framework for Facility-Layout Design
- Enhanced Model Formulations for Optimal Facility Layout
- A coevolutionary algorithm for a facility layout problem
