IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v50y2002i3p538-551.html
   My bibliography  Save this article

Hybrid Fiber Coaxial Network Design

Author

Listed:
  • Raymond A. Patterson

    (4-30E Business Building, School of Business, University of Alberta, Edmonton, Alberta, Canada T6G 2R6)

  • Erik Rolland

    (The A. Gary Anderson Graduate School of Management, University of California, Riverside, California 92521)

Abstract

Much interest exists in broadband network services to deliver a variety of products to consumers, such as Internet access, telephony, interactive TV, and video on demand. Due to its cost efficiency, Hybrid Fiber Coaxial (HFC) technology is currently being considered by most Telcos and cable companies as the technology to deliver these products. The topological HFC network design problem as implemented by several major companies is a form of the capacitated tree-star network design problem. We propose a new formulation for this problem and present a heuristic based on hierarchical decomposition of the problem. The proposed solution methodology exploits an Adaptive Reasoning Technique (ART), embedded as a meta-heuristic over specialized heuristics for the subproblems. In this context, we demonstrate the dynamic use of an exact solution technique within ART. The generalizability of the proposed solution methodology is demonstrated by applying it to a second problem, the Traveling Salesman Problem (TSP). Computational results are presented for both the HFC network design problem and the TSP, indicating high-quality solutions expending a very modest computational effort. The proposed solution method is found to be effective, and is shown to be easily adaptable to new problems without much crafting, and as such, has a broad appeal to the general operations research community.

Suggested Citation

  • Raymond A. Patterson & Erik Rolland, 2002. "Hybrid Fiber Coaxial Network Design," Operations Research, INFORMS, vol. 50(3), pages 538-551, June.
  • Handle: RePEc:inm:oropre:v:50:y:2002:i:3:p:538-551
    DOI: 10.1287/opre.50.3.538.7737
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.50.3.538.7737
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.50.3.538.7737?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
    ---><---

    References listed on IDEAS

    as
    1. Gupta, Rakesh & Pirkul, Hasan, 2000. "Hybrid fiber co-axial CATV network design with variable capacity optical network units," European Journal of Operational Research, Elsevier, vol. 123(1), pages 73-85, May.
    2. Charles Fleurent & Fred Glover, 1999. "Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 198-204, May.
    3. Fred Glover, 1965. "A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem," Operations Research, INFORMS, vol. 13(6), pages 879-919, December.
    4. Kemal Altinkemer & Bezalel Gavish, 1988. "Heuristics with Constant Error Guarantees for the Design of Tree Networks," Management Science, INFORMS, vol. 34(3), pages 331-341, March.
    5. Leslie Hall, 1996. "Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 8(3), pages 219-234, August.
    6. Anantaram Balakrishnan & Thomas L. Magnanti & Richard T. Wong, 1995. "A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning," Operations Research, INFORMS, vol. 43(1), pages 58-76, February.
    7. Luis Gouveia, 1995. "A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem," Operations Research, INFORMS, vol. 43(1), pages 130-141, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Costa, Alysson M. & França, Paulo M. & Lyra Filho, Christiano, 2011. "Two-level network design with intermediate facilities: An application to electrical distribution systems," Omega, Elsevier, vol. 39(1), pages 3-13, January.

    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. Gouveia, Luis & Lopes, Maria Joao, 2000. "Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs," European Journal of Operational Research, Elsevier, vol. 121(2), pages 394-411, March.
    2. 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.
    3. Amberg, Anita & Domschke, Wolfgang & Vo[ss], Stefan, 2000. "Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees," European Journal of Operational Research, Elsevier, vol. 124(2), pages 360-376, July.
    4. Uchoa, Eduardo & Fukasawa, Ricardo & Lysgaard, Jens & Pessoa, Artur & Poggi de Aragão, Marcus & Andrade, Diogo, 2006. "Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation," CORAL Working Papers L-2006-08, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    5. 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.
    6. Gupta, Rakesh & Pirkul, Hasan, 2000. "Hybrid fiber co-axial CATV network design with variable capacity optical network units," European Journal of Operational Research, Elsevier, vol. 123(1), pages 73-85, May.
    7. Gendreau, Michel & Potvin, Jean-Yves & Smires, Ali & Soriano, Patrick, 2006. "Multi-period capacity expansion for a local access telecommunications network," European Journal of Operational Research, Elsevier, vol. 172(3), pages 1051-1066, August.
    8. 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.
    9. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    10. 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.
    11. 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.
    12. Mohit Tawarmalani & Yanjun Li, 2011. "Multi‐period maintenance scheduling of tree networks with minimum flow disruption," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(5), pages 507-530, August.
    13. Yuji Nakagawa & Ross J. W. James & César Rego & Chanaka Edirisinghe, 2014. "Entropy-Based Optimization of Nonlinear Separable Discrete Decision Models," Management Science, INFORMS, vol. 60(3), pages 695-707, March.
    14. Torkil Kollsker & Thomas J. R. Stidsen, 2021. "Optimisation and Static Equilibrium of Three-Dimensional LEGO Constructions," SN Operations Research Forum, Springer, vol. 2(2), pages 1-52, June.
    15. Jiang, Bo & Tzavellas, Hector, 2023. "Optimal liquidity allocation in an equity network," International Review of Economics & Finance, Elsevier, vol. 85(C), pages 286-294.
    16. 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.
    17. 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.
    18. 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.
    19. M. Kritikos & G. Ioannou, 2017. "A greedy heuristic for the capacitated minimum spanning tree problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1223-1235, October.
    20. Costa, Alysson M. & França, Paulo M. & Lyra Filho, Christiano, 2011. "Two-level network design with intermediate facilities: An application to electrical distribution systems," Omega, Elsevier, vol. 39(1), pages 3-13, January.

    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:inm:oropre:v:50:y:2002:i:3:p:538-551. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.