IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v59y2008i11d10.1057_palgrave.jors.2602479.html
   My bibliography  Save this article

Wide area telecommunication network design: application to the Alberta SuperNet

Author

Listed:
  • E A Cabral

    (University of Alberta)

  • E Erkut

    (Bilkent University)

  • G Laporte

    (HEC Montréal)

  • R A Patterson

    (University of Alberta)

Abstract

This article proposes a solution methodology for the design of a wide area telecommunication network. This study is motivated by the Alberta SuperNet project, which provides broadband Internet access to 422 communities across Alberta. There are two components to this problem: the network design itself, consisting of selecting which links will be part of the solution and which nodes should house shelters; and the loading problem which consists of determining which signal transport technology should be installed on the selected edges of the network. Mathematical models are described for these two subproblems. A tabu search algorithm heuristic is developed and tested on randomly generated instances and on Alberta SuperNet data.

Suggested Citation

  • E A Cabral & E Erkut & G Laporte & R A Patterson, 2008. "Wide area telecommunication network design: application to the Alberta SuperNet," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1460-1470, November.
    • Handle: RePEc:pal:jorsoc:v:59:y:2008:i:11:d:10.1057_palgrave.jors.2602479
    DOI: 10.1057/palgrave.jors.2602479
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602479
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602479?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. Gavish, Bezalel, 1992. "Topological design of computer communication networks -- The overall design problem," European Journal of Operational Research, Elsevier, vol. 58(2), pages 149-172, April.
    2. Steven Chamberland & Brunilde Sansò, 2001. "On the Design Problem of Multitechnology Networks," INFORMS Journal on Computing, INFORMS, vol. 13(3), pages 245-256, August.
    3. Anantaram Balakrishnan & Thomas L. Magnanti & Prakash Mirchandani, 1998. "Designing Hierarchical Survivable Networks," Operations Research, INFORMS, vol. 46(1), pages 116-136, February.
    4. Cabral, Edgar Alberto & Erkut, Erhan & Laporte, Gilbert & Patterson, Raymond A., 2007. "The network design problem with relays," European Journal of Operational Research, Elsevier, vol. 180(2), pages 834-844, July.
    5. C.D. Randazzo & H.P.L. Luna, 2001. "A Comparison of Optimal Methods for Local Access Uncapacitated Network Design," Annals of Operations Research, Springer, vol. 106(1), pages 263-286, September.
    6. Steven Chamberland & Brunilde Sansò & Odile Marcotte, 2000. "Topological Design of Two-Level Telecommunication Networks with Modular Switches," Operations Research, INFORMS, vol. 48(5), pages 745-760, October.
    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. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    2. Kewcharoenwong, Panitan & Li, Qiaofeng & Üster, Halit, 2023. "Lagrangean relaxation algorithms for fixed-charge capacitated relay network design," Omega, Elsevier, vol. 121(C).

    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. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    2. C S Sung & S H Song, 2003. "Integrated service network design for a cross-docking supply chain network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1283-1295, December.
    3. 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.
    4. Desai, Jitamitra & Sen, Suvrajeet, 2010. "A global optimization algorithm for reliable network design," European Journal of Operational Research, Elsevier, vol. 200(1), pages 1-8, January.
    5. Halit Üster & Panitan Kewcharoenwong, 2011. "Strategic Design and Analysis of a Relay Network in Truckload Transportation," Transportation Science, INFORMS, vol. 45(4), pages 505-523, November.
    6. Pablo Cortes & Jesus Muñuzuri & Luis Onieva & Juan Larrañeta & Juan M. Vozmediano & Jose C. Alarcon, 2006. "Andalucía Assesses the Investment Needed to Deploy a Fiber-Optic Network," Interfaces, INFORMS, vol. 36(2), pages 105-117, April.
    7. Thapalia, Biju K. & Crainic, Teodor Gabriel & Kaut, Michal & Wallace, Stein W., 2012. "Single-commodity network design with random edge capacities," European Journal of Operational Research, Elsevier, vol. 220(2), pages 394-403.
    8. Nigam, Ashutosh & Agarwal, Yogesh K., 2014. "Optimal relay node placement in delay constrained wireless sensor network design," European Journal of Operational Research, Elsevier, vol. 233(1), pages 220-233.
    9. Oya Ekin Karaşan & A. Ridha Mahjoub & Onur Özkök & Hande Yaman, 2014. "Survivability in Hierarchical Telecommunications Networks Under Dual Homing," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 1-15, February.
    10. Garg, Manish & Smith, J. Cole, 2008. "Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios," Omega, Elsevier, vol. 36(6), pages 1057-1071, December.
    11. 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.
    12. Konak, Abdullah, 2012. "Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation," European Journal of Operational Research, Elsevier, vol. 218(3), pages 829-837.
    13. Yiyong Xiao & Abdullah Konak, 2017. "A variable neighborhood search for the network design problem with relays," Journal of Heuristics, Springer, vol. 23(2), pages 137-164, June.
    14. Xu, Min & Meng, Qiang, 2020. "Optimal deployment of charging stations considering path deviation and nonlinear elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 135(C), pages 120-142.
    15. Bjorndal, M. H. & Caprara, A. & Cowling, P. I. & Della Croce, F. & Lourenco, H. & Malucelli, F. & Orman, A. J. & Pisinger, D. & Rego, C. & Salazar, J. J., 1995. "Some thoughts on combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 83(2), pages 253-270, June.
    16. Ozgur Kabadurmus & Alice E. Smith, 2016. "Multi-commodity k-splittable survivable network design problems with relays," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 62(1), pages 123-133, May.
    17. van de Leensel, R.L.J.M. & Flippo, O.E. & Koster, Arie M.C.A. & Kolen, A.W.J., 1996. "A dynamic programming algorithm for the local access network expansion problem," Research Memorandum 027, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    18. Fragkos, Ioannis & Cordeau, Jean-François & Jans, Raf, 2021. "Decomposition methods for large-scale network expansion problems," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 60-80.
    19. De Boeck, Jérôme & Fortz, Bernard, 2018. "Extended formulation for hop constrained distribution network configuration problems," European Journal of Operational Research, Elsevier, vol. 265(2), pages 488-502.
    20. Sridhar, Varadharajan & Park, June S., 2000. "Benders-and-cut algorithm for fixed-charge capacitated network design problem," European Journal of Operational Research, Elsevier, vol. 125(3), pages 622-632, September.

    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:pal:jorsoc:v:59:y:2008:i:11:d:10.1057_palgrave.jors.2602479. 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.palgrave-journals.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.