Lagrangean heuristics applied to a variety of large capacitated plant location problems

Journal of the Operational Research Society

Volumn 49, Issue 10, 1998, Pages 1072-1084

  Agar, M C ^a   Salhi, S ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Lagrangean heuristics; Location; Multi capacities; Single source

Indexed keywords

DECISION THEORY; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; STRATEGIC PLANNING;

CAPACITATED PLANT LOCATION PROBLEMS (CPLP); LAGRANGEAN HEURISTICS;

SITE SELECTION;

EID: 0032186917     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600621     Document Type: Article

References (23)

1. Mirchandani PB and Francis RL (1990). Discrete Location Theory. Wiley: New York.
2. Drezner Z (1995). Facility Location: A Survey of Applications and Methods. Springer: New York.
3. Daskin MS (1995). Network and Discrete Locations: Models Algorithms and Applications. Wiley: New York.
4. Sridharan R (1991). A Lagrangean heuristic for the capacitated plant location problem with side constraints. J Opl Res Soc 42: 579-585.
5. Beasley JE (1993). Lagrangean heuristic for location problems. Eur J Opl Res 65: 383-399.
6. Held M and Karp R (1970). The travelling salesman problem and minimum spanning trees. Opns Res 18: 1138-1162.
7. Held M and Karp R (1971). The travelling salesman problem and minimum spanning trees: Part II. Math Prog 1: 6-25.
8. Sridharan R (1993). A Lagrangean heuristic for the capacitated plant location problem with single source constraints. Eur J Opl Res 66: 305-312.
9. Current J, Pirkul H and Rolland E (1994). Efficient algorithms for solving the shortest covering path problem. Trans Sci 28: 317-327.
10. Vercellis C (1994). Constrained multi-project planning problems: A Lagrangean decomposition approach. Eur J Opl Res 78: 267-275.
11. Thomas PR and Salhi S (1995). A Lagrangean heuristic for the resource constrained project scheduling problem. Working paper, School of Mathematics and Statistics, University of Birmingham.
12. Reinfeld NV and Vogel WR (1958). Mathematical Programming. Prentice-Hall: Englewood Cliffs.
13. Shimshak DG, Kaslik JA and Barclay TD (1981). A modification of Vogel’s approximation method through the use of heuristics. Can J Opl Res Inf Proc 19: 259-263.
14. Goyal C (1994). Improving VAM for unbalanced transportation problems. J Opl Res Soc 35: 1113-1114.
15. Balakrishnan N (1990). Modified Vogel’s approximation method for the unbalanced transportation problem. Applied Mathematics Letters 3: 9-11.
16. Kirca ö and Satir A (1990). A heuristic for obtaining an initial solution for the transportation problem. J Opl Res Soc 41: 865-871.
17. Taha H (1992). Operations Research: An Introduction, 5th Edn, Collier MacMillan: New York.
18. Fisher ML, Jaikumar R and VanWassenhove LN (1986). A multiplier adjustment method for the generalised assignment problem. Mgmt Sci 32: 1095-1103.
19. Jörnsten K and Nösberg M (1986). A new Lagrangean relaxation approach to the generalised assignment problem. Eur J Opl Res 27: 313-323.
20. Barcelo J and Casanovas J (1984). A heuristic Lagrangean algorithm for the capacitated plant location problem. J Opl Res Soc 15: 212-226.
21. Martello S and Toth P (1979). The 0-1 Knapsack Problem. In: Christofides N et al (Eds). Wiley: New York.
22. Geoffrion AM and McBride RD (1978). Lagrangean relaxation applied to capacitated facility location problems. AIIE Trans 10: 40-47.
23. Christofides N, Mingozzi A and Toth P (1979). Combinatorial Optimisation. Wiley: Chichester.