An improved genetic algorithm for facility layout problems having inner structure walls and passages
Computers and Operations Research
Hi-index | 0.00 |
Facility layout problems concerning space layout optimization have been investigated in depth by researchers in many engineering fields. In this paper, a particular facility layout problem with aisles and two objectives at minimizing total cost of material handling and maximizing adjacent requirement between resources is discussed and formulated as an nonlinear mixed-integer programming. To solve the NP-hard problem, a multiple objective genetic algorithm approach with local search method is developed. The application on a practical FLP case and numerical analysis show the effectiveness and efficiency of the proposed method on FLPs.