Abstract
This study proposes an improved genetic algorithm (GA) to derive solutions for facility layout problems hang inner walls and passages. πle proposed algorithm models the layout of facilities on a foursegmented chromosome. Improved solutions are produced by employing genetic operations known as selection, crossover, inversion, mutation, and refmement of these genes for successive generations. All relionships between the facilities and passages are represented as an acency graph. The shortest path and distance between two facilities are calculated using Dijkstra’s algorithm of graph theory. Comparative testing shows that the proposed algorithm performs better than other existing algorithm for the optimal facility layout design. Finally, the proposed algorithm is applied to ship compartment layout problems with the computational results compared to actual ship comptment layout.
