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

Efficient approaches for the Flooding Problem on graphs

Author

Listed:
  • André Renato Villela Silva

    (Universidade Federal Fluminense - Instituto de Ciência e Tecnologia)

  • Luiz Satoru Ochi

    (Universidade Federal Fluminense - Instituto de Computação)

  • Bruno José da Silva Barros

    (Universidade Federal Rural de Pernambuco - Unidade Acadêmica de Garanhuns)

  • Rian Gabriel S. Pinheiro

    (Universidade Federal Rural de Pernambuco - Unidade Acadêmica de Garanhuns)

Abstract

This paper deals with the Flooding Problem on graphs. This problem consists in finding the shortest sequence of flooding moves that turns a colored graph into a monochromatic one. The problem has applications in some areas as disease propagation, for example. Three metaheuristics versions are proposed and compared with the literature results. A new integer programming formulation is also proposed and tested with the only formulation known. The obtained results indicate that both the proposed formulation and the Evolutionary Algorithm are, respectively, the best exact and heuristic approaches for the problem.

Suggested Citation

  • André Renato Villela Silva & Luiz Satoru Ochi & Bruno José da Silva Barros & Rian Gabriel S. Pinheiro, 2020. "Efficient approaches for the Flooding Problem on graphs," Annals of Operations Research, Springer, vol. 286(1), pages 33-54, March.
  • Handle: RePEc:spr:annopr:v:286:y:2020:i:1:d:10.1007_s10479-018-2796-0
    DOI: 10.1007/s10479-018-2796-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-2796-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-018-2796-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. George Henrique Godim Fonseca & Haroldo Gambini Santos & Túlio Ângelo Machado Toffolo & Samuel Souza Brito & Marcone Jamilson Freitas Souza, 2016. "GOAL solver: a hybrid local search based solver for high school timetabling," Annals of Operations Research, Springer, vol. 239(1), pages 77-97, April.
    2. F. Stefanello & L. S. Buriol & M. J. Hirsch & P. M. Pardalos & T. Querido & M. G. C. Resende & M. Ritt, 2017. "On the minimization of traffic congestion in road networks with tolls," Annals of Operations Research, Springer, vol. 249(1), pages 119-139, February.
    3. Sabar, Nasser R. & Kendall, Graham, 2015. "An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem," Omega, Elsevier, vol. 56(C), pages 88-98.
    4. López-Ibáñez, Manuel & Dubois-Lacoste, Jérémie & Pérez Cáceres, Leslie & Birattari, Mauro & Stützle, Thomas, 2016. "The irace package: Iterated racing for automatic algorithm configuration," Operations Research Perspectives, Elsevier, vol. 3(C), pages 43-58.
    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. Drake, John H. & Kheiri, Ahmed & Özcan, Ender & Burke, Edmund K., 2020. "Recent advances in selection hyper-heuristics," European Journal of Operational Research, Elsevier, vol. 285(2), pages 405-428.
    2. Asghari, Mohammad & Jaber, Mohamad Y. & Mirzapour Al-e-hashem, S.M.J., 2023. "Coordinating vessel recovery actions: Analysis of disruption management in a liner shipping service," European Journal of Operational Research, Elsevier, vol. 307(2), pages 627-644.
    3. Alex Gliesch & Marcus Ritt, 2022. "A new heuristic for finding verifiable k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 28(1), pages 61-91, February.
    4. Véronique François & Yasemin Arda & Yves Crama, 2019. "Adaptive Large Neighborhood Search for Multitrip Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 53(6), pages 1706-1730, November.
    5. Molenbruch, Yves & Braekers, Kris & Caris, An, 2017. "Benefits of horizontal cooperation in dial-a-ride services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 97-119.
    6. Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
    7. Weiner, Jake & Ernst, Andreas T. & Li, Xiaodong & Sun, Yuan & Deb, Kalyanmoy, 2021. "Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid," European Journal of Operational Research, Elsevier, vol. 293(3), pages 847-862.
    8. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    9. Pagnozzi, Federico & Stützle, Thomas, 2019. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems," European Journal of Operational Research, Elsevier, vol. 276(2), pages 409-421.
    10. Rodriguez-Tello, Eduardo & Lardeux, Frédéric & Duarte, Abraham & Narvaez-Teran, Valentina, 2019. "Alternative evaluation functions for the cyclic bandwidth sum problem," European Journal of Operational Research, Elsevier, vol. 273(3), pages 904-919.
    11. Marco Corazza & Giacomo di Tollo & Giovanni Fasano & Raffaele Pesenti, 2021. "A novel hybrid PSO-based metaheuristic for costly portfolio selection problems," Annals of Operations Research, Springer, vol. 304(1), pages 109-137, September.
    12. Speetzen, N. & Richter, P., 2021. "Dynamic aiming strategy for central receiver systems," Renewable Energy, Elsevier, vol. 180(C), pages 55-67.
    13. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.
    14. Alexander E. I. Brownlee & Michael G. Epitropakis & Jeroen Mulder & Marc Paelinck & Edmund K. Burke, 2022. "A systematic approach to parameter optimization and its application to flight schedule simulation software," Journal of Heuristics, Springer, vol. 28(4), pages 509-538, August.
    15. Alfaro-Fernández, Pedro & Ruiz, Rubén & Pagnozzi, Federico & Stützle, Thomas, 2020. "Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems," European Journal of Operational Research, Elsevier, vol. 282(3), pages 835-845.
    16. Mohammad Asghari & Seyed Mohammad Javad Mirzapour Al-E-Hashem & Yacine Rekik, 2022. "Environmental and social implications of incorporating carpooling service on a customized bus system," Post-Print hal-03598768, HAL.
    17. Eng, KaiLun & Muhammed, Abdullah & Mohamed, Mohamad Afendee & Hasan, Sazlinah, 2020. "A hybrid heuristic of Variable Neighbourhood Descent and Great Deluge algorithm for efficient task scheduling in Grid computing," European Journal of Operational Research, Elsevier, vol. 284(1), pages 75-86.
    18. Patrick Gerhards, 2020. "The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 901-933, December.
    19. GALARZA MONTENEGRO, Bryan David & SÖRENSEN, Kenneth & VANSTEENWEGEN, Pieter, 2023. "A demand-responsive feeder service with a maximum headway at mandatory stops," Working Papers 2023001, University of Antwerp, Faculty of Business and Economics.
    20. Monira Essa Aloud, 2020. "The role of attribute selection in Deep ANNs learning framework for high‐frequency financial trading," Intelligent Systems in Accounting, Finance and Management, John Wiley & Sons, Ltd., vol. 27(2), pages 43-54, April.

    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:286:y:2020:i:1:d:10.1007_s10479-018-2796-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.