Branch and peg algorithms for the simple plant location problem
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 of ten 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 a few 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 assigning values to variables outside 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.
Year of publication: |
2001
|
---|---|
Authors: | Goldengorin, Boris ; Ghosh, Diptesh ; Sierksma, Gerard |
Institutions: | Faculteit Economie en Bedrijfskunde, Rijksuniversiteit Groningen |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Iterative Patching and the Asymmetric Traveling Salesman Problem
Turkensteen, Marcel, (2004)
-
Equivalent instances of the simple plant location problem
Ghosh, Diptesh, (2000)
-
Goldengorin, Boris, (1998)
- More ...