A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints

1991 ◽  
Vol 42 (7) ◽  
pp. 579
Author(s):  
R. Sridharan
Keyword(s):  
Location Problem ◽  
Plant Location ◽  
Side Constraints ◽  
Lagrangian Heuristic

The Location of Sewage Treatment Plants on a Continuous Space: Theoretical and Empirical Analyses

1983 ◽  
Vol 15 (9) ◽  
pp. 1205-1217 ◽  
Author(s):  
Y Kitabatake ◽  
T Miyazaki
Keyword(s):  
Location Problem ◽  
Population Distribution ◽  
Sewage Treatment ◽  
Sewage Treatment Plant ◽  
Treatment Plant ◽  
Plant Location ◽  
Metropolitan Region ◽  
Continuous Space ◽  
Sewage Treatment Plants ◽  
One Dimensional

A theoretical model of the sewage treatment plant location problem is presented, based on the assumptions of a homogeneous space and a homogeneous channel geometry of a river running parallel to a one-dimensional region. The analytical structure of the model is discussed. The model is then applied to the specific case of a suburban region of the Tokyo Metropolitan Region, where both the homogeneity assumptions are dropped. The numerical simulations show clearly how the heterogeneity in population distribution and river characteristics, as well as the trade-off ratio between water quality and least cost expenditure, affects the optimal plant locations.

scholarly journals An ADD/DROP procedure for the capacitated plant location problem

2004 ◽  
Vol 24 (1) ◽  
pp. 151-162 ◽  
Author(s):  
Claudio Thomas Bornstein ◽  
Manoel Campêlo
Keyword(s):  
Heuristic Algorithm ◽  
Location Problem ◽  
Lagrangean Relaxation ◽  
Upper Bounds ◽  
Transportation Costs ◽  
Plant Location ◽  
Computational Results ◽  
Lower And Upper Bounds

The capacitated plant location problem with linear transportation costs is considered. Exact rules and heuristics are presented for opening or closing of facilities. A heuristic algorithm based on ADD/DROP strategies is proposed. Procedures are implemented with the help of lower and upper bounds using Lagrangean relaxation. Computational results are presented and comparisons with other algorithms are made.

Sign in / Sign up

Export Citation Format

Share Document