A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution

Computers and Operations Research

Volumn 25, Issue 10, 1998, Pages 869-878

  Pirkul, Hasan ^a   Jayaraman, Vaidyanathan ^b  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; INDUSTRIAL MANAGEMENT; INTEGER PROGRAMMING; PRODUCTION CONTROL; STRATEGIC PLANNING; WAREHOUSES;

CAPACITATED FACILITY LOCATION PROBLEMS; MIXED INTEGER PROGRAMMING;

DISTRIBUTION OF GOODS;

EID: 0032188469     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(97)00096-8     Document Type: Article

References (22)

1. Aikens, C. H., Facility location models for distributing planning. European Journal of Operational Research, 1985, 22, 263-279.
2. Barcelo, J. and Casanovas, J., A heuristic Lagrangean algorithm for the capacitated plant location problem. European Journal of Operational Research, 1984, 15, 212-226.
3. Beasley, J. E., Lagrangean heuristics for location problems. European Journal of Operational Research, 1993, 65, 383-399.
4. Guignard, M. and Spielberg, K., A direct dual method for the mixed plant location problem. Math. Programming, 1979, 17, 198-228.
5. Krarup, J. and Pruzan, P. W., The simple plant location problem: survey and synthesis. European Journal of Operational Research, 1983, 12, 36-81.
6. Sa, G., Branch-and-bound and approximation solutions to the capacitated plant-location problem. Operations Research, 1969, 17, 1005-1016.
7. Sridharan, R., The capacitated plant location problem. European Journal of Operational Res., 1995, 87, 203-213.
8. Klincewicz, J. and Luss, H., A Lagrangean relaxation heuristic for capacitated facility location with single-source constraints. Journal of Operational Research Society, 1986, 37, 495-500.
9. Pirkul, H., Efficient algorithms for the capacitated concentrator location problem. Computers and Operations Research, 1987, 14, 197-208.
10. Sridharan, R., A Lagrangean heuristic for the capacitated plant location problem with single source constraints. European Journal of Operational Research, 1993, 66, 305-312.
11. Balinski, M. L., Fixed-cost transportation problems. Naval Research Logistics Quarterly, 1961, 8, 41-54.
12. Manne, A., Plant location under economies-of-scale: decentralization and computation. Management Science, 1964, 11, 213-235.
13. Efroysom, M. A. and Ray, T. L., A branch-and-bound algorithm for plant location. Operational Research Quarterly, 1966, 14, 361-368.
14. Spielberg, K., Algorithms for the simple plant-location problems with some side constraints. Operations Research, 1969, 17, 85-111.
15. Elson, D. G., Site location via mixed-integer programming. Operational Research Quarterly, 1972, 23, 31-43.
16. Geoffrion, A. and Graves, G. W., Multicommodity distribution system design by Benders decomposition. Management Science, 1974, 20, 822-844.
17. Lee, C. Y., A Cross Decomposition algorithm for a multiproduct-multitype facility location problem. Computers and Operations Research, 1993, 20, 527-540.
18. Garey, M. R. and Johnson, D. S., Computers and Intractability: A Guide to the theory of NP-Completeness. Freeman, San Francisco, 1979.
19. Barcelo, J., Fernandex, E. and Jornsten, K. O., Computational results from a new lagrangean relaxation algorithm for the capacitated plant location problem. European Journal of Operational Research, 1991, 53, 38-45.
20. Pirkul, H. and Schilling, D. A., The maximal covering location problem with capacities on total workload. Management Science, 1991, 37, 233-248.
21. Reeves, C. R., Modern Heuristic Techniques for Combinatorial Problems. Wiley and Sons, 1993.
22. Users Guide to Sciconic/VM, Sciconic Computing Services, Ltd., Brick Close, Kiln Farm, Milton Keynes MK11 3EJ. U.K., 1985.