Solving the Simple Plant Location Problem using a Data Correcting Approach

Authors:
Boris Goldengorin;Gert A. Tijssen;Diptesh Ghosh;Gerard Sierksma
Affiliations:
Faculty of Economic Sciences, University of Groningen, Groningen, The Netherlands E-mail: B.Goldengorin@eco.rug.nl ;Faculty of Economic Sciences, University of Groningen, Groningen, The Netherlands;P&QM Area, Indian Institute of Management, Ahmedabad, India E-mail: diptesh@iimahd.ernet.in;Faculty of Economic Sciences, University of Groningen, Groningen, The Netherlands
Venue:
Journal of Global Optimization
Year:
2003

Citing 0
Cited 6

Equivalent instances of the simple plant location problem

Computers & Mathematics with Applications
The problem of margin calculation and its reduction via the p-Median problem model

AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Data aggregation for p-median problems

Journal of Combinatorial Optimization
Fast bounding procedures for large instances of the Simple Plant Location Problem

Computers and Operations Research
A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation

INOC'11 Proceedings of the 5th international conference on Network optimization
Complexity evaluation of benchmark instances for the p-median problem

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Data Correcting Algorithm is a branch and bound type algorithm in which the data of a given problem instance is `corrected' at each branching in such a way that the new instance will be as close as possible to a polynomially solvable instance and the result satisfies an acceptable accuracy (the difference between optimal and current solution). In this paper the data correcting algorithm is applied to determining exact and approximate optimal solutions to the simple plant location problem. Implementations of the algorithm are based on a pseudo-Boolean representation of the goal function of this problem, and a new reduction rule. We study the efficiency of the data correcting approach using two different bounds, the Khachaturov-Minoux bound and the Erlenkotter bound. We present computational results on several benchmark instances, which confirm the efficiency of the data-correcting approach.