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, December.
    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. Tsouros, C. & Satratzemi, M., 1996. "Optimal solution of a total time distribution problem," International Journal of Production Economics, Elsevier, vol. 45(1-3), pages 473-478, August.
    2. 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.
    3. 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.
    4. Marilène Cherkesly & Claudio Contardo, 2021. "The conditional p-dispersion problem," Journal of Global Optimization, Springer, vol. 81(1), pages 23-83, September.
    5. Kong, Hanzhang & Kang, Qinma & Li, Wenquan & Liu, Chao & Kang, Yunfan & He, Hong, 2019. "A hybrid iterated carousel greedy algorithm for community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    6. Eliş, Haluk & Tansel, Barbaros & Oğuz, Osman & Güney, Mesut & Kian, Ramez, 2021. "On guarding real terrains: The terrain guarding and the blocking path problems," Omega, Elsevier, vol. 102(C).
    7. Barry B. Barrios & Quim Castellà & Angel A. Juan & Manuel Mateo, 2015. "ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem," Working Papers 636, Barcelona School of Economics.
    8. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    9. E. Carrizosa & E. Conde & M. Muñoz-Márquez, 1998. "Admission Policies in Loss Queueing Models with Heterogeneous Arrivals," Management Science, INFORMS, vol. 44(3), pages 311-320, March.
    10. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    11. 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.
    12. Haluk Eliş, 2017. "A finite dominating set of cardinality O(k) and a witness set of cardinality O(n) for 1.5D terrain guarding problem," Annals of Operations Research, Springer, vol. 254(1), pages 37-46, July.
    13. Yong Wang & Yuting Wang & Yuyan Han, 2023. "A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem," Mathematics, MDPI, vol. 11(11), pages 1-25, May.
    14. García-Martínez, C. & Rodriguez, F.J. & Lozano, M., 2014. "Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 232(3), pages 454-463.
    15. 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.
    16. 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.
    17. 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.
    18. Morais, Rafael & Bulhões, Teobaldo & Subramanian, Anand, 2024. "Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates," European Journal of Operational Research, Elsevier, vol. 315(2), pages 442-453.
    19. 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.
    20. Chun-Lung Chen, 2023. "An Iterated Population-Based Metaheuristic for Order Acceptance and Scheduling in Unrelated Parallel Machines with Several Practical Constraints," Mathematics, MDPI, vol. 11(6), pages 1-14, 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: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.