Solving a Real-World Non-convex Quadratic Assignment Problem

Badri Toppur ()
Additional contact information
Badri Toppur: Rajalakshmi School of Business

Chapter Chapter 3 in Applications of Operational Research in Business and Industries, 2023, pp 35-48 from Springer

Abstract: Abstract A manufacturing company has three plants, in India. They manufacture headlamps and tail-lights for the automotive industry. This paper looks at the facility location problem for one of the plants where 12 facilities have to be placed in a two-column, multi-row, cellular layout. The machining sequence for 20 parts conveyed amongst the 12 facilities is specified. The quadratic assignment problem (QAP) has been classified, as an NP-Hard problem for large instances. We have modelled the specific instance as a QAP and are reporting on the solution, obtained by an easily available generalized reduced gradient (GRG) nonlinear solver, and also the solution obtained from the fast Gurobi optimizer. The Gurobi optimizer gives evidence of global optimality, that the GRG solver does not.

Keywords: Facility layout; Quadratic assignment problem; Non-convex objective; Case study; Nonlinear solvers; 90B90; 90C90 (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-981-19-8012-1_3

Ordering information: This item can be ordered from
http://www.springer.com/9789811980121

DOI: 10.1007/978-981-19-8012-1_3

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().