Applying Robust Optimization to Capacity Expansion of One Location in Telecommunications with Demand Uncertainty

The problem of expanding the capacity of a single facility in telecommunications network planning is addressed. This problem can be formulated as a time-dependent knapsack, when relevant information is assumed to be known. We introduce the use of scenarios to model uncertainty in key data. The problem is formulated within the robust optimization framework and solved exactly in two phases. The first phase consists of a dynamic programming recursion and the second one of a shortest path procedure. Experiments show that a large number of scenarios can be handled with this technique, because computational times are more sensitive to the maximum demand across all scenarios than to the number of scenarios considered. A user-interface based on Microsoft Excel is developed as a decision support system for network planners.

• 저널Management Science · 44(11-part-2) · S101–S110
• 토픽Vehicle Routing Optimization Methods · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.44.11.s101
• 저자Manuel Laguna