Skip to main content
SpringerLink
Log in

A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we study a capacitated facility location problem with two decision makers. One (say, the leader) decides on which subset of facilities to open and the capacity to be installed in each facility with the goal of minimizing the overall costs; the second decision maker (say, the follower), once the facilities have been designed, aims at maximizing the profit deriving from satisfying the demands of a given set of clients beyond a certain threshold imposed by the leader. The leader can foresee but cannot control the follower’s behavior. The resulting mathematical formulation is a discrete–continuous bilevel optimization problem. We propose a decomposition approach to cope with the bilevel structure of the problem and the integrality of a subset of variables under the control of the leader. Such a proposal has been tested on a set of benchmark instances available in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  2. Akinc, U., Khumawala, B.M.: An efficient branch and bound algorithm for the capacitated warehouse location problem. Manag. Sci. 23(6), 585–594 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  3. Aksen, D., Aras, N.: A matheuristic for leader-follower games involving facility location-protection-interdiction decisions. In: Talbi, E. (ed.) Metaheuristics for Bi-Level Optimization Studies in Computational Intelligence, Studies in Computational Intelligence, vol. 482, pp. 115–151. Springer, Berlin (2013)

    Google Scholar 

  4. Arroyo, J.M., Galiana, F.D.: On the solution of the bilevel programming formulation of the terrorist threat problem. IEEE Trans. Power Syst. 20(2), 789–797 (2005)

    Article  Google Scholar 

  5. Balinski, M.L., Wolfe, P:. On Benders decomposition and a plant location problem. Working paper-ARO 27. Mathematica, Princeton (1963)

  6. Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, Boston (1998)

    Book  MATH  Google Scholar 

  7. Bard, J.F., Moore, J.T.: A branch and bound algorithm for the bilevel programming problem. SIAM J. Sci. Stat. Comput. 11(2), 281–292 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  8. Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238–252 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bianco, L., Caramia, M., Giordani, S., Mari, R.: Grid scheduling by bilevel programming: a heuristic approach. Eur. J. Ind. Eng. 9(1), 101–125 (2015)

    Article  Google Scholar 

  10. Camacho-Vallejo, J.F., Cordero-Franco, A.E., González-Ramírez, R.G.: Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm. Math. Prob. Eng. 2014, 1–14 (2014)

  11. Cao, D., Chen, M.: Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach. Eur. J. Oper. Res. 169(1), 97–110 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Cornuejols, G., Fisher, M., Nemhauser, G.L.: Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manag. Sci. 23(8), 789–810 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  13. Cornuejols, G., Nemhauser, L.G., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P., Francis, R. (eds.) Discrete Location Theory, pp. 119–171. Wiley, New York (1990)

    Google Scholar 

  14. Daskin, M.S.: Network and Discrete Location: Models, Algorithms, and Applications. Wiley, New York (1995)

    Book  MATH  Google Scholar 

  15. Dempe, S.: Foundation of Bilevel Programming. Kluwer Academic Publishers, Dordrecht (2002)

    MATH  Google Scholar 

  16. Efroymson, M.A., Ray, T.L.: A branch-bound algorithm for plant location. Oper. Res. 14(3), 361–368 (1966)

    Article  Google Scholar 

  17. Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Oper. Res. 26(6), 992–1009 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  18. Fontaine, P., Minner, S.: Benders decomposition for discrete-continuous linear bilevel problems with application to traffic network design. Transp. Res. Part B Methodol. 70, 163–172 (2014)

    Article  Google Scholar 

  19. Fortuny-Amat, J., McCarl, B.: A representation and economic interpretation of a two-level programming problem. J. Oper. Res. Soc. 32(9), 783–792 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  20. Gabriel, S.A., Shim, Y., Conejo, A.J., de la Torre, S., Garcia-Bertrand, R.: A Benders decomposition method for discretely constrained mathematical programs with equilibrium constraints. J. Oper. Res. Soc. 61, 1404–1419 (2010)

    MATH  Google Scholar 

  21. Geoffrion, A.M., Graves, G.W.: Multicommodity distribution system design by Benders decomposition. Manag. Sci. 20(5), 822–844 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  22. Grossmann, I.E., Floudas, C.A.: Active constraint strategy for flexibility analysis in chemical processes. Comput. Chem. Eng. 11(6), 675–693 (1987)

    Article  Google Scholar 

  23. Hansen, P., Jaumard, P., Savard, G.: New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13(5), 1194–1217 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  24. Hansen, P., Kochetov, Y., Mladenovic, N.: Lower bounds for the uncapacitated facility location problem with user preferences. Les Cahiers du GERAD G-2004-24 (2004)

  25. Hanjoul, P., Peeters, D.: A facility location problem with clients’ preferences. Reg. Sci. Urban Econ. 17(3), 451–473 (1987)

    Article  Google Scholar 

  26. Jeroslow, R.G.: The polynomial hierarchy and a simple model for competitive analysis. Math. Prog. 32(2), 146–164 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  27. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Tatcher, J.W. (eds.) Compl. Comp. Comp., pp. 85–103. Plenum Press, New York (1972)

    Chapter  Google Scholar 

  28. Khumawala, B.M.: An efficient branch-and-bound algorithm for the warehouse location problem. Manag. Sci. 18(12), 718–731 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  29. Kochetov, Y., Kochetova, N., Plyasunov, A.: A matheuristic for the leader-follower facility location and design problem. In: Proceedings of the 10th Metaheuristics International Conference (MIC 2013), pp. 32/1–32/3 (2013)

  30. Krarup, J., Pruzan, P.M.: The simple plant location problem: survey and synthesis. Eur. J. Oper. Res. 12(1), 36–81 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  31. Kuehn, A.A., Hamburger, M.J.: A heuristic program for location warehouses. Manag. Sci. 9(4), 643–666 (1963)

    Article  Google Scholar 

  32. Losada, C., Scaparra, M.P., Church, R.L.: On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions. Electron. Notes Discrete Math. 36, 591–598 (2010)

    Article  MATH  Google Scholar 

  33. Losada, C., Scaparra, M.P., O’Hanley, J.R.: Optimizing system resilience: a facility protection model with recovery time. Eur. J. Oper. Res. 217(3), 519–530 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  34. Louveaux, F.V., Peeters, D.: A dual-based procedure for stochastic facility location. Oper. Res. 40(3), 564–573 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  35. Mari, R.: Integer bilevel linear programming problems: new results and applications. PhD thesis, University of Rome Sapienza, Italy (2014)

  36. Nauss, R.M.: An improved algorithm for the capacitated facility location problem. J. Oper. Res. Soc. 29(12), 1195–1201 (1978)

    Article  MATH  Google Scholar 

  37. Scaparra, M.P., Church, R.L.: A bilevel mixed-integer program for critical infrastructure protection planning. Comput. Oper. Res. 35(6), 1905–1923 (2008)

    Article  MATH  Google Scholar 

  38. Scaparra, M.P., Church, R.L.: An exact solution approach for the interdiction median problem with fortification. Eur. J. Oper. Res. 189(1), 76–92 (2008)

    Article  MATH  Google Scholar 

  39. Saharidis, G.K., Ierapetritou, M.G.: Resolution method for mixed integer bi-level linear problems based on decomposition technique. J. Global Optim. 44(1), 29–51 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  40. Swain, R.: A decomposition algorithm for a class of facility location problems. PhD thesis, Cornell University, Ithaca (1971)

  41. Vasilyev, I.L., Klimentova, K.B.: The branch and cut method for the location problem with client’s preferences. J. Appl. Ind. Math. 4(3), 441–454 (2010)

    Article  MathSciNet  Google Scholar 

  42. Verter, V.: Uncapacitated and capacitated facility location problems. In: Eiselt, H.A., Marianov, V. (eds.) Found. Loc. Anal., pp. 25–37. Springer, New York (2011)

    Chapter  Google Scholar 

  43. Vicente, L.N., Savard, G., Judice, J.J.: Descent approaches for quadratic bilevel programming. J. Optim. Theory Appl. 81(2), 379–399 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  44. Vicente, L.N., Savard, G., Judice, J.J.: Discrete linear bilevel programming problem. J. Optim. Theory Appl. 89(3), 597–614 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  45. Wolsey, L.A.: Integer Programming. Wiley-Interscience Series. Wiley, New York (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria dell’Impresa, University of Rome “Tor Vergata”, Via del Politecnico, 1, 00133, Rome, Italy

    Massimiliano Caramia & Renato Mari

Authors
  1. Massimiliano Caramia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Renato Mari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Massimiliano Caramia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Caramia, M., Mari, R. A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints. Optim Lett 10, 997–1019 (2016). https://doi.org/10.1007/s11590-015-0918-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-015-0918-z

Keywords

Search

Navigation