Operations Administration and Maintenance Constraints in Fiber Cables Network Design

  • Vincent AngilellaEmail author
  • Matthieu Chardy
  • Walid Ben-Ameur
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 966)


We introduce two specific design problems of optical fiber cable networks that differ by a practical maintenance constraint. An integer programming based method including valid inequalities is introduced for the unconstrained problem. We propose two exact solution methods to tackle the constrained problem: the first one is based on mixed integer programming including valid inequalities while the second one is built on dynamic programming. We then provide a fully polynomial time approximation scheme for the constrained problem. The theoretical complexities of both problems in several cases are proven and compared. Numerical results assess the efficiency of both methods in different contexts including real-life instances, and evaluate the effect of the maintenance constraint on the solution quality.


Optical networks Network design Mixed integer programming Dynamic programming 


  1. 1.
    Angilella, V., Chardy, M., Ben-Ameur, W.: Cables network design optimisation for the fiber to the home. In: Design of Reliable Communication Networks (2016)Google Scholar
  2. 2.
    Angilella, V., Chardy, M., Ben-Ameur, W.: Design of fiber cable tree networks for the fiber to the home. In: International Networks Optimisation Conference, Lisboa, Portugal (2017)Google Scholar
  3. 3.
    Angilella, V., Chardy, M., Ben-Ameur, W.: Fiber cable network design with operations administration & maintenance constraints. In: International Conference on Operations Research and Enterprise Systems, Funchal, Madeira, Portugal (2018)Google Scholar
  4. 4.
    Bley, A., Ljubic, I., Maurer, O.: Lagrangian decompositions for the two-level FTTx network design problem. Eur. J. Comput. Optim. 1(3), 221–252 (2013)CrossRefGoogle Scholar
  5. 5.
    Chardy, M., Costa, M.C., Faye, A., Trampont, M.: Optimising splitter and fiber location in a multilevel optical FTTH network. Eur. J. Oper. Res. 222(3), 430–440 (2013)CrossRefGoogle Scholar
  6. 6.
    Contreras, I., Fernandez, E.: General network design: a unified view of combined location and network design problems. Eur. J. Oper. Res. 219(3), 680–697 (2012)MathSciNetCrossRefGoogle Scholar
  7. 7.
    FTTH Council Europe: FTTH Handbook, 7th edn. Wettelijk Depot (2016)Google Scholar
  8. 8.
    Gollowitzer, S., Gouveia, L., Ljubic, I.: Enhanced formulations and branch and cut for the two level network design problem with transition facilities. Eur. J. Oper. Res. 2, 211–222 (2013)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Grötschel, M., Raack, C., Werner, A.: Towards optimising the deployment of optical access networks. Eur. J. Comput. Optim. 2(1–2), 17–53 (2013)zbMATHGoogle Scholar
  10. 10.
    Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series. Springer, Boston (1972). Scholar
  11. 11.
    Magazine, M., Oguz, O.: A fully polynomial approximation algorithm for the 0–1 knapsack problem. Eur. J. Oper. Res. 8(3), 270–273 (1981)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Mateus, G.R., Luna, H.P., Sirihal, A.B.: Heuristics for distribution network design in telecommunication. J. Heuristics 6, 131–148 (2000)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Vincent Angilella
    • 1
    • 2
    Email author
  • Matthieu Chardy
    • 1
  • Walid Ben-Ameur
    • 2
  1. 1.Orange LabsChatillonFrance
  2. 2.SAMOVAR, Télécom SudParis, CNRSUniversité Paris-SaclayEvry CedexFrance

Personalised recommendations