IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v123y2019icp1-20.html
   My bibliography  Save this article

A bi-level capacitated P-median facility location problem with the most likely allocation solution

Author

Listed:
  • Abareshi, Maryam
  • Zaferanieh, Mehdi

Abstract

In this paper, a bi-level model is introduced to evaluate the capacitated p-median facility location problem with the most likely allocation solution. The classical capacitated p-median problem is considered in the upper-level to minimize the cost of locating facilities and serving demands while a log-based model resulting from the minimum information approach is used in the lower-level to determine the most likely allocation solution based on the available information. Using Lagrangian dual theory, the proposed bi-level problem is reduced to a new one-level nonlinear mixed-integer problem whose solution is obtained by comparing two mixed-integer linear problems. Some numerical examples are provided to illustrate the added value of the proposed model.

Suggested Citation

  • Abareshi, Maryam & Zaferanieh, Mehdi, 2019. "A bi-level capacitated P-median facility location problem with the most likely allocation solution," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 1-20.
    • Handle: RePEc:eee:transb:v:123:y:2019:i:c:p:1-20
    DOI: 10.1016/j.trb.2019.03.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261518304946
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2019.03.013?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Tony J. Van Roy, 1986. "A Cross Decomposition Algorithm for Capacitated Facility Location," Operations Research, INFORMS, vol. 34(1), pages 145-163, February.
    2. M. L. Balinski, 1965. "Integer Programming: Methods, Uses, Computations," Management Science, INFORMS, vol. 12(3), pages 253-313, November.
    3. Taniguchi, Eiichi & Noritake, Michihiko & Yamada, Tadashi & Izumitani, Toru, 1999. "Optimal size and location planning of public logistics terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 35(3), pages 207-222, September.
    4. Diaz, Juan A. & Fernandez, Elena, 2006. "Hybrid scatter search and path relinking for the capacitated p-median problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 570-585, March.
    5. Jerry R. Weaver & Richard L. Church, 1985. "A Median Location Model with Nonclosest Facility Service," Transportation Science, INFORMS, vol. 19(1), pages 58-74, February.
    6. Korkel, Manfred, 1989. "On the exact solution of large-scale simple plant location problems," European Journal of Operational Research, Elsevier, vol. 39(2), pages 157-173, March.
    7. Donald Erlenkotter, 1978. "A Dual-Based Procedure for Uncapacitated Facility Location," Operations Research, INFORMS, vol. 26(6), pages 992-1009, December.
    8. Teye, Collins & Bell, Michael G.H. & Bliemer, Michiel C.J., 2017. "Entropy maximising facility location model for port city intermodal terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 100(C), pages 1-16.
    9. Snickars, Folke & Weibull, Jorgen W., 1977. "A minimum information principle : Theory and practice," Regional Science and Urban Economics, Elsevier, vol. 7(1-2), pages 137-168, March.
    10. Fleszar, K. & Hindi, K.S., 2008. "An effective VNS for the capacitated p-median problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 612-622, December.
    11. Christofides, N. & Beasley, J. E., 1983. "Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem," European Journal of Operational Research, Elsevier, vol. 12(1), pages 19-28, January.
    12. Badri, Masood A., 1999. "Combining the analytic hierarchy process and goal programming for global facility location-allocation problem," International Journal of Production Economics, Elsevier, vol. 62(3), pages 237-248, September.
    13. Saaty, Thomas L., 1990. "How to make a decision: The analytic hierarchy process," European Journal of Operational Research, Elsevier, vol. 48(1), pages 9-26, September.
    14. ReVelle, C.S. & Eiselt, H.A. & Daskin, M.S., 2008. "A bibliography for some fundamental problem categories in discrete location science," European Journal of Operational Research, Elsevier, vol. 184(3), pages 817-848, February.
    15. Van Zuylen, Henk J. & Willumsen, Luis G., 1980. "The most likely trip matrix estimated from traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 14(3), pages 281-293, September.
    16. Maryam Abareshi & Mehdi Zaferanieh & Bagher Keramati, 2017. "Path Flow Estimator in an Entropy Model Using a Nonlinear L-Shaped Algorithm," Networks and Spatial Economics, Springer, vol. 17(1), pages 293-315, March.
    17. Hanjoul, Pierre & Peeters, Dominique, 1987. "A facility location problem with clients' preference orderings," Regional Science and Urban Economics, Elsevier, vol. 17(3), pages 451-473, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lüer-Villagra, Armin & Marianov, Vladimir & Eiselt, H.A. & Méndez-Vogel, Gonzalo, 2022. "The leader multipurpose shopping location problem," European Journal of Operational Research, Elsevier, vol. 302(2), pages 470-481.
    2. Li, Qing & Li, Mingchu & Zhang, Runfa & Gan, Jianyuan, 2021. "A stochastic bilevel model for facility location-protection problem with the most likely interdiction strategy," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    3. Luyun Wang & Bo Zhou, 2023. "Optimal Planning of Electric Vehicle Fast-Charging Stations Considering Uncertain Charging Demands via Dantzig–Wolfe Decomposition," Sustainability, MDPI, vol. 15(8), pages 1-23, April.
    4. Elham Ziar & Mehdi Seifbarghy & Mahdi Bashiri & Benny Tjahjono, 2023. "An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach," Annals of Operations Research, Springer, vol. 322(2), pages 1143-1166, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.
    2. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    3. Alberto Ceselli & Federico Liberatore & Giovanni Righini, 2009. "A computational evaluation of a general branch-and-price framework for capacitated network location problems," Annals of Operations Research, Springer, vol. 167(1), pages 209-251, March.
    4. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Ting L. Lei & Richard L. Church, 2011. "Constructs for Multilevel Closest Assignment in Location Modeling," International Regional Science Review, , vol. 34(3), pages 339-367, July.
    6. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    7. Klose, Andreas, 2000. "A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 126(2), pages 408-421, October.
    8. Klaus Büdenbender & Tore Grünert & Hans-Jürgen Sebastian, 2000. "A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem," Transportation Science, INFORMS, vol. 34(4), pages 364-380, November.
    9. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    10. Rentizelas, Athanasios A. & Tatsiopoulos, Ilias P., 2010. "Locating a bioenergy facility using a hybrid optimization method," International Journal of Production Economics, Elsevier, vol. 123(1), pages 196-209, January.
    11. Holmberg, Kaj & Ling, Jonas, 1997. "A Lagrangean heuristic for the facility location problem with staircase costs," European Journal of Operational Research, Elsevier, vol. 97(1), pages 63-74, February.
    12. Varsei, Mohsen & Polyakovskiy, Sergey, 2017. "Sustainable supply chain network design: A case of the wine industry in Australia," Omega, Elsevier, vol. 66(PB), pages 236-247.
    13. Michel Le Breton & Juan Moreno-Ternero & Alexei Savvateev & Shlomo Weber, 2013. "Stability and fairness in models with a multiple membership," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 673-694, August.
    14. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    15. Alessio Ishizaka & Philippe Nemery, 2013. "A Multi-Criteria Group Decision Framework for Partner Grouping When Sharing Facilities," Group Decision and Negotiation, Springer, vol. 22(4), pages 773-799, July.
    16. Pierre Hansen & Jack Brimberg & Dragan Urošević & Nenad Mladenović, 2007. "Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 552-564, November.
    17. Mingjian Wu & Tae J. Kwon & Karim El-Basyouny, 2020. "A Citywide Location-Allocation Framework for Driver Feedback Signs: Optimizing Safety and Coverage of Vulnerable Road Users," Sustainability, MDPI, vol. 12(24), pages 1-20, December.
    18. Monabbati, Ehsan & Kakhki, Hossein Taghizadeh, 2015. "On a class of subadditive duals for the uncapacitated facility location problem," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 118-131.
    19. Kaj Holmberg & Johan Hellstrand, 1998. "Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound," Operations Research, INFORMS, vol. 46(2), pages 247-259, April.
    20. Sharma, R.R.K. & Berry, V., 2007. "Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort," European Journal of Operational Research, Elsevier, vol. 177(2), pages 803-812, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:123:y:2019:i:c:p:1-20. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.