Optimization Online


An aggressive reduction scheme for the simple plant location problem

Adam Letchford (A.N.Letchford***at***lancaster.ac.uk)
Sebastian Miller (S.Miller2***at***lancaster.ac.uk)

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.

Keywords: facility location, combinatorial optimisation

Category 1: Combinatorial Optimization

Category 2: Network Optimization

Category 3: Integer Programming

Citation: Eventually published as: A.N. Letchford & S.J. Miller (2014) An aggressive reduction scheme for the simple plant location problem. Eur. J. Oper. Res., 234(3), 674-682.


Entry Submitted: 02/29/2012
Entry Accepted: 02/29/2012
Entry Last Modified: 05/31/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society