Abstract
This paper considers a variant of the bandwidth packing problem that determines paths for selected demands on a telecommunication network with given arc capacities to maximize the total revenue. Facilities on the arcs can be seen as M/M/1 queuing systems, which incur queuing delays that should be minimized by adding them to the objective function as a penalty. We also consider the case in which the demands are uncertain, so both the capacity and queuing delay of an arc should take the uncertainty of demand into account. The mathematical formulation for the problem is stated as a nonlinear integer programming problem due to the queuing delays added in the objective function. We first show that the formulation can be linearized to a mixed integer linear programming problem that can be solved by off-the-shelf MIP solvers like Cplex. We then propose a branch-and-price approach by showing that the column generation problem can be solved efficiently by a dynamic programming algorithm. Computational experiments with benchmark instances show that the proposed approach significantly outperforms the state-of-the-art MIP solver in terms of computational times. We also report a Monte-Carlo simulation study with randomly generated demand scenarios to assert the benefits of the robust approach.
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10479-021-04292-w/MediaObjects/10479_2021_4292_Fig1_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10479-021-04292-w/MediaObjects/10479_2021_4292_Fig2_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10479-021-04292-w/MediaObjects/10479_2021_4292_Fig3_HTML.png)
Similar content being viewed by others
References
Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Prentice hall.
Amiri, A., Rolland, E., & Barkhi, R. (1999). Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures. European Journal of Operational Research, 112(3), 635–645.
Anderson, C. A., Fraughnaugh, K., Parker, M., & Ryan, J. (1993). Path assignment for call routing: An application of tabu search. Annals of Operations Research, 41(4), 299–312.
Barnhart, C., Hane, C. A., & Vance, P. H. (2000). Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research, 48(2), 318–326.
Bertsimas, D., & Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53.
Bertsimas, D., & Thiele, A. (2006). A robust optimization approach to inventory theory. Operations Research, 54(1), 150–168.
Cox, L. A. J. (1991). Dynamic anticipatory routing in circuit-switched telecommunications networks. Handbook of Genetic Algorithms.
Elhedhli, S. (2005). Exact solution of a class of nonlinear knapsack problems. Operations Research Letters, 33(6), 615–624.
Gavish, B., & Altinkemer, K. (1990). Backbone network design tools with economic tradeoffs. ORSA Journal on Computing, 2(3), 236–252.
Han, J., Lee, K., Lee, C., & Park, S. (2013). Exact algorithms for a bandwidth packing problem with queueing delay guarantees. INFORMS Journal on Computing, 25(3), 585–596.
Kim, J. H., Kim, W. C., & Fabozzi, F. J. (2017). Recent advancements in robust optimization for investment management. Annals of Operations Research, 1–16.
Klopfenstein, O., & Nace, D. (2008). A robust approach to the chance-constrained knapsack problem. Operations Research Letters, 36(5), 628–632.
Klopfenstein, O., & Nace, D. (2012). Cover inequalities for robust knapsack sets-application to the robust bandwidth packing problem. Networks, 59(1), 59–72.
Laguna, M., & Glover, F. (1993). Bandwidth packing: A Tabu search approach. Management Science, 39(4), 492–500.
Lee, C., Lee, K., Park, K., & Park, S. (2012). Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations. Operations Research, 60(3), 604–610.
Lee, C., Lee, K., & Park, S. (2012). Robust vehicle routing problem with deadlines and travel time/demand uncertainty. Journal of the Operational Research Society, 63(9), 1294–1306.
Lee, C., Lee, K., & Park, S. (2013). Benders decomposition approach for the robust network design problem with flow bifurcations. Networks, 62(1), 1–16.
Monaci, M., Pferschy, U., & Serafini, P. (2013). Exact solution of the robust knapsack problem. Computers & Operations Research, 40(11), 2625–2631.
Park, K., Kang, S., & Park, S. (1996). An integer programming approach to the bandwidth packing problem. Management Science, 42(9), 1277–1291.
Parker, M., & Ryan, J. (1993). A column generation algorithm for bandwidth packing. Telecommunication Systems, 2(1), 185–195.
Villa, C., & Hoffman, K. (2006). A column-generation and branch-and-cut approach to the bandwidth-packing problem. Journal of Research of the National Institute of Standards and Technology, 111(2), 161.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research was supported by the Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Science, ICT & Future Planning (NRF-2021R1F1A1048540). Chungmok Lee was supported by Hankuk University of Foreign Studies Research Fund.
Rights and permissions
About this article
Cite this article
Kim, S., Lee, C. A branch and price approach for the robust bandwidth packing problem with queuing delays. Ann Oper Res 307, 251–275 (2021). https://doi.org/10.1007/s10479-021-04292-w
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-021-04292-w