IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i3p222-d209600.html
   My bibliography  Save this article

A Novel Hybrid Algorithm for Minimum Total Dominating Set Problem

Author

Listed:
  • Fuyu Yuan

    (School of Computer Science and Information Technology, Northeast Normal University, Changchun 130000, China)

  • Chenxi Li

    (School of Computer Science and Information Technology, Northeast Normal University, Changchun 130000, China)

  • Xin Gao

    (School of Computer Science and Information Technology, Northeast Normal University, Changchun 130000, China)

  • Minghao Yin

    (School of Computer Science and Information Technology, Northeast Normal University, Changchun 130000, China)

  • Yiyuan Wang

    (School of Computer Science and Information Technology, Northeast Normal University, Changchun 130000, China)

Abstract

The minimum total dominating set (MTDS) problem is a variant of the classical dominating set problem. In this paper, we propose a hybrid evolutionary algorithm, which combines local search and genetic algorithm to solve MTDS. Firstly, a novel scoring heuristic is implemented to increase the searching effectiveness and thus get better solutions. Specially, a population including several initial solutions is created first to make the algorithm search more regions and then the local search phase further improves the initial solutions by swapping vertices effectively. Secondly, the repair-based crossover operation creates new solutions to make the algorithm search more feasible regions. Experiments on the classical benchmark DIMACS are carried out to test the performance of the proposed algorithm, and the experimental results show that our algorithm performs much better than its competitor on all instances.

Suggested Citation

  • Fuyu Yuan & Chenxi Li & Xin Gao & Minghao Yin & Yiyuan Wang, 2019. "A Novel Hybrid Algorithm for Minimum Total Dominating Set Problem," Mathematics, MDPI, vol. 7(3), pages 1-11, February.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:3:p:222-:d:209600
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/3/222/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/3/222/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lihe Guan & Hong Wang, 2022. "A heuristic approximation algorithm of minimum dominating set based on rough set theory," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 752-769, August.
    2. José Alejandro Cornejo Acosta & Jesús García Díaz & Ricardo Menchaca-Méndez & Rolando Menchaca-Méndez, 2020. "Solving the Capacitated Vertex K-Center Problem through the Minimum Capacitated Dominating Set Problem," Mathematics, MDPI, vol. 8(9), pages 1-16, September.
    3. Pedro Pinacho-Davidson & Christian Blum, 2020. "Barrakuda : A Hybrid Evolutionary Algorithm for Minimum Capacitated Dominating Set Problem," Mathematics, MDPI, vol. 8(11), pages 1-26, October.

    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:gam:jmathe:v:7:y:2019:i:3:p:222-:d:209600. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.