You are not currently logged in.
Access JSTOR through your library or other institution:
A Branch-and-Price Algorithm for the Single Source Capacitated Plant Location Problem
J. A. Díaz and E. Fernández
The Journal of the Operational Research Society
Vol. 53, No. 7 (Jul., 2002), pp. 728-740
Stable URL: http://www.jstor.org/stable/822761
Page Count: 13
You can always find the topics here!Topics: Heuristics, Optimal solutions, Industrial plant locations, Algorithms, Operations research, Plants, Plant roots, Cost allocation, Fixed costs, Pricing
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
This paper considers the Single Source Capacitated Plant Location Problem (SSCPLP). We propose an exact algorithm in which a column generation procedure for finding upper and lower bounds is incorporated within a Branch-and-Price framework. The bounding procedure exploits the structure of the problem by means of an iterative approach. At each iteration, a two-level optimization problem is considered. The two levels correspond with the two decisions to be taken: first, the selection of a subset of plants to be opened and then, the allocation of clients within the subset of open plants. The second level subproblem is solved using column generation. The algorithm has been tested with different sets of test problems and the obtained results are satisfactory.
The Journal of the Operational Research Society © 2002 Operational Research Society