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

A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem

Author

Listed:
  • Singh, Kavita
  • Sundar, Shyam

Abstract

Given an undirected, connected and edge-weighted graph, the min-degree constrained minimum spanning tree (md-MST) problem aims to find a minimum spanning tree (T) in such a way that each non-leaf vertex in T has degree at least d, where d is given a positive integer constant. This paper proposes a hybrid steady-state genetic algorithm (HSSGA) for the md-MST problem. The proposed HSSGA combines various components – such as problem-specific genetic operators (crossover operator and mutation operator) that are designed in such a way that the min-degree constraint is always maintained, hence resulting into a feasible child solution; and a population updating strategy that helps in maintaining diversity in the population – of the steady-state genetic algorithm with a fast local search. On a set of standard benchmark instances, the proposed HSSGA shows its effectiveness in comparison to state-of-the-art approaches such as four versions of variable neighborhood search, branch and cut algorithm and three versions of generational genetic algorithm. Moreover, HSSGA finds new best values on 32 out of 105 benchmark instances.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:276:y:2019:i:1:p:88-105
    DOI: 10.1016/j.ejor.2019.01.002
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2019.01.002?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. Cerrone, C. & Cerulli, R. & Raiconi, A., 2014. "Relations, models and a memetic approach for three degree-dependent spanning tree problems," European Journal of Operational Research, Elsevier, vol. 232(3), pages 442-453.
    2. 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.
    3. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
    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. 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.
    2. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    3. Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "Minimizing fleet operating costs for a container transportation company," European Journal of Operational Research, Elsevier, vol. 171(3), pages 776-786, June.
    4. Rita Portugal & Helena Ramalhinho-Lourenço & José P. Paixao, 2006. "Driver scheduling problem modelling," Economics Working Papers 991, Department of Economics and Business, Universitat Pompeu Fabra.
    5. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    6. Mhand Hifi & Slim Sadfi & Abdelkader Sbihi, 2004. "An Exact Algorithm for the Multiple-choice Multidimensional Knapsack Problem," Post-Print halshs-03322716, HAL.
    7. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    8. Li, Gang & Jiang, Hongxun & He, Tian, 2015. "A genetic algorithm-based decomposition approach to solve an integrated equipment-workforce-service planning problem," Omega, Elsevier, vol. 50(C), pages 1-17.
    9. Mohamed Kashkoush & Hoda ElMaraghy, 2017. "An integer programming model for discovering associations between manufacturing system capabilities and product features," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 1031-1044, April.
    10. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    11. Seona Lee & Sang-Ho Lee & HyungJune Lee, 2020. "Timely directional data delivery to multiple destinations through relay population control in vehicular ad hoc network," International Journal of Distributed Sensor Networks, , vol. 16(5), pages 15501477209, May.
    12. Hertz, Alain & Kobler, Daniel, 2000. "A framework for the description of evolutionary algorithms," European Journal of Operational Research, Elsevier, vol. 126(1), pages 1-12, October.
    13. Amir Khakbaz & Ali Nookabadi & S. Shetab-bushehri, 2013. "A Model for Locating Park-and-Ride Facilities on Urban Networks Based on Maximizing Flow Capture: A Case Study of Isfahan, Iran," Networks and Spatial Economics, Springer, vol. 13(1), pages 43-66, March.
    14. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    15. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
    16. Lingping Kong & Jeng-Shyang Pan & Václav Snášel & Pei-Wei Tsai & Tien-Wen Sung, 2018. "An energy-aware routing protocol for wireless sensor network based on genetic algorithm," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 67(3), pages 451-463, March.
    17. 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.
    18. Saydam, Cem & Aytug, Haldun, 2003. "Accurate estimation of expected coverage: revisited," Socio-Economic Planning Sciences, Elsevier, vol. 37(1), pages 69-80, March.
    19. Grossman, Tal & Wool, Avishai, 1997. "Computational experience with approximation algorithms for the set covering problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 81-92, August.
    20. Cochran, Jeffery K. & Marquez Uribe, Alberto, 2005. "A set covering formulation for agile capacity planning within supply chains," International Journal of Production Economics, Elsevier, vol. 95(2), pages 139-149, February.

    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:276:y:2019:i:1:p:88-105. 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.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.