{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,31]],"date-time":"2026-08-31T17:43:50Z","timestamp":1788198230933,"version":"build-2803163510"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,3]],"date-time":"2013-12-03T00:00:00Z","timestamp":1386028800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10732-013-9234-x","type":"journal-article","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T11:42:03Z","timestamp":1385984523000},"page":"125-142","source":"Crossref","is-referenced-by-count":55,"title":["A scatter search algorithm for the single row facility layout problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Ravi","family":"Kothari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Diptesh","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,12,3]]},"reference":[{"issue":"2","key":"9234_CR1","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1016\/j.ejor.2004.12.021","volume":"173","author":"ARS Amaral","year":"2006","unstructured":"Amaral, A.R.S.: On the exact solution of a facility layout problem. Eur. J. Oper. Res. 173(2), 508\u2013518 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9234_CR2","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1287\/opre.1080.0548","volume":"56","author":"ARS Amaral","year":"2008","unstructured":"Amaral, A.R.S.: An exact approach to the one-dimensional facility layout problem. Oper. Res. 56(4), 1026\u20131033 (2008)","journal-title":"Oper. Res."},{"issue":"1","key":"9234_CR3","doi-asserted-by":"crossref","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. Discret. Appl. Math. 157(1), 183\u2013190 (2009)","journal-title":"Discret. Appl. Math."},{"key":"9234_CR4","doi-asserted-by":"crossref","unstructured":"Amaral, A.R.S., Letchford, A. N.: A polyhedral approach to the single row facility layout problem. Math. Programm. doi: 10.1007\/s10107-012-0533-z (2012)","DOI":"10.1007\/s10107-012-0533-z"},{"issue":"12","key":"9234_CR5","doi-asserted-by":"crossref","first-page":"3325","DOI":"10.1016\/j.cor.2012.04.016","volume":"39","author":"ARS Amaral","year":"2012","unstructured":"Amaral, A.R.S.: The corridor allocation problem. Comput. Oper. Res. 39(12), 3325\u20133330 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9234_CR6","doi-asserted-by":"crossref","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. Discret. Optim. 2(2), 113\u2013122 (2005)","journal-title":"Discret. Optim."},{"key":"9234_CR7","doi-asserted-by":"crossref","unstructured":"Anjos, M.F., Liers, F.: Handbook on Semidefinite, Cone and Polynomial Optimization, volume 166 of International Series in Operations Research & Management Science, chapter Global Approaches for Facility Layout and VLSI Floorplanning, pp. 849\u2013877. Springer, Berlin (2012)","DOI":"10.1007\/978-1-4614-0769-0_29"},{"issue":"4","key":"9234_CR8","doi-asserted-by":"crossref","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 programming and cutting planes. Inf. J. Comput. 20(4), 611\u2013617 (2008)","journal-title":"Inf. J. Comput."},{"issue":"4\u20135","key":"9234_CR9","doi-asserted-by":"crossref","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\u20135), 805\u2013817 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9234_CR10","first-page":"263","volume":"16","author":"M Beghin-Picavet","year":"1982","unstructured":"Beghin-Picavet, M., Hansen, P.: Deux probl\u00e8mes daffectation non lin\u00e9aires. RAIRO Recherche Op\u00e9rationnelle 16(3), 263\u2013276 (1982)","journal-title":"RAIRO Recherche Op\u00e9rationnelle"},{"issue":"3","key":"9234_CR11","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1080\/00207540802192126","volume":"48","author":"J Chung","year":"2010","unstructured":"Chung, J., Tanchoco, J.: The double row layout problem. Int. J. Prod. Res. 48(3), 709\u2013727 (2010)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"9234_CR12","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/j.ejor.2011.03.034","volume":"213","author":"D Datta","year":"2011","unstructured":"Datta, D., Amaral, A.R.S., Figueira, J.R.: Single row facility layout problem using a permutation-based genetic algorithm. Eur. J. Oper. Res. 213(2), 388\u2013394 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9234_CR13","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1080\/09511920010020721","volume":"14","author":"H Djellab","year":"2001","unstructured":"Djellab, H., Gourgand, M.: A new heuristic procedure for the single-row facility layout problem. Int. J. Comput. Integr. Manuf. 14(3), 270\u2013280 (2001)","journal-title":"Int. J. Comput. Integr. Manuf."},{"issue":"1","key":"9234_CR14","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156\u2013166 (1977)","journal-title":"Decis. Sci."},{"key":"9234_CR15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(94)90211-9","volume":"49","author":"F Glover","year":"1994","unstructured":"Glover, F.: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discret. Appl. Math. 49, 231\u2013255 (1994)","journal-title":"Discret. Appl. Math."},{"key":"9234_CR16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01719256","volume":"17","author":"F Glover","year":"1995","unstructured":"Glover, F.: Scatter search and star-paths: beyond the genetic metaphor. OR Spectr. 17, 125\u2013137 (1995). doi: 10.1007\/BF01719256","journal-title":"OR Spectr."},{"key":"9234_CR17","first-page":"13","volume":"1363","author":"F Glover","year":"1998","unstructured":"Glover, F.: A template for scatter search and path relinking. Lect. Notes Comput. Sci. 1363, 13\u201354 (1998)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9234_CR18","first-page":"653","volume":"39","author":"F Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path relinking. Control Cybern. 39, 653\u2013684 (2000)","journal-title":"Control Cybern."},{"key":"9234_CR19","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/A:1008982420344","volume":"11","author":"A Gomes de Alvarenga","year":"2000","unstructured":"Gomes de Alvarenga, A., Negreiros-Gomes, F.J., Mestria, M.: Metaheuristic methods for a class of the facility layout problem. J. Intell. Manuf. 11, 421\u2013430 (2000)","journal-title":"J. Intell. Manuf."},{"issue":"2","key":"9234_CR20","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0377-2217(92)90042-8","volume":"57","author":"SS Heragu","year":"1992","unstructured":"Heragu, S.S., Alfa, A.S.: Experimental analysis of simulated annealing based algorithms for the layout problem. Eur. J. Oper. Res. 57(2), 190\u2013202 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9234_CR21","doi-asserted-by":"crossref","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."},{"key":"9234_CR22","doi-asserted-by":"crossref","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\u201313 (1991)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9234_CR23","doi-asserted-by":"crossref","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."},{"key":"9234_CR24","unstructured":"Kothari, R., Ghosh, D.: Path relinking algorithms for single row facility layout (w.p. no. 2012\u201305-01). Ahmedabad, India: IIM Ahmedabad, Production & Quantitative Methods. Available at (2012a) http:\/\/www.iimahd.ernet.in\/assets\/snippets\/workingpaperpdf\/6038336162012-05-01.pdf"},{"key":"9234_CR25","doi-asserted-by":"crossref","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, 442\u2013462 (2012b)","journal-title":"Opsearch"},{"key":"9234_CR26","doi-asserted-by":"crossref","unstructured":"Kothari, R., Ghosh, D.: An efficient genetic algorithm for single row facility layout. Optim. Lett. 10.1007\/s11590-012-0605-2 (2013a)","DOI":"10.1007\/s11590-012-0605-2"},{"issue":"1","key":"9234_CR27","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.cor.2012.05.017","volume":"40","author":"R Kothari","year":"2013","unstructured":"Kothari, R., Ghosh, D.: Insertion based Lin\u2013Kernighan heuristic for single row facility layout. Comput. Oper. Res. 40(1), 129\u2013136 (2013b)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9234_CR28","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ejor.2012.07.037","volume":"224","author":"R Kothari","year":"2013","unstructured":"Kothari, R., Ghosh, D.: Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods. Eur. J. Oper. Res. 224(1), 93\u2013100 (2013c)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9234_CR29","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(94)00062-H","volume":"87","author":"RK Kumar","year":"1995","unstructured":"Kumar, R.K., Hadjinicola, G.C., Lin, T.-L.: A heuristic procedure for the single-row facility layout problem. Eur. J. Oper. Res. 87(1), 65\u201373 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9234_CR30","first-page":"193","volume":"3","author":"S Kumar","year":"2008","unstructured":"Kumar, S., Asokan, P., Kumanan, S., Varma, B.: Scatter search algorithm for single row layout problem in fms. Adv. Prod. Eng. Manag. 3(4), 193\u2013204 (2008)","journal-title":"Adv. Prod. Eng. Manag."},{"key":"9234_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter Search: Methodology and Implementations in C","author":"M Laguna","year":"2003","unstructured":"Laguna, M., Mart\u00ed, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic Publishers, Boston (2003)"},{"issue":"2","key":"9234_CR32","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larra\u00f1aga","year":"1999","unstructured":"Larra\u00f1aga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif. Intell. Rev. 13(2), 129\u2013170 (1999)","journal-title":"Artif. Intell. Rev."},{"key":"9234_CR33","unstructured":"Letchford, A.N., Amaral, A.R.S.: A polyhedral approach to the single row facility layout problem. Technical report, The Department of Management Science, Lancaster University, (2011)"},{"issue":"2","key":"9234_CR34","first-page":"139","volume":"14","author":"RF Love","year":"1976","unstructured":"Love, R.F., Wong, J.Y.: On solving a one-dimensional space allocation problem with integer programming. INFOR 14(2), 139\u2013144 (1976)","journal-title":"INFOR"},{"issue":"2","key":"9234_CR35","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.ejor.2004.08.004","volume":"169","author":"R Mart\u00ed","year":"2006","unstructured":"Mart\u00ed, R., Glover, F., Laguna, M.: Principles of scatter search. Eur. J. Oper. Res. 169(2), 359\u2013372 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9234_CR36","doi-asserted-by":"crossref","unstructured":"Ozcelik, F.: A hybrid genetic algorithm for the single row layout problem. Int. J. Prod. Res. (2011)","DOI":"10.1080\/00207540903496673"},{"issue":"2","key":"9234_CR37","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1287\/opre.29.2.371","volume":"29","author":"J-C Picard","year":"1981","unstructured":"Picard, J.-C., Queyranne, M.: On the one-dimensional space allocation problem. Oper. Res. 29(2), 371\u2013391 (1981)","journal-title":"Oper. Res."},{"issue":"5","key":"9234_CR38","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0305-0548(90)90051-8","volume":"17","author":"D Romero","year":"1990","unstructured":"Romero, D., S\u00e1nchez-Flores, A.: Methods for the one-dimensional space allocation problem. Comput. Oper. Res. 17(5), 465\u2013473 (1990)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9234_CR39","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ejor.2009.11.034","volume":"205","author":"H Samarghandi","year":"2010","unstructured":"Samarghandi, H., Eshghi, K.: An efficient tabu algorithm for the single row facility layout problem. Eur. J. Oper. Res. 205(1), 98\u2013105 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9234_CR40","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.cie.2009.11.015","volume":"58","author":"H Samarghandi","year":"2010","unstructured":"Samarghandi, H., Taabayan, P., Jahantigh, F.F.: A particle swarm optimization for the single row facility layout problem. Comput. Ind. Eng. 58(4), 529\u2013534 (2010)","journal-title":"Comput. Ind. Eng."},{"issue":"16","key":"9234_CR41","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1016\/j.dam.2010.07.005","volume":"158","author":"S Sanjeevi","year":"2010","unstructured":"Sanjeevi, S., Kianfar, K.: A polyhedral study of triplet formulation for single row facility layout problem. Discret. Appl. Math. 158(16), 1861\u20131867 (2010)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"9234_CR42","doi-asserted-by":"crossref","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":"9234_CR43","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.cor.2003.08.005","volume":"32","author":"M Solimanpur","year":"2005","unstructured":"Solimanpur, M., Vrat, P., Shankar, R.: An ant algorithm for the single row layout problem in flexible manufacturing systems. Comput. Oper. Res. 32(3), 583\u2013598 (2005)","journal-title":"Comput. Oper. Res."},{"key":"9234_CR44","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10732-006-9001-3","volume":"13","author":"K S\u00f6rensen","year":"2007","unstructured":"S\u00f6rensen, K.: Distance measures based on the edit distance for permutation-type representations. J. Heuristics 13, 35\u201347 (2007). doi: 10.1007\/s10732-006-9001-3","journal-title":"J. Heuristics"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9234-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-013-9234-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9234-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T09:37:43Z","timestamp":1564911463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-013-9234-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,3]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9234"],"URL":"https:\/\/doi.org\/10.1007\/s10732-013-9234-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,3]]}}}