A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
نویسندگان
چکیده
Growing demand, increasing diversity of services, and advances in transmission and switching technologies are prompting telecommunication companies to rapidly expand and modernize their networks. This paper develops and tests a decomposition methodology to generate cost-effective expansion plans, with performance guarantees, for one major component of the network hierarchy-the local access network connecting customers to the local switching center. The model captures economies of scale in facility costs, and addresses the central tradeoff between installing concentrators and expanding cables to accommodate demand growth. By exploiting the special tree and routing structure of the expansion planning problem, our solution method integrates two major algorithmic strategies from mathematical programming-the use of valid inequalities, obtained by studying a problem's polyhedral structure, and dynamic programming, which can be used to solve an uncapacitated version of the local access network expansion planning problem. The computational results for three actual test networks demonstrate that this enhanced dynamic programming algorithm, when embedded in a Lagrangian relaxation scheme (with problem preprocessing and local improvement), is very effective in generating good upper and lower bounds: implemented on a personal computer, the method was able to generate solutions that are within 1.2 to 7.0% of optimality. In addition to developing a successful solution methodology for a practical problem, this paper illustrates the possibility of effectively combining decomposition methods and polyhedral approaches.
منابع مشابه
Distribution Network Expansion Using Hybrid SA/TS Algorithm
Optimal expansion of medium-voltage power networks is a common issue in electrical distribution planning. Minimizing total cost of the objective function with technical constraints and reliability limits, make it a combinatorial problem which should be solved by optimization algorithms. This paper presents a new hybrid simulated annealing and tabu search algorithm for distribution network expan...
متن کاملLimited Column Generation Technique for Several Telecommunication Network Design Problems
This paper presents a so-called Limited Column Generation technique for solving the Local Access Network Design and Expansion problems. We first define our models for the design problem and the expansion problem. Then, we formulate both problems into a tree-partitioning problem with exponential number of variables. Because its intersection graph is a chordal graph and, of course, a perfect grap...
متن کاملAccess and Mobility Policy Control at the Network Edge
The fifth generation (5G) system architecture is defined as service-based and the core network functions are described as sets of services accessible through application programming interfaces (API). One of the components of 5G is Multi-access Edge Computing (MEC) which provides the open access to radio network functions through API. Using the mobile edge API third party analytics applications ...
متن کاملImproved Binary Particle Swarm Optimization Based TNEP Considering Network Losses, Voltage Level, and Uncertainty in Demand
Transmission network expansion planning (TNEP) is an important component of power system planning. Itdetermines the characteristics and performance of the future electric power network and influences the powersystem operation directly. Different methods have been proposed for the solution of the static transmissionnetwork expansion planning (STNEP) problem till now. But in all of them, STNEP pr...
متن کاملReformulation, Column Generation and Lagrangian Relaxation for Local Access Network Design Problems
In this paper, we present several models of Local Access Network Design and Expansion problems, and discuss different alternatives for solving these problems, as well as the relationships among different approaches. One of our results shows that both Design and Expansion problems provide examples for a rare situation in which the lower bound from Lagrangian relaxation is exactly equal to the op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Operations Research
دوره 43 شماره
صفحات -
تاریخ انتشار 1995