IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v24y2018i3d10.1007_s10732-017-9342-0.html
   My bibliography  Save this article

A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem

Author

Listed:
  • Alejandro Arbelaez

    (University College Cork)

  • Deepak Mehta

    (University College Cork)

  • Barry O’Sullivan

    (University College Cork)

  • Luis Quesada

    (University College Cork)

Abstract

Many network design problems arising in areas as diverse as VLSI circuit design, QoS routing, traffic engineering, and computational sustainability require clients to be connected to a facility under path-length constraints and budget limits. These problems can be seen as instances of the rooted distance-constrained minimum spanning-tree problem (RDCMST), which is NP-hard. An inherent feature of these networks is that they are vulnerable to a failure. Therefore, it is often important to ensure that all clients are connected to two or more facilities via edge-disjoint paths. We call this problem the edge-disjoint RDCMST (ERDCMST). Previous work on the RDCMST has focused on dedicated algorithms and therefore it is difficult to use these algorithms to tackle the ERDCMST. We present a constraint-based parallel local search algorithm for solving the ERDCMST. Traditional ways of extending a sequential algorithm to run in parallel perform either portfolio-based search in parallel or parallel neighbourhood search. Instead, we exploit the semantics of the constraints of the problem to perform multiple moves in parallel by ensuring that they are mutually independent. The ideas presented in this paper are general and can be adapted to other problems as well. The effectiveness of our approach is demonstrated by experimenting with a set of problem instances taken from real-world passive optical network deployments in Ireland, Italy, and the UK. Our results show that performing moves in parallel can significantly reduce the elapsed time and improve the quality of the solutions of our local search approach.

Suggested Citation

  • Alejandro Arbelaez & Deepak Mehta & Barry O’Sullivan & Luis Quesada, 2018. "A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem," Journal of Heuristics, Springer, vol. 24(3), pages 359-394, June.
    • Handle: RePEc:spr:joheur:v:24:y:2018:i:3:d:10.1007_s10732-017-9342-0
    DOI: 10.1007/s10732-017-9342-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-017-9342-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-017-9342-0?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. M.G.A. Verhoeven & M.E.M. Severens, 1999. "Parallel local search for Steiner trees in graphs," Annals of Operations Research, Springer, vol. 90(0), pages 185-202, January.
    2. Charlotte Truchet & Alejandro Arbelaez & Florian Richoux & Philippe Codognet, 2016. "Estimating parallel runtimes for randomized algorithms in constraint solving," Journal of Heuristics, Springer, vol. 22(4), pages 613-648, August.
    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. Sultan Almotairi & Elsayed Badr & Mustafa Abdul Salam & Hagar Ahmed, 2023. "Breast Cancer Diagnosis Using a Novel Parallel Support Vector Machine with Harris Hawks Optimization," Mathematics, MDPI, vol. 11(14), pages 1-25, July.

    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:spr:joheur:v:24:y:2018:i:3:d:10.1007_s10732-017-9342-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.