A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem

  • Alejandro ArbelaezEmail author
  • Deepak Mehta
  • Barry O’Sullivan
  • Luis Quesada
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9075)


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 modelled as 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 works on RDCMST have focused on dedicated algorithms which are hard to extend with side constraints, and therefore these algorithms cannot be extended for solving ERDCMST. We present a constraint-based local search algorithm for which we present two efficient local move operators and an incremental way of maintaining objective function. Our local search algorithm can easily be extended and it is able to solve both problems. 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, the UK, and Italy. We compare our approach with existing exact and heuristic approaches. Results show that our approach is superior to both of the latter in terms of scalability and its anytime behaviour.


Local Search Span Tree Local Search Algorithm Network Design Problem Move Operator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Payne, D.B.: FTTP deployment options and economic challenges. In: Proceedings of the 36th European Conference and Exhibition on Optical Communication (ECOC 2009) (2009)Google Scholar
  2. 2.
    Oh, J., Pyo, I., Pedram, M.: Constructing minimal spanning/steiner trees with bounded path length. Integration 22(1–2), 137–163 (1997)zbMATHGoogle Scholar
  3. 3.
    Ruthmair, M., Raidl, G.R.: A kruskal-based heuristic for the rooted delay-constrained minimum spanning tree problem. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2009. LNCS, vol. 5717, pp. 713–720. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  4. 4.
    Gomes, C.P.: Computational sustainability: Computational methods for a sustainableenvironment, economy, and society. The Bridge 39(4), 5–13 (2009)Google Scholar
  5. 5.
    Leitner, M., Ruthmair, M., Raidl, G.R.: Stabilized branch-and-price for the rooted delay-constrained steiner tree problem. In: Pahl, J., Reiners, T., Voß, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 124–138. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  6. 6.
    Ruthmair, M., Raidl, G.R.: Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6239, pp. 391–400. Springer, Heidelberg (2010) Google Scholar
  7. 7.
    Hoos, H., Stütze, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann (2005)Google Scholar
  8. 8.
    Hentenryck, P.V., Michel, L.: Constraint-based local search. The MIT Press (2009)Google Scholar
  9. 9.
    Pham, Q.D., Deville, Y., Hentenryck, P.V.: Ls(graph): a constraint-based local search for constraint optimization on trees and paths. Constraints 17(4), 357–408 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Ruffini, M., Mehta, D., O’Sullivan, B., Quesada, L., Doyle, L., Payne, D.B.: Deployment strategies for protected long-reach pon. Journal of Optical Communications and Networking 4, 118–129 (2012)CrossRefGoogle Scholar
  11. 11.
    Arbelaez, A., Codognet, P.: From sequential to parallel local search for SAT. In: Middendorf, M., Blum, C. (eds.) EvoCOP 2013. LNCS, vol. 7832, pp. 157–168. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  12. 12.
    Arbelaez, A., Mehta, D., O’Sullivan, B., Quesada, L.: A constraint-based parallel local search for disjoint rooted distance-constrained minimum spanning tree problem. In: Workshop on Parallel Methods for Search & Optimization (2014)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Alejandro Arbelaez
    • 1
    Email author
  • Deepak Mehta
    • 1
  • Barry O’Sullivan
    • 1
  • Luis Quesada
    • 1
  1. 1.Insight Centre for Data AnalyticsUniversity College CorkCorkIreland

Personalised recommendations