Optimization Online


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

Maryam Daryalal (m.daryalal***at***mail.utoronto.ca)
Hamed Pouya (h.pouya***at***utoronto.ca)

Abstract: 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. We perform a comprehensive evaluation of our method over instances based on six real long-haul networks and demonstrate their solution quality and the performance of the algorithm. We also show the merit of each incorporated optimization paradigm in achieving this performance.

Keywords: Telecommunications, Logic-based Benders Decomposition, Constraint Programming, Column Generation, Migration, Networks

Category 1: Applications -- OR and Management Sciences

Citation: 2021

Download: [PDF]

Entry Submitted: 10/31/2021
Entry Accepted: 11/01/2021
Entry Last Modified: 11/07/2021

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society