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

New genetic algorithm approach for the min-degree constrained minimum spanning tree

Author

Listed:
  • Salgueiro, Rui
  • de Almeida, Ana
  • Oliveira, Orlando

Abstract

A novel approach is proposed for the NP-hard min-degree constrained minimum spanning tree (md-MST). The NP-hardness of the md-MST demands that heuristic approximations are used to tackle its intractability and thus an original genetic algorithm strategy is described using an improvement of the Martins–Souza heuristic to obtain a md-MST feasible solution, which is also presented. The genetic approach combines the latter improvement with three new approximations based on different chromosome representations for trees that employ diverse crossover operators. The genetic versions compare very favourably with the best known results in terms of both the run time and obtaining better quality solutions. In particular, new lower bounds are established for instances with higher dimensions.

Suggested Citation

  • Salgueiro, Rui & de Almeida, Ana & Oliveira, Orlando, 2017. "New genetic algorithm approach for the min-degree constrained minimum spanning tree," European Journal of Operational Research, Elsevier, vol. 258(3), pages 877-886.
    • Handle: RePEc:eee:ejores:v:258:y:2017:i:3:p:877-886
    DOI: 10.1016/j.ejor.2016.11.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716309134
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.11.007?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.

    Citations

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


    Cited by:

    1. Turan, Hasan Hüseyin & Jalalvand, Fatemeh & Elsawah, Sondoss & Ryan, Michael J., 2022. "A joint problem of strategic workforce planning and fleet renewal: With an application in defense," European Journal of Operational Research, Elsevier, vol. 296(2), pages 615-634.
    2. Weinand, Jann Michael & Kleinebrahm, Max & McKenna, Russell & Mainzer, Kai & Fichtner, Wolf, 2019. "Developing a combinatorial optimisation approach to design district heating networks based on deep geothermal energy," Applied Energy, Elsevier, vol. 251(C), pages 1-1.
    3. Singh, Kavita & Sundar, Shyam, 2019. "A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 276(1), pages 88-105.

    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:258:y:2017:i:3:p:877-886. 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: 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.