IDEAS home Printed from https://ideas.repec.org/a/spr/decisn/v50y2023i1d10.1007_s40622-023-00343-2.html
   My bibliography  Save this article

Hub location–allocation for combined fixed-wireless and wireline broadband access networks

Author

Listed:
  • Ramesh Bollapragada

    (Decision Sciences Department, College of Business)

  • Uday S. Rao

    (University of Cincinnati)

  • Junying Wu

    (Credit Risk Analytics Consultant)

Abstract

This paper studies a telecommunications hub location model that includes the classical capacitated facility location problem on a wireline network, as well as a wireless network with technological constraints on crane-rain radius, line-of-sight, and capacity. There are multiple wireline and wireless hub types, differing in costs and capacities. We present a mathematical model to maximize network profit, build and test a quick greedy heuristic, and conduct sensitivity analysis using representative data. Solutions from the greedy heuristic are compared to the optimal solution for small instances, and the results indicate that the profit is on an average, within 98% of the optimal. For large instances that are intractable for the exact optimization approach, profit from the greedy solution is, on average, within 92% of that obtained from an upper-bounding linear programming relaxation. Sensitivity analysis shows that the optimal demand captured, revenue, and costs are not always monotone in input parameters: For a range of input values, profits improve by capturing more revenue with higher costs being incurred, in other cases, profits improve by reducing the costs of capturing demand while maintaining, or sometimes reducing revenue. Reducing hub installation costs or link transmission costs typically improves profit more than increasing hub capacity or link capacity by the same percentage. The combined network with both wireline and wireless technologies always delivers the highest profit, but in certain cases, depending on the demand, link capacity, and hub installation costs, either wireline-only or wireless-only networks can be quite competitive.

Suggested Citation

  • Ramesh Bollapragada & Uday S. Rao & Junying Wu, 2023. "Hub location–allocation for combined fixed-wireless and wireline broadband access networks," DECISION: Official Journal of the Indian Institute of Management Calcutta, Springer;Indian Institute of Management Calcutta, vol. 50(1), pages 115-128, March.
  • Handle: RePEc:spr:decisn:v:50:y:2023:i:1:d:10.1007_s40622-023-00343-2
    DOI: 10.1007/s40622-023-00343-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s40622-023-00343-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s40622-023-00343-2?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. Alfred A. Kuehn & Michael J. Hamburger, 1963. "A Heuristic Program for Locating Warehouses," Management Science, INFORMS, vol. 9(4), pages 643-666, July.
    2. Tony J. Van Roy, 1986. "A Cross Decomposition Algorithm for Capacitated Facility Location," Operations Research, INFORMS, vol. 34(1), pages 145-163, February.
    3. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2018. "Exact solution of hub network design problems with profits," European Journal of Operational Research, Elsevier, vol. 266(1), pages 57-71.
    4. Graciano Sá, 1969. "Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem," Operations Research, INFORMS, vol. 17(6), pages 1005-1016, December.
    5. Alumur, Sibel A. & Kara, Bahar Y. & Karasan, Oya E., 2012. "Multimodal hub location and hub network design," Omega, Elsevier, vol. 40(6), pages 927-939.
    6. 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.
    7. Ramesh Bollapragada & Yanjun Li & Uday S. Rao, 2006. "Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 422-432, November.
    8. David Simchi-Levi & Oded Berman, 1988. "A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks," Operations Research, INFORMS, vol. 36(3), pages 478-484, June.
    9. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    10. E. Feldman & F. A. Lehrer & T. L. Ray, 1966. "Warehouse Location Under Continuous Economies of Scale," Management Science, INFORMS, vol. 12(9), pages 670-684, May.
    11. Oded Berman & Mina Rasty Rahnama, 1983. "Optimal Path of a Single Service Unit on a Network to a “Nonemergency” Destination," Transportation Science, INFORMS, vol. 17(2), pages 218-232, May.
    12. Ramesh Bollapragada & Thomas B. Morawski & Luz E. Pinzon & Steven H. Richman & Raymond Sackett, 2007. "Network Planning of Broadband Wireless Networks," Interfaces, INFORMS, vol. 37(2), pages 143-162, April.
    13. P. S. Davis & T. L. Ray, 1969. "A branch‐bound algorithm for the capacitated facilities location problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 16(3), pages 331-344, September.
    14. Umit Akinc & Basheer M. Khumawala, 1977. "An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem," Management Science, INFORMS, vol. 23(6), pages 585-594, February.
    15. Sun, Zhuo & Gao, Wei & Li, Bin & Wang, Longlong, 2020. "Locating charging stations for electric vehicles," Transport Policy, Elsevier, vol. 98(C), pages 48-54.
    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. Sharma, R.R.K. & Berry, V., 2007. "Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort," European Journal of Operational Research, Elsevier, vol. 177(2), pages 803-812, March.
    2. Fathali Firoozi, 2008. "Boundary Distributions in Testing Inequality Hypotheses," Working Papers 0046, College of Business, University of Texas at San Antonio.
    3. Minghe Sun & Zhen-Yu Chen & Zhi-Ping Fan, 2014. "A Multi-task Multi-kernel Transfer Learning Method for Customer Response Modeling in Social Media," Working Papers 0161mss, College of Business, University of Texas at San Antonio.
    4. Minghe Sun, 2008. "A Tabu Search Heuristic Procedure for the Capacitated Facility Location Problem," Working Papers 0050, College of Business, University of Texas at San Antonio.
    5. Klaus Büdenbender & Tore Grünert & Hans-Jürgen Sebastian, 2000. "A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem," Transportation Science, INFORMS, vol. 34(4), pages 364-380, November.
    6. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    7. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    8. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    9. Tsekeris, Theodore, 2016. "Interregional trade network analysis for road freight transport in Greece," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 132-148.
    10. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.
    11. Nader Ghaffarinasab & Bahar Y. Kara, 2019. "Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem," Networks and Spatial Economics, Springer, vol. 19(1), pages 83-108, March.
    12. Hyun Kim & Megan S. Ryerson, 2017. "The q-Ad Hoc Hub Location Problem for Multi-modal Networks," Networks and Spatial Economics, Springer, vol. 17(3), pages 1015-1041, September.
    13. Ghane-Ezabadi, Mohammad & Vergara, Hector A., 2016. "Decomposition approach for integrated intermodal logistics network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 53-69.
    14. Sridharan, R., 1995. "The capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 87(2), pages 203-213, December.
    15. Taherkhani, Gita & Alumur, Sibel A., 2019. "Profit maximizing hub location problems," Omega, Elsevier, vol. 86(C), pages 1-15.
    16. Erdoğan, Güneş & Battarra, Maria & Rodríguez-Chía, Antonio M., 2022. "The hub location and pricing problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1035-1047.
    17. Sibel A. Alumur & Stefan Nickel & Francisco Saldanha-da-Gama & Yusuf Seçerdin, 2016. "Multi-period hub network design problems with modular capacities," Annals of Operations Research, Springer, vol. 246(1), pages 289-312, November.
    18. Miguel A. Pozo & Justo Puerto & Antonio M. Rodríguez Chía, 2021. "The ordered median tree of hubs location problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 78-105, April.
    19. Laureano F. Escudero & Juan F. Monge, 2021. "On Multistage Multiscale Stochastic Capacitated Multiple Allocation Hub Network Expansion Planning," Mathematics, MDPI, vol. 9(24), pages 1-39, December.
    20. El Mehdi Ibnoulouafi & Mustapha Oudani & Tarik Aouam & Mounir Ghogho, 2022. "Intermodal Green p-Hub Median Problem with Incomplete Hub-Network," Sustainability, MDPI, vol. 14(18), pages 1-29, 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:spr:decisn:v:50:y:2023:i:1:d:10.1007_s40622-023-00343-2. 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.springer.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.