An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages

DOI10.1016/j.cor.2003.09.004zbMath1071.90024OpenAlexW3010618797WikidataQ58835069 ScholiaQ58835069MaRDI QIDQ707005

Hyuk-Su Jeong, Myung-Il Roh, Kyu-Yeul Lee

Publication date: 9 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.09.004

zbMATH Keywords

Genetic algorithmDijkstra's algorithmAdjacency relationshipInner structure wallMulti-floor facility layout problemPassageShip multi-deck compartment layout problem

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (16)

Ant colony optimization for solving an industrial layout problem ⋮ Optimal facility layout and material handling network design ⋮ Detailed layout planning for irregularly-shaped machines with transportation path design ⋮ A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation ⋮ Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments ⋮ A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics ⋮ Layout optimisation for an installation port of an offshore wind farm ⋮ Dynamic facility layout problem based on open queuing network theory ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ Block layout for attraction-based enterprises ⋮ Multi-level departments-to-offices assignment with different room types ⋮ Simulated annealing for optimal ship routing ⋮ A convex optimisation framework for the unequal-areas facility layout problem ⋮ Integrating facility layout design and aisle structure in manufacturing systems: formulation and exact solution ⋮ Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm ⋮ An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems

Cites Work

• Unnamed Item
• Unnamed Item
• Multiobjective programming and planning
• A nonlinear optimization approach for solving facility layout problems
• An interactive layout heuristic based on hexagonal adjacency graphs
• Genetic algorithms, function optimization, and facility layout design
• Optimal facility layout design
• An improved genetic algorithm for facility layout problems having inner structure walls and passages
• A Heuristic Procedure for the Layout of a Large Number of Facilities
• Assignment Problems and the Location of Economic Activities
• SHAPE: A construction algorithm for area placement evaluation
• A Cluster-Analytic Approach to Facility Layout
• A simulated annealing algorithm for allocating space to manufacturing cells
• A new simulated annealing algorithm for the facility layout problem
• Facility layout objective functions and robust layouts
• A genetic algorithm approach for multiple criteria facility layout design
• Static and Dynamic Layout Problems with Varying Areas
• An Improvement-Type Layout Algorithm for Single and Multiple-Floor Facilities

This page was built for publication: An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages