论文信息 - A branch and bound algorithm for the partial coverage capacitated plant location problem

A branch and bound algorithm for the partial coverage capacitated plant location problem

In this paper, a branch and bound algorithm for the partial coverage capacitated facility locations problem is developed. We have to fix open a set of warehouses which are economically feasible. It is an extension of the algorithm given by B. M. Khumawala [10] and Sudha Arora and S.R. Arora [2]. The case when the demand of the customer may not be satisfied completely, giving rise to “opportunity demand” is also discussed. This is illustrated with the help of examples and their computational results.

S. R. Arora | Sudha Arora

[1] Said Salhi,et al. Facility Location: A Survey of Applications and Methods , 1996 .

[2] Robert M. Nauss,et al. An Improved Algorithm for the Capacitated Facility Location Problem , 1978 .

[3] A. Volgenant,et al. Facility location: a survey of applications and methods , 1996 .

[4] Nicos Christofides,et al. Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem , 1983 .

[5] P. S. Davis,et al. A branch‐bound algorithm for the capacitated facilities location problem , 1969 .

[6] Francis J. Vasko,et al. A large-scale application of the partial coverage uncapacitated facility location problem , 2003, J. Oper. Res. Soc..

[7] B. M. Khumawala. An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .

[8] B. M. Khumawala,et al. An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem , 1977 .

[9] Andreas Klose,et al. An LP-based heuristic for two-stage capacitated facility location problems , 1999, J. Oper. Res. Soc..

[10] Ju-Liang Zhang,et al. Capacitated facility location problem with general setup cost , 2006, Comput. Oper. Res..

[11] S. R. Arora,et al. Branch and Bound Algorithm for the Warehouse Location Problem with the Objective Function as Linear Fractional , 2006 .