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

Single PON network design with unconstrained splitting stages

Author

Listed:
  • Gouveia, Luís
  • Lopes, Maria João
  • de Sousa, Amaro

Abstract

A Passive Optical Network (PON) is a network technology for deploying access networks based on passive optical components. In a single PON access network, the client terminals are connected to a Central Office through optical splitters and interconnecting fibers where each splitter splits in equal parts the input optical signal coming from the Central Office over its different output fibers. In this paper, we consider PON topology solutions where the splitting ratio and the number of splitting stages are not constrained to a given target design but, instead, are decided based on the cost of the solutions. We present different Integer Linear Programming formulations to model this problem and provide computational results showing that the optimal solutions can be computed for realistic problem instances. In addition, we describe how the formulations can be adapted for the traditional PON topology approaches and present computational results showing that significant cost gains are obtained with the unconstrained splitting stage approach.

Suggested Citation

  • Gouveia, Luís & Lopes, Maria João & de Sousa, Amaro, 2015. "Single PON network design with unconstrained splitting stages," European Journal of Operational Research, Elsevier, vol. 240(2), pages 361-371.
    • Handle: RePEc:eee:ejores:v:240:y:2015:i:2:p:361-371
    DOI: 10.1016/j.ejor.2014.07.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714005578
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.07.006?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. Kim, Youngjin & Lee, Youngho & Han, Junghee, 2011. "A splitter location-allocation problem in designing fiber optic access networks," European Journal of Operational Research, Elsevier, vol. 210(2), pages 425-435, April.
    2. Chardy, M. & Costa, M.-C. & Faye, A. & Trampont, M., 2012. "Optimizing splitter and fiber location in a multilevel optical FTTH network," European Journal of Operational Research, Elsevier, vol. 222(3), pages 430-440.
    3. Luis Gouveia, 1995. "A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem," Operations Research, INFORMS, vol. 43(1), pages 130-141, February.
    4. Luís Gouveia & Pedro Moura, 2012. "Enhancing discretized formulations: the knapsack reformulation and the star reformulation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 52-74, April.
    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. Bernard Gendron & Luis Gouveia, 2017. "Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems," Transportation Science, INFORMS, vol. 51(2), pages 629-649, May.
    2. Yazar, Başak & Arslan, Okan & Karaşan, Oya Ekin & Kara, Bahar Y., 2016. "Fiber optical network design problems: A case for Turkey," Omega, Elsevier, vol. 63(C), pages 23-40.
    3. Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.
    4. Chardy, M. & Costa, M.-C. & Faye, A. & Trampont, M., 2012. "Optimizing splitter and fiber location in a multilevel optical FTTH network," European Journal of Operational Research, Elsevier, vol. 222(3), pages 430-440.
    5. Rahma Lahyani & Leandro C. Coelho & Jacques Renaud, 2018. "Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 125-157, January.
    6. Zorica Dražić & Aleksandar Savić & Vladimir Filipović, 2014. "An integer linear formulation for the file transfer scheduling problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(3), pages 1062-1073, October.
    7. Ricardo Fukasawa & Qie He & Yongjia Song, 2016. "A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem," Transportation Science, INFORMS, vol. 50(1), pages 23-34, February.
    8. Gouveia, Luis, 1995. "A result on projection for the vehicle routing ptoblem," European Journal of Operational Research, Elsevier, vol. 85(3), pages 610-624, September.
    9. Gen, Mitsuo & Kumar, Anup & Ryul Kim, Jong, 2005. "Recent network design techniques using evolutionary algorithms," International Journal of Production Economics, Elsevier, vol. 98(2), pages 251-261, November.
    10. Mariusz Mycek & Michał Pióro & Mateusz Żotkiewicz, 2018. "MIP model for efficient dimensioning of real-world FTTH trees," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 68(2), pages 239-258, June.
    11. Andrea Bettinelli & Alberto Ceselli & Giovanni Righini, 2010. "A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint," Annals of Operations Research, Springer, vol. 179(1), pages 221-241, September.
    12. Cesar Rego & Frank Mathew & Fred Glover, 2010. "RAMP for the capacitated minimum spanning tree problem," Annals of Operations Research, Springer, vol. 181(1), pages 661-681, December.
    13. Luís Gouveia & Pedro Moura, 2012. "Enhancing discretized formulations: the knapsack reformulation and the star reformulation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 52-74, April.
    14. Fernandes, Lucinda Matos & Gouveia, Luis, 1998. "Minimal spanning trees with a constraint on the number of leaves," European Journal of Operational Research, Elsevier, vol. 104(1), pages 250-261, January.
    15. Xiaojun Zhu & Shaojie Tang, 2021. "A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1446-1460, October.
    16. Mateusz Żotkiewicz & Mariusz Mycek & Artur Tomaszewski, 2016. "Profitable areas in large-scale FTTH network optimization," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 61(3), pages 591-608, March.
    17. Mariusz Mycek & Mateusz Żotkiewicz, 2019. "On optimal trajectory for the multi-period evolution of FTTx networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 71(3), pages 353-376, July.
    18. Gouveia, Luis & Leitner, Markus & Ruthmair, Mario, 2017. "Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 908-928.
    19. Kawatra, R. & Bricker, D., 2000. "A multiperiod planning model for the capacitated minimal spanning tree problem," European Journal of Operational Research, Elsevier, vol. 121(2), pages 412-419, March.
    20. Antonio Frangioni, 2005. "About Lagrangian Methods in Integer Optimization," Annals of Operations Research, Springer, vol. 139(1), pages 163-193, October.

    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:240:y:2015:i:2:p:361-371. 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.