Abstract
The single-row facility layout problem (SRFLP), which deals with the placement of some facilities along a row by minimizing the overall material flow cost among them, is usually studied as an unconstrained problem allowing the placement of the facilities arbitrarily without any restriction. But a practical SRFLP instance may require to respect certain constraints imposed on the arrangement of its facilities. Such an SRFLP model, which can be termed as a constrained SRFLP (cSRFLP), is studied here by requiring to place some facilities in fixed locations, and/or in predefined orders with/without allowing the arrangement of any other facility in between two ordered facilities. The handling of such a complex problem generally requires a specialized algorithm incorporating some problem-specific information for intelligent search. But the development of an algorithm needs expertise, from which practitioners often suffer. Hence, it is shown here how the cSRFLP can be tackled using a general-purpose algorithm with some repairing mechanisms outside the algorithm for forcibly satisfying the constraints of the problem. Employing a permutation-based genetic algorithm for this purpose, the potentiality of the proposed procedure is demonstrated by applying it to a set of cSRFLP instances of different sizes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Amaral ARS (2006) On the exact solution of a facility layout problem. Eur J Oper Res 173:508–518
Anjos MF, Kennings A, Vannelli A (2005) A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discrete Optim 2:113–122
Anjos MF, Vannelli A (2008) Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes. INFORMS J Comput 20:611–617
Benjaafar S, Ramakrishnan R (1996) Modelling, measurement and evaluation of sequencing flexibility in manufacturing systems. Int J Prod Res 34(5):1195–1220
Datta D, Amaral ARS, Figueira JR (2011) Single row facility layout problem using a permutation-based genetic algorithm. Eur J Oper Res 213(2):388–394
de Alvarenga AG, Negreiros-Gomes FJ, Mestria M (2000) Metaheuristic methods for a class of the facility layout problem. J Intell Manuf 11:421–430
Deb, K. (2001). Multi-objective optimization using evolutionary algorithms. Wiley, Chichester
Deb K, Agarwal S, Pratap A, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197
Gapp W, Mankekar PS, Mitten LG (1965) Sequencing operations to minimize in-process inventory costs. Manage Sci 11(3):476–484
Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, New Jersey
Heragu SS, Alfa AS (1992) Experiment Analysis of simulated annealing based algorithms for the layout problem. Eur J Oper Res 57(2):190–202
Heragu SS, Kusiak A (1988) Machine layout problem in flexible manufacturing systems. Oper Res 36:258–268
Heragu SS, Kusiak A (1991) Efficient models for the facility layout problem. Eur J Oper Res 53:1–13
Huang J, Lu X, Zhang G, Qu J (2014) Study on the rheological, thermal and mechanical properties of thermoplastic polyurethane/poly (butylene terephthalate) blends. Polym Test 36:69–74
Kalita Z, Datta D (2014) Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm. Comput Oper Res 52:123–134
Kothari R, Ghosh D (2014) A scatter search algorithm for the single row facility layout problem. J Heuristics 20(2):125–142
Kumar KR, Hadjinicola GC, Lin TL (1995) A heuristic procedure for the single-row facility layout problem. Eur J Oper Res 87:65–73
Kumar S, Asokan P, Kumanan S, Varma B (2008) Scatter search algorithm for single row layout problem in FMS. Adv Prod Eng Manag 3:193–204
Lafou M, Mathieu L, Pois S, Alochet M (2016) Manufacturing system flexibility: sequence flexibility assessment. In: 49th CIRP Conference on Manufacturing System (CIRP CMS2016), Stuttgart
Love RF, Wong JY (1976) On solving a single row space allocation problem with integer programming. INFOR 14:139–143
Monma CL (1981) Sequencing with general precedence constraints. Discrete Appl Math 3(2):137–150
Ozgormus E (2015) Optimization of block layout for grocery stores. PhD thesis, Auburn University, USA
Padgaonkar AS (2004) Modelling and analysis of the hospital facility layout problem. Master’s thesis, Department of Industrial and Manufacturing Engineering, New Jersey Institute of Technology, New Jersey
Picard J, Queyranne M (1981) On the one dimensional space allocation problem. Oper Res 29(2):371–391
Rachamadugu R, Nandkeolyar U, Schriber T (1993) Scheduling with sequencing flexibility. Decis Sci 24(2):315–342
Rachamadugu R, Schriber TJ (1990) Performance of dispatching rules under perfect sequencing flexibility. In: 22nd conference on winter simulation. IEEE Press, Piscataway, pp 653–658
Samarghandi H, Eshghi K (2010) An efficient tabu algorithm for the single row facility layout problem. Eur J Oper Res 205:98–105
Samarghandi H, Taabayan P, Jahantigh FF (2010) A particle swarm optimization for the single row facility layout problem. Comput Ind Eng 58:529–534
Simmons DM (1969) Single row space allocation: an ordering algorithm. Oper Res 17(5):812–826
Solimanpur M, Vrat P, Shankar R (2005) An ant algorithm for the single row layout problem in flexible manufacturing systems. Comput Oper Res 32:583–598
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Kalita, Z., Datta, D. (2020). The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms. In: Bennis, F., Bhattacharjya, R. (eds) Nature-Inspired Methods for Metaheuristics Optimization. Modeling and Optimization in Science and Technologies, vol 16. Springer, Cham. https://doi.org/10.1007/978-3-030-26458-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-030-26458-1_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26457-4
Online ISBN: 978-3-030-26458-1
eBook Packages: EngineeringEngineering (R0)