Network Migration Problem: A Logic-based Benders Decomposition Approach Driven by Column Generation and Constraint Programming

11/08/2021
by   Maryam Daryalal, et al.
0

Telecommunication networks frequently face technological advancements and need to upgrade their infrastructure. Adapting legacy networks to the latest technology requires synchronized technicians responsible for migrating the equipment. The goal of the network migration problem is to find an optimal plan for this process. This is a defining step in the customer acquisition of telecommunications service suppliers, and its outcome directly impacts the network owners' purchasing behaviour. We propose the first exact method for the network migration problem, a logic-based Benders decomposition approach that benefits from a hybrid constraint programming-based column generation in its master problem and a constraint programming model in its subproblem. This integrated solution technique is applicable to any integer programming problem with similar structure, most notably the vehicle routing problem with node synchronization constraints. Comprehensive evaluation of our method over instances based on six real networks demonstrates the computational efficiency of the algorithm in obtaining quality solutions. We also show the merit of each incorporated optimization paradigm in achieving this performance.

READ FULL TEXT

page 23

page 37

research
12/31/2019

Nested Column Generation decomposition for solving the Routing and Spectrum Allocation problem in Elastic Optical Networks

With the continued growth of Internet traffic, and the scarcity of the o...
research
10/31/2011

A Constraint Programming Approach for Solving a Queueing Control Problem

In a facility with front room and back room operations, it is useful to ...
research
09/30/2020

Meta Partial Benders Decomposition for the Logistics Service Network Design Problem

Supply chain transportation operations often account for a large proport...
research
09/25/2020

A Column Generation based Heuristic for the Tail Assignment Problem

This article proposes an efficient heuristic in accelerating the column ...
research
12/19/2017

Column Generation for Interaction Coverage in Combinatorial Software Testing

This paper proposes a novel column generation framework for combinatoria...
research
12/14/2019

A column-generation-based matheuristic for periodic train timetabling with integrated passenger routing

In this study, the periodic train timetabling problem is formulated usin...

Please sign up or login with your details

Forgot password? Click here to reset