|
|||||
|
|
Single row facility layout problem using a permutation-based genetic algorithm |
|
| Authors: | Dilip Datta André RS Amaral |
| Institution: | a Department of Mechanical Engineering, National Institute of Technology-Silchar, Silchar 788 010, India b CEG-IST, Center for Management Studies, Instituto Superior Técnico, Technical University of Lisbon, Tagus Park, Av. Cavaco Silva, 2744-016 Porto Salvo, Portugal c INPL, Ecole des Mines de Nancy, Laboratoire LORIA, Parc de Saurupt CS 14 234, 54 042 Nancy Cedex, France |
| Abstract: | In this paper, a permutation-based genetic algorithm (GA) is applied to the NP-hard problem of arranging a number of facilities on a line with minimum cost, known as the single row facility layout problem (SRFLP). The GA individuals are obtained by using some rule-based as well as random permutations of the facilities, which are then improved towards the optimum by means of specially designed crossover and mutation operators. Such schemes led the GA to handle the SRFLP as an unconstrained optimization problem. In the computational experiments carried out with large-size instances of sizes from 60 to 80, available in the literature, the proposed GA improved several previously known best solutions. |
| Keywords: | Single row facility layout problem Genetic algorithm Combinatorial optimization |
| 本文献已被 ScienceDirect 等数据库收录！ | |