Abstract
In this paper, a general model has been formulated for facility location. The proposed model allows for locating several facilities in a single location, and as such, it is therefore a generalisation of the well-known quadratic assignment problem (QAP) and other variants. The general model has a wide range of applications in facility location, operations research and business. A branch-and-bound algorithm is developed for the generalised quadratic semi-assignment problem (GQSAP), which is a special form of the general model. The branch-and-bound algorithm is based on a modified version of the wellknown Gilmore bound. Computational results are presented to corroborate the theoretical model developed here.
Original language | English |
---|---|
Pages (from-to) | 185-199 |
Number of pages | 15 |
Journal | International Journal of Operational Research |
Volume | 13 |
Issue number | 2 |
DOIs | |
State | Published - Jan 2012 |
Keywords
- Branch and bound
- Clustering problem
- Facility location
- Operational research
- QAP
- QSAP
- Quadratic assignment problem
- Quadratic semi-assignment problem
ASJC Scopus subject areas
- Management Science and Operations Research