Abstract
This paper considers the Modular Capacitated Location Problem (MCLP) which consists of finding the location and capacity of the facilities, to serve a set of customers at a minimum total cost. Each customer has an associated demand and the capacity of each potential location must be chosen from a finite and discrete set of available capacities. Practical applications of this problem can be found in the location of warehouses, schools, health care services or other types of public services. For the MCLP different mixed integer linear programming models are proposed. The authors develop upper and lower bounds on the problem's optimal value and present computational results with randomly generated tests problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agar, M. and tS. Salhi. (1998). “Lagrangean Heuristics Applied to a Variety of Large Capacitated Plant Location Problem.” Journal of the Operational Research Society 49, 1072–1084.
Ahuja, R., T. Magnanti, and J. Orlin. (1993). Network Flows: Theory, Algorithms and Applications. New York: Prentice Hall.
Beasley, J. (1988). “An Algorithm for Solving Large CapacitatedWarehouse Location Problems.” European Journal of Operational Research 33, 314–325.
Beasley, J. (1993). “Lagrangean Heuristics for Location Problems.” European Journal of Operational Research 65, 383–399.
Bertsegas, D. and P. Tseng. (1994). “RELAX-IV: A Faster Version of the RELAX Code for Solving Minimum Cost Flow Problem.” Available by ftp at lids.mit.edu
Cornuejols, G., R. Sridharan, and J. Thizy. (1991). “A Comparison of Heuristics and Relaxations for the Capacitated Plant Location Problem.” European Journal of Operational Research 50, 280–297.
Cplex. (1999). “Using the Cplex Callable Library, Version 6.5.” ILOG, Inc.
Daskin, M. (1995). Network and Discrete Location Models Algorithms and Applications. New York: Wiley.
Floyd, R. (1962). “Algorithm 97: Shortest Path.” Communications of the ACM 5, 345.
Geoffrion, A. (1974). “Lagrangean Relaxation for Integer Programming.” Mathematical Programming Study 2, 82–114.
Hansen, P., E. Filho, and C. Ribeiro. (1992). “Location and Sizing of Offshore Platforms for Oil Exploration.” European Journal of Operational Research 58, 202–214.
Held, M., P. Wolfe, and H. Crowder. (1974). “Validation of Subgradient Optimization.” Mathematical Programming 6, 62–66.
Holmberg, K. (1994). “Solving the Staircase Cost Facility Location Problem with Decomposition and Piecewise Linearization.” European Journal of Operational Research 75, 41–61.
Holmberg, K. and J. Ling. (1997). “A Lagrangean Heuristic for the Facility Location Problem with Staircase Costs.” European Journal of Operational Research 97, 63–74.
Lee, C. (1991). “An Optimal Algorithm for the Multiproduct Capacitated Facility Location Problem with a Choice of Facility Type.” Computers and Operations Research 18, 167–182.
Lee, C. (1996). “An Algorithm for a Two-Staged Distribution System with Various Types of Distribution Centers.” Infor 34, 105–117.
Mirchandani, P. and R. Francis (eds.). (1990). Location Theory. New York: Wiley.
Sridharan, R. (1995). “The Capacitated Plant Location Problem.” European Journal of Operational Research 87, 203–213.
Sridharan, R. (1991). “A Lagrangean Heuristic for the Capacitated Plant Location Problem with Side Constraints.” Journal of the Operational Research Society 42, 579–585.
Yoo, C. and D. Tcha. (1986). “A Cross Decomposition Procedure for the Facility Location Problem with a Choice of Facility Type.” Computers and Industrial Engineering 10, 3–290.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Correia, I., Captivo, M.E. A Lagrangean Heuristic for a Modular Capacitated Location Problem. Annals of Operations Research 122, 141–161 (2003). https://doi.org/10.1023/A:1026146507143
Issue Date:
DOI: https://doi.org/10.1023/A:1026146507143