IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v228y2025icp485-497.html
   My bibliography  Save this article

Finding the minimum k-weighted dominating sets using heuristic algorithms

Author

Listed:
  • Barrena, E.
  • Bermudo, S.
  • Hernández-Díaz, A.G.
  • López-Sánchez, A.D.
  • Zamudio, J.A.

Abstract

In this work, we propose, analyze, and solve a generalization of the k-dominating set problem in a graph, when we consider a weighted graph. Given a graph with weights in its edges, a set of vertices is a k-weighted dominating set if for every vertex outside the set, the sum of the weights from it to its adjacent vertices in the set is bigger than or equal to k. The k-weighted domination number is the minimum cardinality among all k-weighted dominating sets. Since the problem of finding the k-weighted domination number is NP-hard, we have proposed several problem-adapted construction and reconstruction techniques and embedded them in an Iterated Greedy algorithm. The resulting sixteen variants of the Iterated Greedy algorithm have been compared with an exact algorithm. Computational results show that the proposal is able to find optimal or near-optimal solutions within a short computational time. To the best of our knowledge, the k-weighted dominating set problem has never been studied before in the literature and, therefore, there is no other state-of-the-art algorithm to solve it. We have also included a comparison with a particular case of our problem, the minimum dominating set problem and, on average, we achieve same quality results within around 50% of computation time.

Suggested Citation

  • Barrena, E. & Bermudo, S. & Hernández-Díaz, A.G. & López-Sánchez, A.D. & Zamudio, J.A., 2025. "Finding the minimum k-weighted dominating sets using heuristic algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 228(C), pages 485-497.
  • Handle: RePEc:eee:matcom:v:228:y:2025:i:c:p:485-497
    DOI: 10.1016/j.matcom.2024.09.010
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.matcom.2024.09.010?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. Casado, A. & Bermudo, S. & López-Sánchez, A.D. & Sánchez-Oro, J., 2023. "An iterated greedy algorithm for finding the minimum dominating set in graphs," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 207(C), pages 41-58.
    2. Georgie D. M. Hyde, 1988. "South Korea," Palgrave Macmillan Books, Palgrave Macmillan, number 978-1-349-10039-2, October.
    3. Ruiz, Ruben & Stutzle, Thomas, 2007. "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2033-2049, March.
    4. Donald A. R. George, 1988. "Kuhn-Tucker theory," Palgrave Macmillan Books, in: Mathematical Modelling for Economists, chapter 3, pages 35-48, Palgrave Macmillan.
    5. Georgie D. M. Hyde, 1988. "Postscript: South Korea 1987," Palgrave Macmillan Books, in: South Korea, pages 221-225, Palgrave Macmillan.
    6. J. N. Hooker & R. S. Garfinkel & C. K. Chen, 1991. "Finite Dominating Sets for Network Location Problems," Operations Research, INFORMS, vol. 39(1), pages 100-118, February.
    7. Wyatt J. Desormeaux & Teresa W. Haynes & Michael A. Henning, 2013. "Edge lifting and total domination in graphs," Journal of Combinatorial Optimization, Springer, vol. 25(1), pages 47-59, January.
    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. Dung-Ying Lin & Tzu-Yun Huang, 2021. "A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem," Mathematics, MDPI, vol. 9(7), pages 1-20, April.
    2. Kuo-Ching Ying & Yi-Ju Tsai, 2017. "Minimising total cost for training and assigning multiskilled workers in production systems," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2978-2989, May.
    3. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    4. Rafael Suárez-Vega & Dolores Santos-Peñate & Pablo Dorta-González, 2014. "Location and quality selection for new facilities on a network market," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 52(2), pages 537-560, March.
    5. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    6. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    7. Yepes-Borrero, Juan C. & Perea, Federico & Ruiz, Rubén & Villa, Fulgencia, 2021. "Bi-objective parallel machine scheduling with additional resources during setups," European Journal of Operational Research, Elsevier, vol. 292(2), pages 443-455.
    8. 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.
    9. Sioud, A. & Gagné, C., 2018. "Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 264(1), pages 66-73.
    10. Gang Xuan & Win-Chin Lin & Shuenn-Ren Cheng & Wei-Lun Shen & Po-An Pan & Chih-Ling Kuo & Chin-Chia Wu, 2022. "A Robust Single-Machine Scheduling Problem with Two Job Parameter Scenarios," Mathematics, MDPI, vol. 10(13), pages 1-17, June.
    11. Lin, Zhenhong & Ogden, Joan & Fan, Yueyue & Chen, Chien-Wei, 2009. "The Fuel-Travel-Back Approach to Hydrogen Station Siting," Institute of Transportation Studies, Working Paper Series qt14p44238, Institute of Transportation Studies, UC Davis.
    12. A. Rodríguez-Chía & J. Puerto & D. Pérez-Brito & J. Moreno, 2005. "Thep-facility ordered median problem on networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 13(1), pages 105-126, June.
    13. Fatemeh Sabouhi & Ali Bozorgi-Amiri & Mohammad Moshref-Javadi & Mehdi Heydari, 2019. "An integrated routing and scheduling model for evacuation and commodity distribution in large-scale disaster relief operations: a case study," Annals of Operations Research, Springer, vol. 283(1), pages 643-677, December.
    14. Samavati, Mehran & Essam, Daryl & Nehring, Micah & Sarker, Ruhul, 2018. "A new methodology for the open-pit mine production scheduling problem," Omega, Elsevier, vol. 81(C), pages 169-182.
    15. Robert Cromley & Dean Hanink, 2008. "Population growth and the development of a central place system," Journal of Geographical Systems, Springer, vol. 10(4), pages 383-405, December.
    16. Gnägi, M. & Strub, O., 2020. "Tracking and outperforming large stock-market indices," Omega, Elsevier, vol. 90(C).
    17. 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.
    18. Zhou, Hong & Cheung, Waiman & Leung, Lawrence C., 2009. "Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm," European Journal of Operational Research, Elsevier, vol. 194(3), pages 637-649, May.
    19. Hatami, Sara & Ruiz, Rubén & Andrés-Romano, Carlos, 2015. "Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times," International Journal of Production Economics, Elsevier, vol. 169(C), pages 76-88.
    20. Libralesso, Luc & Focke, Pablo Andres & Secardin, Aurélien & Jost, Vincent, 2022. "Iterative beam search algorithms for the permutation flowshop," European Journal of Operational Research, Elsevier, vol. 301(1), pages 217-234.

    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:matcom:v:228:y:2025:i:c:p:485-497. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.