An improved genetic algorithm for facility layout problems having inner structure walls and passages
DOI10.1016/S0305-0548(01)00085-5zbMath1029.90080OpenAlexW2079117745WikidataQ58835075 ScholiaQ58835075MaRDI QIDQ1869891
Seong-Nam Han, Kyu-Yeul Lee, Myung-Il Roh
Publication date: 28 April 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00085-5
genetic algorithmDijkstra's algorithmpassageFacility layout probleminner structure wallship compartment layout problem
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Discrete location and assignment (90B80)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An interactive layout heuristic based on hexagonal adjacency graphs
- Genetic algorithms, function optimization, and facility layout design
- 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
- A genetic algorithm approach for multiple criteria facility layout design
- An Improvement-Type Layout Algorithm for Single and Multiple-Floor Facilities
This page was built for publication: An improved genetic algorithm for facility layout problems having inner structure walls and passages