IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v312y2024i3p1146-1167.html
   My bibliography  Save this article

Optimization models for cloud seeding network design and operations

Author

Listed:
  • Sadeghi, Mohammad
  • Yaghoubi, Saeed

Abstract

Water shortage has become a significant challenge in many regions, affecting sectors such as agriculture, energy, industry, and the economy. Based on this subject matter and considering cloud seeding as an emerged water achieving promising technique, this paper provides an effective and innovative optimization approach for cloud seeding. This approach involves location analysis and operational planning, which offers significant potential for addressing water shortage challenges. The proposed approach considers atmospheric conditions, functional properties of facilities, seeding method variants, and cloud seeding system vulnerabilities as strategic programming for integrated facility network design. Additionally, operational planning, including flight routing and ground-based facility scheduling during rainfall storms, is considered to manipulate storms according to atmospheric conditions and systemic/facility operational constraints. To this end, the paper proposes a multi-objective mixed-integer linear programming model for facility location, which uses an innovative and application depended point-to-polygon covering algorithm, with the principal objective of maximization of spatial coverage. Moreover, a bi-objective mixed-integer linear programming model for seeding operations is developed based on the optimally located facilities in the strategic model, which uses an innovative line-to-polygon covering algorithm. The first objective of this model is to maximize precipitation augmentation, while the second objective of the both models is to minimize total system-wide costs. Finally, the applications of the proposed models and the managerial insights are also illustrated in a real case study domain.

Suggested Citation

  • Sadeghi, Mohammad & Yaghoubi, Saeed, 2024. "Optimization models for cloud seeding network design and operations," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1146-1167.
  • Handle: RePEc:eee:ejores:v:312:y:2024:i:3:p:1146-1167
    DOI: 10.1016/j.ejor.2023.07.041
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723006008
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2023.07.041?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. Leibowicz, Benjamin D., 2020. "Urban land use and transportation planning for climate change mitigation: A theoretical framework," European Journal of Operational Research, Elsevier, vol. 284(2), pages 604-616.
    2. Erdemir, Elif Tokar & Batta, Rajan & Spielman, Seth & Rogerson, Peter A. & Blatt, Alan & Flanigan, Marie, 2008. "Location coverage models with demand originating from nodes and paths: Application to cellular network design," European Journal of Operational Research, Elsevier, vol. 190(3), pages 610-632, November.
    3. Tsionas, Mike G., 2019. "Multi-objective optimization using statistical models," European Journal of Operational Research, Elsevier, vol. 276(1), pages 364-378.
    4. He, Zhou & Fan, Bo & Cheng, T.C.E. & Wang, Shou-Yang & Tan, Chin-Hon, 2016. "A mean-shift algorithm for large-scale planar maximal covering location problems," European Journal of Operational Research, Elsevier, vol. 250(1), pages 65-76.
    5. Rongrong Li & Yee Leung, 2011. "Multi-objective route planning for dangerous goods using compromise programming," Journal of Geographical Systems, Springer, vol. 13(3), pages 249-271, September.
    6. Defryn, Christof & Sörensen, Kenneth, 2018. "Multi-objective optimisation models for the travelling salesman problem with horizontal cooperation," European Journal of Operational Research, Elsevier, vol. 267(3), pages 891-903.
    7. Karatas, Mumtaz, 2017. "A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1040-1051.
    8. Richard L. Church & Kenneth L. Roberts, 1983. "Generalized Coverage Models And Public Facility Location," Papers in Regional Science, Wiley Blackwell, vol. 53(1), pages 117-135, January.
    9. Murray, Alan T. & Church, Richard L. & Feng, Xin, 2020. "Single facility siting involving allocation decisions," European Journal of Operational Research, Elsevier, vol. 284(3), pages 834-846.
    10. Zhong, Shaopeng & Jiang, Yu & Nielsen, Otto Anker, 2022. "Lexicographic multi-objective road pricing optimization considering land use and transportation effects," European Journal of Operational Research, Elsevier, vol. 298(2), pages 496-509.
    11. Byrne, Thomas & Kalcsics, Jörg, 2022. "Conditional facility location problems with continuous demand and a polygonal barrier," European Journal of Operational Research, Elsevier, vol. 296(1), pages 22-43.
    12. Alan Murray, 2010. "Advances in location modeling: GIS linkages and contributions," Journal of Geographical Systems, Springer, vol. 12(3), pages 335-354, September.
    13. Murray, Alan T. & Wei, Ran, 2013. "A computational approach for eliminating error in the solution of the location set covering problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 52-64.
    14. Berman, Oded & Krass, Dmitry & Drezner, Zvi, 2003. "The gradual covering decay location problem on a network," European Journal of Operational Research, Elsevier, vol. 151(3), pages 474-480, December.
    15. Rau, Hsin & Budiman, Syarif Daniel & Widyadana, Gede Agus, 2018. "Optimization of the multi-objective green cyclical inventory routing problem using discrete multi-swarm PSO method," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 120(C), pages 51-75.
    16. Richard Church & Charles R. Velle, 1974. "The Maximal Covering Location Problem," Papers in Regional Science, Wiley Blackwell, vol. 32(1), pages 101-118, January.
    17. Baldomero-Naranjo, Marta & Kalcsics, Jörg & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2022. "Upgrading edges in the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 303(1), pages 14-36.
    18. Various, 1973. "Conference Programs," NBER Chapters, in: The New Realities of the Business Cycle, pages 126-131, National Bureau of Economic Research, Inc.
    19. Yue Zhang & Qi Zhang & Arash Farnoosh & Siyuan Chen & Yan Li, 2019. "GIS-Based Multi-Objective Particle Swarm Optimization of charging stations for electric vehicles," Post-Print hal-02009151, HAL.
    20. Ensafian, Hamidreza & Yaghoubi, Saeed, 2017. "Robust optimization model for integrated procurement, production and distribution in platelet supply chain," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 32-55.
    21. Dylan Jones & Mehrdad Tamiz, 2016. "A Review of Goal Programming," International Series in Operations Research & Management Science, in: Salvatore Greco & Matthias Ehrgott & José Rui Figueira (ed.), Multiple Criteria Decision Analysis, edition 2, chapter 0, pages 903-926, Springer.
    22. Kalyanmoy Deb & Kalyanmoy Deb, 2014. "Multi-objective Optimization," Springer Books, in: Edmund K. Burke & Graham Kendall (ed.), Search Methodologies, edition 2, chapter 0, pages 403-449, Springer.
    23. Zhang, Yue & Zhang, Qi & Farnoosh, Arash & Chen, Siyuan & Li, Yan, 2019. "GIS-Based Multi-Objective Particle Swarm Optimization of charging stations for electric vehicles," Energy, Elsevier, vol. 169(C), pages 844-853.
    24. Alexandris, George & Giannikos, Ioannis, 2010. "A new model for maximal coverage exploiting GIS capabilities," European Journal of Operational Research, Elsevier, vol. 202(2), pages 328-338, April.
    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. Ran Wei, 2016. "Coverage Location Models," International Regional Science Review, , vol. 39(1), pages 48-76, January.
    2. Wang, Wei & Wu, Shining & Wang, Shuaian & Zhen, Lu & Qu, Xiaobo, 2021. "Emergency facility location problems in logistics: Status and perspectives," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    3. Alan T. Murray, 2016. "Maximal Coverage Location Problem," International Regional Science Review, , vol. 39(1), pages 5-27, January.
    4. Murray, Alan T. & Feng, Xin, 2016. "Public street lighting service standard assessment and achievement," Socio-Economic Planning Sciences, Elsevier, vol. 53(C), pages 14-22.
    5. Tammy Drezner & Zvi Drezner, 2019. "Cooperative Cover of Uniform Demand," Networks and Spatial Economics, Springer, vol. 19(3), pages 819-831, September.
    6. Erhan Erkut & Armann Ingolfsson & Güneş Erdoğan, 2008. "Ambulance location for maximum survival," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(1), pages 42-58, February.
    7. Muren, & Li, Hao & Mukhopadhyay, Samar K. & Wu, Jian-jun & Zhou, Li & Du, Zhiping, 2020. "Balanced maximal covering location problem and its application in bike-sharing," International Journal of Production Economics, Elsevier, vol. 223(C).
    8. Tony H. Grubesic & Timothy C. Matisziw & Alan T. Murray, 2011. "Market Coverage and Service Quality in Digital Subscriber Lines Infrastructure Planning," International Regional Science Review, , vol. 34(3), pages 368-390, July.
    9. Chen, Liang & Chen, Sheng-Jie & Chen, Wei-Kun & Dai, Yu-Hong & Quan, Tao & Chen, Juan, 2023. "Efficient presolving methods for solving maximal covering and partial set covering location problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 73-87.
    10. Karatas, Mumtaz & Eriskin, Levent, 2021. "The minimal covering location and sizing problem in the presence of gradual cooperative coverage," European Journal of Operational Research, Elsevier, vol. 295(3), pages 838-856.
    11. Ran Wei & Alan Murray & Rajan Batta, 2014. "A bounding-based solution approach for the continuous arc covering problem," Journal of Geographical Systems, Springer, vol. 16(2), pages 161-182, April.
    12. Huanfa Chen & Alan T. Murray & Rui Jiang, 2021. "Open-source approaches for location cover models: capabilities and efficiency," Journal of Geographical Systems, Springer, vol. 23(3), pages 361-380, July.
    13. Huizhu Wang & Jianqin Zhou, 2023. "Location of Railway Emergency Rescue Spots Based on a Near-Full Covering Problem: From a Perspective of Diverse Scenarios," Sustainability, MDPI, vol. 15(8), pages 1-16, April.
    14. Youssef Amry & Elhoussin Elbouchikhi & Franck Le Gall & Mounir Ghogho & Soumia El Hani, 2022. "Electric Vehicle Traction Drives and Charging Station Power Electronics: Current Status and Challenges," Energies, MDPI, vol. 15(16), pages 1-30, August.
    15. Jiwon Baik & Alan T. Murray, 2022. "Locating a facility to simultaneously address access and coverage goals," Papers in Regional Science, Wiley Blackwell, vol. 101(5), pages 1199-1217, October.
    16. Arana-Jiménez, Manuel & Blanco, Víctor & Fernández, Elena, 2020. "On the fuzzy maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 283(2), pages 692-705.
    17. Zhou, Guangyou & Zhu, Zhiwei & Luo, Sumei, 2022. "Location optimization of electric vehicle charging stations: Based on cost model and genetic algorithm," Energy, Elsevier, vol. 247(C).
    18. Mariana de Oliveira Lage & Cláudia Aparecida Soares Machado & Cristiano Martins Monteiro & Clodoveu Augusto Davis & Charles Lincoln Kenji Yamamura & Fernando Tobal Berssaneti & José Alberto Quintanilh, 2021. "Using Hierarchical Facility Location, Single Facility Approach, and GIS in Carsharing Services," Sustainability, MDPI, vol. 13(22), pages 1-13, November.
    19. Huizhu Wang & Jianqin Zhou & Ling Zhou, 2024. "A Lattice Boltzmann Method-like Algorithm for the Maximal Covering Location Problem on the Complex Network: Application to Location of Railway Emergency-Rescue Spot," Mathematics, MDPI, vol. 12(2), pages 1-20, January.
    20. Vatsa, Amit Kumar & Jayaswal, Sachin, 2015. "A New Formulation and Benders' Decomposition for Multi-period facility Location Problem with Server Uncertainty," IIMA Working Papers WP2015-02-07, Indian Institute of Management Ahmedabad, Research and Publication Department.

    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:ejores:v:312:y:2024:i:3:p:1146-1167. 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/locate/eor .

    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.