JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Two-Phase Genetic Algorithm for Solving the Paired Single Row Facility Layout Problem
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Two-Phase Genetic Algorithm for Solving the Paired Single Row Facility Layout Problem
Parwananta, Hutama; Maghfiroh, Meilinda F.N.; Yu, Vincent F.;
  PDF(new window)
 Abstract
This paper proposes a two-phase genetic algorithm (GA) to solve the problem of obtaining an optimum configuration of a paired single row assembly line. We pair two single-row assembly lines due to the shared usage of several workstations, thus obtaining an optimum configuration by considering the material flow of the two rows simultaneously. The problem deals with assigning workstations to a sequence and selecting the best arrangement by looking at the length and width for each workstation. This can be considered as an enhancement of the single row facility layout problem (SRFLP), or the so-called paired SRFLP (PSRFLP). The objective of this PSRFLP is to find an optimal configuration that seeks to minimize the distance traveled by the material handler and even the use of the material handler itself if this is possible. Real-world applications of such a problem can be found for apparel, shoe, and other manual assembly lines. This research produces the schematic representation solution using the heuristic approach. The crossover and mutation will be utilized using the schematic representation solution to obtain the neighborhood solutions. The first phase of the GA result is recorded to get the best pair. Based on these best matched pairs, the second-phase GA can commence.
 Keywords
Layout Problem;Paired Assembly Line;Material Handler;Genetic Algorithm;
 Language
English
 Cited by
 References
1.
Al-Hakim, L. (2000), On solving facility layout problems using genetic algorithms, International Journal of Production Research, 38(11), 2573-2582. crossref(new window)

2.
Ariafar, S. and Ismail, N. (2009), An improved algorithm for layout design in cellular manufacturing systems, Journal Manufacturing Systems, 28(4), 132-139. crossref(new window)

3.
Braglia, M. (1996), Optimization of a simulated-annealingbased heuristic for single row machine layout problem by genetic algorithm, International Transaction in Operation Research, 1(3), 37-49.

4.
Datta, D., Amaral, A. R. S., and Figueira, J. R. (2011), Single row facility layout problem using a permutation-based genetic algorithm, European Journal of Operational Research, 213(2), 388-394. crossref(new window)

5.
Dimopoulos, C. and Zalzala, A. M. S. (2000), Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons, IEEE Transactions on Evolutionary Computation, 4(2), 93-113. crossref(new window)

6.
Drira, A., Pierreval, H., and Hajri-Gabouj, S. (2007), Facility layout problems: a survey, Annual Reviews in Control, 31(2), 255-267. crossref(new window)

7.
Golberg, D. E.(1989), Genetic algorithms in search, optimization, and machine learning, Addison-Wesley Longman Publishing Co., Inc.

8.
Hani, Y., Amodeo, L., Yalaoui, F., and Chen, H. (2007), Ant colony optimization for solving an industrial layout problem, European Journal of Operational Research, 183(2), 633-642. crossref(new window)

9.
Heragu, S. S. and Kusiak, A. (1987), The facility layout problem, European Journal of Operational Research, 29(3), 229-251. crossref(new window)

10.
Heragu, S. S. and Kusiak, A. (1991), Efficient models for the facility layout problem, European Journal of Operational Research, 53(1), 1-13. crossref(new window)

11.
Kochhar, J. S. and Heragu, S. S. (1999), Facility layout design in a changing environment, International Journal of Production Research, 37(11), 2429-2446. crossref(new window)

12.
Mir, M. and Imam, M. H. (2001), A hybrid optimization approach for layout design of unequal-area facilities, Computer & Industrial Engineering, 39(1-2), 49-63. crossref(new window)

13.
Parwananta, H., Maghfiroh, M., and Yu, V. F. (2012), Genetic algorithm for solving paired single row facility layout problem, Proceedings of the Asia Pacific Industrial Engineering & Management Systems Conference, Phuket, Thailand, 151-159.

14.
Picard, J. C. and Queyranne, M. (1981), On the onedimensional space allocation problem, Operations Research, 29(2), 371-391. crossref(new window)

15.
Samarghandi, H. and Eshghi, K. (2010), An efficient tabu algorithm for the single row facility layout problem, European Journal of Operational Research, 205(1), 98-105. crossref(new window)

16.
Samarghandi, H., Taabayan, P., and Jahantigh, F. F. (2010), A particle swarm optimization for the single row facility layout problem, Computer & Industrial Engineering, 58(4), 529-534. crossref(new window)

17.
Sadrzadeh, A. (2012), A genetic algorithm with the heuristic procedure to solve the multi-line layout problem, Computers & Industrial Engineering, 62(4), 1055-1064. crossref(new window)

18.
Solimanpur, M. and Jafari, A. (2008), Optimal solution for the two-dimensional facility layout problem using a branch-and-bound algorithm, Computers & Industrial Engineering, 55(3), 606-619. crossref(new window)

19.
Tam, K. Y. (1992a), A simulated annealing algorithm for allocating space to manufacturing cells, International Journal of Production Research, 30(1), 63-87. crossref(new window)

20.
Tam, K. Y. (1992b), Genetic algorithms, function optimization, and facility layout design, European Journal of Operational Research, 63(2), 322-346. crossref(new window)