Article ID: | iaor2000673 |
Country: | United Kingdom |
Volume: | 50 |
Issue: | 3 |
Start Page Number: | 268 |
End Page Number: | 274 |
Publication Date: | Mar 1999 |
Journal: | Journal of the Operational Research Society |
Authors: | Hindi K.S., Piekosz K. |
The single-source, capacitated plant location problem is considered. This problem differs from the capacitated plant location problem by the additional requirement that each customer must be supplied with all its demand from a single plant. An efficient heuristic solution, capable of solving large problem instances, is presented. The heuristic combines Lagrangian relaxation with restricted neighbourhood search. Computational experiments on two sets of problem instances are presented.