{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T16:48:48Z","timestamp":1779122928532,"version":"3.51.4"},"reference-count":22,"publisher":"EDP Sciences","issue":"2","license":[{"start":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T00:00:00Z","timestamp":1710201600000},"content-version":"vor","delay-in-days":11,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2024,1,22]]},"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:p>The India-Japan Lighting company operates three plants in India. These three plants manufacture headlamps and taillights for the automotive industry. This study examines the facility location problem in one of these plants where 12 facilities must be placed in a two-column multi-row cellular layout. The machining sequences for the 20 parts conveyed among the 12 facilities were specified. The Quadratic Assignment Problem (QAP) is classified as an NP-hard problem in large instances. We modelled the specific instance as a QAP and reported the solution obtained by an easily available generalised reduced gradient (GRG) nonlinear solver and the solution obtained from the <jats:italic>Gurobi<\/jats:italic> optimiser. The <jats:italic>Gurobi<\/jats:italic> optimiser provides an excellent incumbent solution in quick time, but takes exponential time to reduce the duality gap.<\/jats:p>","DOI":"10.1051\/ro\/2024018","type":"journal-article","created":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T19:57:35Z","timestamp":1706039855000},"page":"1105-1114","source":"Crossref","is-referenced-by-count":1,"title":["Solving a real world non-convex Quadratic Assignment Problem"],"prefix":"10.1051","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9667-7339","authenticated-orcid":false,"given":"Badri","family":"Toppur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2024,3,12]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1051\/ro\/1978120202331","volume":"12","author":"Abadie","year":"1978","journal-title":"RAIRO: Recherche Op\u00e9rationalle"},{"key":"R2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.disopt.2014.07.001","volume":"14","author":"Adams","year":"2014","journal-title":"Discrete Optim"},{"key":"R3","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0305-0483(97)00078-9","volume":"26","author":"Balakrishnan","year":"1998","journal-title":"Omega \u2013 Int. J. Manage. Sci"},{"key":"R4","unstructured":"Bazaraa M.S., The quadratic set covering (assignment) problem: applications and computation. Technical Report GK-38337, National Science Foundation (1975)."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Bazaraa M.S., Sherali H.D. and Shetty C.M., Non-linear Programming \u2013 Theory and Algorithms. Wiley-Interscience (2006).","DOI":"10.1002\/0471787779"},{"key":"R6","doi-asserted-by":"crossref","first-page":"100612","DOI":"10.1016\/j.disopt.2020.100612","volume":"64","author":"Brosch","year":"2022","journal-title":"Discrete Optim"},{"key":"R7","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"Burkard","year":"1997","journal-title":"J. Global Optim"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Burkard R., Dell\u2019Amico M. and Martello S., Assignment Problems. Revised reprint. SIAM \u2013 Society of Industrial and Applied Mathematics, Seiten (2012) 393.","DOI":"10.1137\/1.9781611972238"},{"key":"R9","doi-asserted-by":"crossref","first-page":"102952","DOI":"10.1016\/j.jobe.2021.102952","volume":"44","author":"Cubukcuoglu","year":"2021","journal-title":"J. Build. Eng"},{"key":"R10","doi-asserted-by":"crossref","first-page":"389","DOI":"10.3182\/20060517-3-FR-2903.00208","volume":"39","author":"Drira","year":"2006","journal-title":"IFAC Proc. Vol"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Finke G., Burkard R.E. and Rendl F., Quadratic assignment problems, in Surveys in Combinatorial Optimization. Vol. 132 of North-Holland Mathematics Studies, edited by Martello S., Laporte G., Minoux M. and Ribeiro C.. North-Holland (1987) 61\u201382.","DOI":"10.1016\/S0304-0208(08)73232-8"},{"key":"R12","first-page":"221","volume":"18","author":"Fu","year":"2022","journal-title":"Transp. A: Transp. Sci"},{"key":"R13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"Garey","year":"1976","journal-title":"Math. Oper. Res"},{"key":"R14","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10589-007-9093-1","volume":"40","author":"Hahn","year":"2008","journal-title":"Comput. Optim. App"},{"key":"R15","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/s12597-012-0091-4","volume":"49","author":"Kothari","year":"2012","journal-title":"OPSEARCH"},{"key":"R16","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/355769.355773","volume":"4","author":"Lasdon","year":"1978","journal-title":"ACM Trans. Math. Softw"},{"key":"R17","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"Lawler","year":"1963","journal-title":"Manage. Sci"},{"key":"R18","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1016\/j.proeng.2014.12.334","volume":"97","author":"Prasad","year":"2014","journal-title":"Proc. Eng"},{"key":"R19","unstructured":"Rockafellar R.T., Convex Analysis: Princeton Landmarks in Mathematics and Physics. Princeton University Press (1970)."},{"key":"R20","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1287\/mnsc.32.1.76","volume":"32","author":"Rosenblatt","year":"1986","journal-title":"Manage. Sci"},{"key":"R21","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1051\/ro\/2018077","volume":"53","author":"Tari","year":"2019","journal-title":"RAIRO: Oper. Res"},{"key":"R22","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.trb.2021.08.008","volume":"152","author":"Wu","year":"2021","journal-title":"Transp. Res. Part B: Methodol"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024018\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T09:10:59Z","timestamp":1710234659000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":22,"journal-issue":{"issue":"2"},"alternative-id":["ro220543"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2024018","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}