Optimization of control parameters for genetic algorithms
IEEE Transactions on Systems, Man and Cybernetics
A heuristic procedure for the layout of a large number of facilities
Management Science
Algorithmic graph theory
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Operations Research
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Computers and Industrial Engineering
A genetic algorithm approach on a facility layout design problem with aisles
ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
A genetic algorithm with the heuristic procedure to solve the multi-line layout problem
Computers and Industrial Engineering
Integrated and interactive method for solving layout optimization problems
Expert Systems with Applications: An International Journal
Hi-index | 0.02 |
This study proposes an improved genetic algorithm (GA) to derive solutions for facility layouts that are to have inner walls and passages. The proposed algorithm models the layout of facilities on gene structures. These gene structures consist of a four-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 and passages are represented as an adjacency graph. The shortest path and distance between two facilities is calculated using Dijkstra's algorithm of graph theory. Comparative testing shows that the proposed algorithm performs better than other existing algorithms for the optimal facility layout design. Finally, the proposed algorithm is applied to ship compartment layout problems with the computational results compared with an actual ship compartment layout.