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

• Published in: Computers & operations research 2005-04, Vol.32 (4), p.879-899
• Main Authors: Lee, Kyu-Yeul, Roh, Myung-Il, Jeong, Hyuk-Su
• Format: Article
• Language: English
• Subjects: Adjacency relationship; Applied sciences; Dijkstra's algorithm; Exact sciences and technology; Facilities planning; Flows in networks. Combinatorial problems; Genetic algorithm; Genetic algorithms; Graph theory; Inner structure wall; Multi-floor facility layout problem; Operational research and scientific management; Operational research. Management science; Passage; Ship multi-deck compartment layout problem; Ships; Studies
• ISSN: 0305-0548; 1873-765X; 0305-0548
• DOI: 10.1016/j.cor.2003.09.004

This study proposes an improved genetic algorithm to derive solutions for multi-floor facility layouts that are to have inner structure walls and passages. The proposed algorithm models the multi-floor layout of facilities on gene structures. These gene structures consist of a five-segmented chromosome. Improved solutions are produced by employing genetic operations known as selection, crossover, inversion, mutation, and refinement of these genes for successive generations. All relationships between the facilities, passages, and lifts are represented as an adjacency graph. The shortest path and distance between two facilities is calculated using Dijkstra's algorithm of the graph theory. Comparative testing shows that the proposed algorithm performs better than other existing algorithm for the multi-floor facility layout design. Finally, the proposed algorithm is applied to the multi-deck compartment layout problem of the ship with the computational result compared with the multi-deck compartment layout of the actual ship.