The multi-hour bandwidth packing problem

We study the multi-hour bandwidth packing problem arising from telecommunications networks. The problem consists of selecting calls from a list of requests with time varying traffic conditions to be routed on an arc-capacitated network in order to maximize profit. The paper represents a significant improvement over previous research by presenting a unified model of the problem that considers all possible paths for each call and allows the traffic requirements of the calls to vary over the busy-hours of the day. Failure to consider all possible routes and to allow traffic requirements to vary over the busy-hours would lead to significant revenue loss, excessive costs and/or inferior quality of service to users. The integer programming model for the problem is presented. A solution procedure based on the Lagrangean relaxation technique is developed. The results of extensive computational experiments over a wide range of problem structures indicate that the procedure is both efficient and effective.