A multiperiod two-echelon multicommodity capacitated plant location problem

European Journal of Operational Research

Volumn 123, Issue 2, 2000, Pages 271-291

  Hinojosa, Y ^a   Puerto, J ^a   Fernandez F R ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Heuristic; Integer programming; Lagrangean dual; Multiperiod multi echelon facility location

Indexed keywords

COST EFFECTIVENESS; HEURISTIC METHODS; INDUSTRIAL PLANTS; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; SCHEDULING; WAREHOUSES;

LAGRANGEAN DUAL; MIXED INTEGER PROGRAMMING PROBLEM; MULTIPERIOD MULTI ECHELON FACILITY LOCATION;

INTEGER PROGRAMMING;

EID: 0033873699     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00256-8     Document Type: Article

References (22)

1. C.H. Aikens, Facility location models for distribution planning, European Journal of Operational Research 22 (1985) 263-279.
2. J. Barceló, E. Fernández, K. Jornsten, Computational results from a new lagrangean relaxation algorithm for the capacitated plant location problem, European Journal of Operational Research 53 (1991) 38-45.
3. A.I. Barros, M. Labbé, A general model for the uncapacitated facility and depot location problem, Location Science 2 (1994) 173-191.
4. J.E. Beasley, Lagrangean heuristics for location problems, European Journal of Operational Research 65 (1993) 383-399.
5. T.G. Crainic, L. Delorme, Dual-ascent procedures for multicommodity location-allocation problems with balancing requirements, Transportation Science 27 (2) (1993) 90-101.
6. P. Chardaire, A. Sutter, M.C. Costa, Solving the dynamic facility location problem, Networks 28 (1996) 117-124.
7. M. Daskin, Network and Discrete Location, Wiley, New York, 1995.
8. Z. Drezner, Facility Location, Springer, Berlin, 1995.
9. D. Erlenkotter, A dual-based procedure for uncapacitated facility location, Operational Research 26 (6) (1978) 992-1009.
10. M. Fisher, The Lagrangean relaxation method for solving integer programming problems, Management Science 27 (1) (1981) 1-18.
11. M. Guignard, M. Rosenwein, A application-oriented guide for designing Lagrangean dual ascent algorithms, European Journal of Operational Research 43 (1989) 197-205.
12. M. Guignard, K. Opaswongkarn, Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems, European Journal of Operational Research 46 (1990) 73-83.
13. M. Held, P. Wolfe, H. Crowder, Validation of subgradient optimization, Mathematical Programming 6 (1974) 62-88.
14. K. Holmberg, K. Jornsten, Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction, Location Science 4 (1996) 83-100.
15. L. Kaufman, M.V. Eede, P. Hansen, A plant and warehouse location problem, Operational Research Quarterly 28 (1977) 547-554.
16. J. Krarup, P.M. Pruzan, The simple plant location problem: Survey and synthesis, European Journal of Operational Research 12 (1983) 36-81.
17. A. Marín, Análisis y resolutión de problemas de localization discreta en dos etapas mediante técnicas basadas en la descomposición lagrangiana, Thesis, Dpto. Matemática Aplicada y Estadística, Universidad de Murcia, 1996.
18. H. Pirkul, V. Jayaraman, Production transportation and distribution planning in a multicommodity tri-echelon system, Transportation Science 30 (4) (1996) 291-302.
19. G.M. Roodman, L.B. Schwartz, Optimal and heuristic facility phase-out strategies, AIIE Transactions 7 (1975) 177-184.
20. D. Tcha, B. Lee, A branch-and-bound algorithm for the multi-level uncapacitated facility location problem, European Journal of Operational Research 18 (1984) 35-43.
21. T.J. van Roy, D. Erlenkotter, A dual-based procedure for dynamic facility location, Management Science 28 (10) (1982) 1091-1105.
22. A. Warszawski, Multi-dimensional location problems, Operational Research Quarterly 24 (1973) 165-179.