The multifacility maximin planar location problem with facility interaction |
| |
| Authors: | Welch S B; Salhi S; Drezner Z |
| |
| Institution: |
1 OR Group, Debenhams, London, UK, 2 Centre for Heuristic Optimisation, Kent Business School, University of Kent at Canterbury, UK, 3 Department of Information Systems and Decision Sciences, California State University—Fullerton, Fullerton, USA
|
| |
| Abstract: | ** Email: s.salhi{at}kent.ac.uk Two branch-and-bound algorithms are proposed to optimally solvethe maximin formulation for locating p facilities in the plane.Tight upper and lower bounds are constructed and suitable methodsof guiding the search developed. To enhance the method, efficientmeasures for identifying specific squares for subdivision aresuggested. The proposed algorithms are evaluated on a set ofrandomly generated problems of up to five facilities and 120nodes. |
| |
| Keywords: | location continuous space branch and bound |
| 本文献已被 Oxford 等数据库收录！ |
|
