{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T13:55:55Z","timestamp":1775483755594,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T00:00:00Z","timestamp":1595548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T00:00:00Z","timestamp":1595548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/MAT\/00297\/2013"],"award-info":[{"award-number":["UID\/MAT\/00297\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science and Engineering Research Council","award":["Discovery Grant"],"award-info":[{"award-number":["Discovery Grant"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The facility layout problem is concerned with finding an arrangement of non-overlapping indivisible departments within a facility so as to minimize the total expected flow cost. In this paper we consider the special case of multi-row layout in which all the departments are to be placed in three or more rows, and our focus is on, for the first time, solutions for large instances. We first propose a new mixed integer linear programming formulation that uses continuous variables to represent the departments\u2019 location in both <jats:italic>x<\/jats:italic> and <jats:italic>y<\/jats:italic> coordinates, where <jats:italic>x<\/jats:italic> represents the position of a department within a row and <jats:italic>y<\/jats:italic> represents the row assigned to the department. We prove that this formulation always achieves an optimal solution with integer values of <jats:italic>y<\/jats:italic>, but it is limited to solving instances with up to 13 departments. This limitation motivates the application of a two-stage optimization algorithm that combines two mathematical optimization models by taking the output of the first-stage model as the input of the second-stage model. This algorithm is, to the best of our knowledge, the first one in the literature reporting solutions for instances with up to 100 departments.\n<\/jats:p>","DOI":"10.1007\/s11590-020-01621-z","type":"journal-article","created":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T16:02:52Z","timestamp":1595606572000},"page":"9-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Mathematical optimization approach for facility layout on several rows"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8258-9116","authenticated-orcid":false,"given":"Miguel F.","family":"Anjos","sequence":"first","affiliation":[]},{"given":"Manuel V. C.","family":"Vieira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,24]]},"reference":[{"issue":"1","key":"1621_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2008.06.002","volume":"157","author":"ARS Amaral","year":"2009","unstructured":"Amaral, A.R.S.: A new lower bound for the single row facility layout problem. Discrete Appl. Math. 157(1), 183\u2013190 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"1621_CR2","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11590-011-0426-8","volume":"7","author":"ARS Amaral","year":"2013","unstructured":"Amaral, A.R.S.: Optimal solutions for the double row layout problem. Optim. Lett. 7(2), 407\u2013413 (2013)","journal-title":"Optim. Lett."},{"issue":"1","key":"1621_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1080\/00207543.2018.1457811","volume":"57","author":"ARS Amaral","year":"2019","unstructured":"Amaral, A.R.S.: A mixed-integer programming formulation for the double row layout of machines in manufacturing systems. Int. J. Prod. Res. 57(1), 34\u201347 (2019)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"1621_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.disopt.2005.03.001","volume":"2","author":"MF Anjos","year":"2005","unstructured":"Anjos, M.F., Kennings, A., Vannelli, A.: A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discrete Optim. 2(2), 113\u2013122 (2005)","journal-title":"Discrete Optim."},{"issue":"1","key":"1621_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s001860200197","volume":"56","author":"MF Anjos","year":"2002","unstructured":"Anjos, M.F., Vannelli, A.: An attractor-repeller approach to floor planning. Math. Methods Oper. Res. 56(1), 3\u201327 (2002)","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"1621_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/ijoc.1040.0103","volume":"18","author":"MF Anjos","year":"2006","unstructured":"Anjos, M.F., Vannelli, A.: A new mathematical-programming framework for facility-layout design. INFORMS J. Comput. 18(1), 111\u2013118 (2006)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"1621_CR7","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/ijoc.1080.0270","volume":"20","author":"MF Anjos","year":"2008","unstructured":"Anjos, M.F., Vannelli, A.: Computing globally optimal solutions for single-row layout problems using semidefinite programmingand cutting planes. INFORMS J. Comput. 20(4), 611\u2013617 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"7","key":"1621_CR8","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1007\/s11590-016-1008-6","volume":"10","author":"MF Anjos","year":"2016","unstructured":"Anjos, M.F., Vieira, M.V.: An improved two-stage optimization-based framework for unequal-areas facility layout. Optim. Lett. 10(7), 1379\u20131392 (2016)","journal-title":"Optim. Lett."},{"issue":"1","key":"1621_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2017.01.049","volume":"261","author":"MF Anjos","year":"2017","unstructured":"Anjos, M.F., Vieira, M.V.C.: Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions. Eur. J. Oper. Res. 261(1), 1\u201316 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1621_CR10","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1080\/10556780902917735","volume":"24","author":"MF Anjos","year":"2009","unstructured":"Anjos, M.F., Yen, G.: Provably near-optimal solutions for very large single-row facility layout problems. Optim. Methods Softw. 24(4), 805\u2013817 (2009)","journal-title":"Optim. Methods Softw."},{"key":"1621_CR11","doi-asserted-by":"publisher","first-page":"106244","DOI":"10.1016\/j.cie.2019.106244","volume":"140","author":"J Chae","year":"2020","unstructured":"Chae, J., Regan, A.C.: A mixed integer programming model for a double row layout problem. Comput. Ind. Eng. 140, 106244 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"1621_CR12","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1080\/00207540802192126","volume":"48","author":"J Chung","year":"2010","unstructured":"Chung, J., Tanchoco, J.M.A.: The double row layout problem. Int. J. Prod. Res. 48(3), 709\u2013727 (2010)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"1621_CR13","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1016\/j.ejor.2020.04.010","volume":"286","author":"M Dahlbeck","year":"2020","unstructured":"Dahlbeck, M., Fischer, A., Fischer, F.: Decorous combinatorial lower bounds for row layout problems. Eur. J. Oper. Res. 286(3), 929\u2013944 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"1621_CR14","unstructured":"Etawil, H., Areibi, S., Vannelli, A.: Attractor-repeller approach for global placement. In: Proceedings of the 1999 IEEE\/ACM International Conference on Computer-Aided Design, pp. 20\u201324 (1999)"},{"issue":"4","key":"1621_CR15","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s12532-019-00162-6","volume":"11","author":"A Fischer","year":"2019","unstructured":"Fischer, A., Fischer, F., Hungerl\u00e4nder, P.: New exact approaches to row layout problems. Math. Program. Comput. 11(4), 703\u2013754 (2019)","journal-title":"Math. Program. Comput."},{"key":"1621_CR16","volume-title":"Genetic Algorithms and Engineering Design","author":"M Gen","year":"1997","unstructured":"Gen, M., Cheng, R.: Genetic Algorithms and Engineering Design. Wiley, New York (1997)"},{"issue":"20","key":"1621_CR17","doi-asserted-by":"publisher","first-page":"6506","DOI":"10.1080\/00207543.2019.1566673","volume":"57","author":"C Guan","year":"2019","unstructured":"Guan, C., Zhang, Z., Li, Y.: A flower pollination algorithm for the double-floor corridor allocation problem. Int. J. Prod. Res. 57(20), 6506\u20136527 (2019)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"1621_CR18","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/opre.36.2.258","volume":"36","author":"SS Heragu","year":"1988","unstructured":"Heragu, S.S., Kusiak, A.: Machine layout problem in flexible manufacturing systems. Oper. Res. 36(2), 258\u2013268 (1988)","journal-title":"Oper. Res."},{"issue":"1","key":"1621_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(91)90088-D","volume":"53","author":"SS Heragu","year":"1991","unstructured":"Heragu, S.S., Kusiak, A.: Efficient models for the facility layout problem. Eur. J. Oper. Res. 53(1), 1\u201313 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"1621_CR20","doi-asserted-by":"crossref","DOI":"10.1201\/9781420066272","volume-title":"Facilities Design","author":"SS Heragu","year":"2008","unstructured":"Heragu, S.S.: Facilities Design, 3rd edn. CRC Press, Boca Raton (2008)","edition":"3"},{"issue":"1\u20134","key":"1621_CR21","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s00170-017-0895-8","volume":"94","author":"H Hosseini-Nasab","year":"2018","unstructured":"Hosseini-Nasab, H., Fereidouni, S., Fatemi Ghomi, S.M.T., Fakhrzad, M.B.: Classification of facility layout problems: a review study. Int. J. Adv. Manuf. Technol. 94(1\u20134), 957\u2013977 (2018)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"1621_CR22","unstructured":"Hungerl\u00e4nder, P., Anjos, M.\u00a0F.: A Semidefinite Optimization Approach to Space-Free Multi-Row Facility Layout. Cahier du GERAD G-2012-03 (2012)"},{"issue":"1","key":"1621_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-012-9505-8","volume":"55","author":"P Hungerl\u00e4nder","year":"2013","unstructured":"Hungerl\u00e4nder, P., Rendl, F.: A computational study and survey of methods for the single-row facility layout problem. Comput. Optim. Appl. 55(1), 1\u201320 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1621_CR24","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ejor.2015.02.049","volume":"245","author":"P Hungerl\u00e4nder","year":"2015","unstructured":"Hungerl\u00e4nder, P., Anjos, M.F.: A semidefinite optimization-based approach for global optimization of multi-row facility layout. Eur. J. Oper. Res. 245(1), 46\u201361 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1621_CR25","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ejor.2011.04.013","volume":"214","author":"I Jankovits","year":"2011","unstructured":"Jankovits, I., Luo, C., Anjos, M.F., Vannelli, A.: A convex optimisation framework for the unequal-areas facility layout problem. Eur. J. Oper. Res. 214(2), 199\u2013215 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1621_CR26","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.ejor.2015.03.016","volume":"245","author":"B Keller","year":"2015","unstructured":"Keller, B., Buscher, U.: Single row layout models. Eur. J. Oper. Res. 245(3), 629\u2013644 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1621_CR27","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s12597-012-0091-4","volume":"49","author":"R Kothari","year":"2012","unstructured":"Kothari, R., Ghosh, D.: The single row facility layout problem: state of the art. Opsearch 49(4), 442\u2013462 (2012)","journal-title":"Opsearch"},{"issue":"4","key":"1621_CR28","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/s10878-008-9148-y","volume":"16","author":"C Luo","year":"2008","unstructured":"Luo, C., Anjos, M.F., Vannelli, A.: A nonlinear optimization methodology for VLSI fixed-outline floorplanning. J. Comb. Optim. 16(4), 378\u2013401 (2008)","journal-title":"J. Comb. Optim."},{"issue":"1\u20134","key":"1621_CR29","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00170-019-04190-3","volume":"105","author":"I Maganha","year":"2019","unstructured":"Maganha, I., Silva, C., Ferreira, L.M.D.F.: The layout design in reconfigurable manufacturing systems: a literature review. Int. J. Adv. Manuf. Technol. 105(1\u20134), 683\u2013700 (2019)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"1621_CR30","doi-asserted-by":"crossref","unstructured":"Nemhauser, G., Wolsey, L.: Integral polyhedra. In: Nemhauser, G., Wolsey, L. (eds.) Integer and Combinatorial Optimization (2014)","DOI":"10.1002\/9781118627372.ch14"},{"key":"1621_CR31","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.asoc.2017.09.003","volume":"61","author":"S Safarzadeh","year":"2017","unstructured":"Safarzadeh, S.: Koosha: Solving an extended multi-row facility layout problem with fuzzy clearances using GA. Appl Soft Comput 61, 819\u2013831 (2017)","journal-title":"Appl Soft Comput"},{"key":"1621_CR32","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s11590-018-1263-9","volume":"13","author":"LD Secchin","year":"2019","unstructured":"Secchin, L.D., Amaral, A.R.S.: An improved mixed-integer programming model for the double row layout of facilities. Optim. Lett. 13, 193\u2013199 (2019)","journal-title":"Optim. Lett."},{"issue":"5","key":"1621_CR33","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1287\/opre.17.5.812","volume":"17","author":"DM Simmons","year":"1969","unstructured":"Simmons, D.M.: One-dimensional space allocation: an ordering algorithm. Oper. Res. 17(5), 812\u2013826 (1969)","journal-title":"Oper. Res."},{"issue":"3","key":"1621_CR34","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1080\/01605682.2018.1556570","volume":"71","author":"X Yang","year":"2020","unstructured":"Yang, X., Cheng, W., Smith, A.E., Amaral, A.R.S.: An improved model for the parallel row ordering problem. J. Oper. Res. Soc. 71(3), 475\u2013490 (2020)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"1621_CR35","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00500-019-03925-4","volume":"24","author":"Z Zhang","year":"2020","unstructured":"Zhang, Z., Mao, L., Guan, C., Zhu, L., Wang, Y.: An improved scatter search algorithm for the corridor allocation problem considering corridor width. Soft. Comput. 24(1), 461\u2013481 (2020)","journal-title":"Soft. Comput."},{"issue":"15","key":"1621_CR36","doi-asserted-by":"publisher","first-page":"4220","DOI":"10.1080\/00207543.2011.603371","volume":"50","author":"Z Zhang","year":"2012","unstructured":"Zhang, Z., Murray, C.C.: A corrected formulation for the double row layout problem. Int. J. Prod. Res. 50(15), 4220\u20134223 (2012)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"1621_CR37","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/TASE.2018.2866377","volume":"16","author":"X Zuo","year":"2019","unstructured":"Zuo, X., Gao, S., Zhou, M., Yang, X., Zhao, X.: A three-stage approach to a multirow parallel machine layout problem. IEEE Trans. Autom. Sci. Eng. 16(1), 433\u2013447 (2019)","journal-title":"IEEE Trans. Autom. Sci. Eng."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01621-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01621-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01621-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T23:37:39Z","timestamp":1627083459000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01621-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,24]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["1621"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01621-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,24]]},"assertion":[{"value":"12 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}