Improving the Efficiency of Branch and Bound 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 often appears as a subproblem in other combinatorial problems. Several branch and bound techniques have been developed to solve this problem. In this paper we present some techniques that enhance the performance of branch and bound algorithms. Computational experiments show that the new algorithms thus obtained 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 conventional branch and bound algorithms.
KeywordsExecution Time Problem Instance Transportation Cost Partial Solution Average Execution Time
Unable to display preview. Download preview PDF.
- 1.J. E. Beasley. OR-Library, http://mscmga.ms.ic.ac.uk/info.html
- 2.V. L. Beresnev. On a Problem of Mathematical Standardization Theory. Upravliajemyje Sistemy 11, 43–54, 1973 (in Russian).Google Scholar
- 3.V. L. Beresnev, E. Kh. Gimadi, V. T. Dementyev. Extremal Standardization Problems, Novosibirsk, Nauka, 1978 (in Russian).Google Scholar
- 5.G. Cornuejols, G. L. Nemhauser, and L. A. Wolsey. The Uncapacitated Facility Location Problem. Ch.3, Discrete Location Theory, R. L. Francis and P. B. Mirchandani (eds.), Wiley-Interscience, New York, 1990.Google Scholar
- 7.B. Goldengorin. Requirements of Standards: Optimization Models and Algorithms. ROR, Hoogezand, The Netherlands, 1995.Google Scholar
- 8.B. Goldengorin, D. Ghosh, and G. Sierksma. Equivalent Instances of the Simple Plant Location Problem. SOM Research Report-00A54, 2000.Google Scholar
- 9.P. L. Hammer. Plant Location — A Pseudo-Boolean Approach. Israel Journal of Technology 6, 330–332, 1968.Google Scholar