An aggressive reduction scheme for the simple plant location problem

Letchford, Adam and Miller, Sebastian (2014) An aggressive reduction scheme for the simple plant location problem. European Journal of Operational Research, 234 (3). pp. 674-682. ISSN 0377-2217

Full text not available from this repository.

Abstract

Pisinger et al. introduced the concept of 'aggressive reduction' for large-scale combinatorial optimisation problems. The idea is to spend much time and effort in reducing the size of the instance, in the hope that the reduced instance will then be small enough to be solved by an exact algorithm. We present an aggressive reduction scheme for the 'Simple Plant Location Problem', which is a classical problem arising in logistics. The scheme involves four different reduction rules, along with lower- and upper-bounding procedures. The scheme turns out to be particularly effective for instances in which the facilities and clients correspond to points on the Euclidean plane.

Item Type:
Journal Article
Journal or Publication Title:
European Journal of Operational Research
Additional Information:
The final, definitive version of this article has been published in the Journal, European Journal of Operational Research 234 (3), 2014, © ELSEVIER.
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
ID Code:
67007
Deposited By:
Deposited On:
07 Oct 2013 12:08
Refereed?:
Yes
Published?:
Published
Last Modified:
11 Mar 2020 04:02