1. Solving a real world non-convex Quadratic Assignment Problem.
- Author
-
Toppur, Badri
- Subjects
QUADRATIC assignment problem ,NP-hard problems ,MANUFACTURING cells ,FACTORIES - Abstract
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 Gurobi optimiser. The Gurobi optimiser provides an excellent incumbent solution in quick time, but takes exponential time to reduce the duality gap. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF