Branch and peg algorithms for the simple plant location problem

Authors:
Boris Goldengorin;Diptesh Ghosh;Gerard Sierksma
Affiliations:
Faculty of Economic Sciences, University of Groningen, P.O. Box 800, 9700AV Groningen, The Netherlands;Production and Quantitative Method Area, Indian Institute of Management Ahmedabad, Vastrapur, Ahmedabad 380015, India;Faculty of Economic Sciences, University of Groningen, P.O. Box 800, 9700AV Groningen, The Netherlands
Venue:
Computers and Operations Research
Year:
2004

Citing 4
Cited 3

The discrete two-dimensional assortment problem

Operations Research
The Data-Correcting Algorithm for the Minimization of Supermodular Functions

Management Science
Optimization as an Internet Resource

Interfaces
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)

Solving Large p-Median Problems with a Radius Formulation

INFORMS Journal on Computing
A strengthened formulation for the simple plant location problem with order

Operations Research Letters
Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System

Proceedings of Programming Models and Applications on Multicores and Manycores

Quantified Score

Hi-index	0.01

Visualization

Abstract

The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This problem often appears as a subproblem in other combinatorial problems. Several branch and bound techniques have been developed to solve these problems. In this paper we present two techniques that enhance the performance of branch and bound algorithms. The new algorithms thus obtained are called branch and peg algorithms, where pegging refers to fixing values of variables at each subproblem in the branch and bound tree, and is distinct from variable fixing during the branching process. We present exhaustive computational experiments which show that the new algorithms generate less than 60% of the number of subproblems generated by branch and bound algorithms, and in certain cases require less than 10% of the execution times required by branch and bound algorithms.