IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v341y2024i2d10.1007_s10479-024-06096-0.html
   My bibliography  Save this article

Robust vertex centdian facility location problem on tree networks

Author

Listed:
  • Soudabeh Seyyedi Ghomi

    (Sahand University of Technology)

  • Fahimeh Baroughi

    (Sahand University of Technology)

Abstract

This paper studies the robust vertex centdian location problem on tree networks with interval edge lengths. To obtain a robust solution, we use the minmax regret criterion. First, we obtain atmost n worst case scenario for each pair of vertices on tree networks. Then we reduce this number to $$ \log n $$ log n . Finally, the total time for obtaining a robust solution is equal to $$ O(n^{4}) $$ O ( n 4 ) . This time is reduced to $$ O(n^{3}\log n) $$ O ( n 3 log n ) by using the property of binary search tree and weighted centroid.

Suggested Citation

  • Soudabeh Seyyedi Ghomi & Fahimeh Baroughi, 2024. "Robust vertex centdian facility location problem on tree networks," Annals of Operations Research, Springer, vol. 341(2), pages 1135-1149, October.
    • Handle: RePEc:spr:annopr:v:341:y:2024:i:2:d:10.1007_s10479-024-06096-0
    DOI: 10.1007/s10479-024-06096-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-024-06096-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-024-06096-0?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. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    2. Constantine Toregas & Ralph Swain & Charles ReVelle & Lawrence Bergman, 1971. "The Location of Emergency Service Facilities," Operations Research, INFORMS, vol. 19(6), pages 1363-1373, October.
    3. Li, Hongmei & Luo, Taibo & Xu, Yinfeng & Xu, Jiuping, 2018. "Minimax regret vertex centdian location problem in general dynamic networks," Omega, Elsevier, vol. 75(C), pages 87-96.
    4. Igor Averbakh & Oded Berman, 2000. "Minmax Regret Median Location on a Network Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 104-110, May.
    5. Averbakh, Igor & Berman, Oded, 2000. "Algorithms for the robust 1-center problem on a tree," European Journal of Operational Research, Elsevier, vol. 123(2), pages 292-302, June.
    6. Jonathan Halpern, 1980. "Duality in the Cent-Dian of a Graph," Operations Research, INFORMS, vol. 28(3-part-ii), pages 722-735, June.
    7. Rainer Burkard & Helidon Dollani, 2002. "A Note on the Robust 1-Center Problem on Trees," Annals of Operations Research, Springer, vol. 110(1), pages 69-82, February.
    8. A. L. Soyster, 1973. "Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming," Operations Research, INFORMS, vol. 21(5), pages 1154-1157, October.
    9. Jonathan Halpern, 1978. "Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph," Management Science, INFORMS, vol. 24(5), pages 535-544, January.
    10. John M. Mulvey & Robert J. Vanderbei & Stavros A. Zenios, 1995. "Robust Optimization of Large-Scale Systems," Operations Research, INFORMS, vol. 43(2), pages 264-281, April.
    11. S. L. Hakimi, 1965. "Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems," Operations Research, INFORMS, vol. 13(3), pages 462-475, June.
    Full references (including those not matched with items on IDEAS)

    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. Li, Hongmei & Luo, Taibo & Xu, Yinfeng & Xu, Jiuping, 2018. "Minimax regret vertex centdian location problem in general dynamic networks," Omega, Elsevier, vol. 75(C), pages 87-96.
    2. Nikulin, Yury, 2006. "Robustness in combinatorial optimization and scheduling theory: An extended annotated bibliography," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 606, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Xuejie Bai & Yankui Liu, 2016. "Robust optimization of supply chain network design in fuzzy decision system," Journal of Intelligent Manufacturing, Springer, vol. 27(6), pages 1131-1149, December.
    4. Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 143-166, March.
    5. Hanks, Robert W. & Weir, Jeffery D. & Lunday, Brian J., 2017. "Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets," European Journal of Operational Research, Elsevier, vol. 262(2), pages 636-646.
    6. Donya Rahmani, 2019. "Designing a robust and dynamic network for the emergency blood supply chain with the risk of disruptions," Annals of Operations Research, Springer, vol. 283(1), pages 613-641, December.
    7. Amir Hossein Sadeghi & Ziyuan Sun & Amirreza Sahebi-Fakhrabad & Hamid Arzani & Robert Handfield, 2023. "A Mixed-Integer Linear Formulation for a Dynamic Modified Stochastic p-Median Problem in a Competitive Supply Chain Network Design," Logistics, MDPI, vol. 7(1), pages 1-24, March.
    8. Donya Rahmani & Arash Zandi & Sara Behdad & Arezou Entezaminia, 2021. "A light robust model for aggregate production planning with consideration of environmental impacts of machines," Operational Research, Springer, vol. 21(1), pages 273-297, March.
    9. Fang Xu & Mengfan Yan & Lun Wang & Shaojian Qu, 2022. "The Robust Emergency Medical Facilities Location-Allocation Models under Uncertain Environment: A Hybrid Approach," Sustainability, MDPI, vol. 15(1), pages 1-23, December.
    10. Dayanna Rodrigues da Cunha Nunes & Orivalde Soares da Silva Júnior & Renata Albergaria de Mello Bandeira & Yesus Emmanuel Medeiros Vieira, 2023. "A Robust Stochastic Programming Model for the Well Location Problem: The Case of The Brazilian Northeast Region," Sustainability, MDPI, vol. 15(14), pages 1-21, July.
    11. Bairamzadeh, Samira & Saidi-Mehrabad, Mohammad & Pishvaee, Mir Saman, 2018. "Modelling different types of uncertainty in biofuel supply network design and planning: A robust optimization approach," Renewable Energy, Elsevier, vol. 116(PA), pages 500-517.
    12. Shiva Zokaee & Armin Jabbarzadeh & Behnam Fahimnia & Seyed Jafar Sadjadi, 2017. "Robust supply chain network design: an optimization model with real world application," Annals of Operations Research, Springer, vol. 257(1), pages 15-44, October.
    13. Ghazaleh Ahmadi & Reza Tavakkoli-Moghaddam & Armand Baboli & Mehdi Najafi, 2022. "A decision support model for robust allocation and routing of search and rescue resources after earthquake: a case study," Operational Research, Springer, vol. 22(2), pages 1039-1081, April.
    14. Almaraj, Ismail I. & Trafalis, Theodore B., 2019. "An integrated multi-echelon robust closed- loop supply chain under imperfect quality production," International Journal of Production Economics, Elsevier, vol. 218(C), pages 212-227.
    15. Andreas Thorsen & Tao Yao, 2017. "Robust inventory control under demand and lead time uncertainty," Annals of Operations Research, Springer, vol. 257(1), pages 207-236, October.
    16. Enzo Sauma & Fernando Traub & Jorge Vera, 2015. "A Robust optimization approach to assess the effect of delays in the connection-to-the-grid time of new generation power plants over transmission expansion planning," Annals of Operations Research, Springer, vol. 229(1), pages 703-741, June.
    17. Mahmutoğulları, Özlem & Yaman, Hande, 2023. "Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty," European Journal of Operational Research, Elsevier, vol. 306(1), pages 173-188.
    18. Roya Soltani & Seyed J Sadjadi, 2014. "Reliability optimization through robust redundancy allocation models with choice of component type under fuzziness," Journal of Risk and Reliability, , vol. 228(5), pages 449-459, October.
    19. Wei Ding & Ke Qiu, 2018. "A quadratic time exact algorithm for continuous connected 2-facility location problem in trees," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1262-1298, November.
    20. Shuihua Han & Weina Ma & Ling Zhao & Xuelian Zhang & Ming K. Lim & Shuangyuan Yang & Stephen Leung, 2016. "A robust optimisation model for hybrid remanufacturing and manufacturing systems under uncertain return quality and market demand," International Journal of Production Research, Taylor & Francis Journals, vol. 54(17), pages 5056-5072, September.

    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:spr:annopr:v:341:y:2024:i:2:d:10.1007_s10479-024-06096-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.