A Branch-and-price Approach to the ATM Switching Node Location Problem

  • Kim, Deokseong (Department of Industrial Engineering Korea Advanced Institute of Science and Technology) ;
  • Park, Sunsoo (Department of Industrial Engineering Korea Advanced Institute of Science and Technology) ;
  • Lee, Kyungsik (School of Industrial Information & System Engineering, Hankuk University of Foreign Studies) ;
  • Park, Kyungchul (Network Group, Korea Telecom)
  • Published : 2004.12.31

Abstract

We consider the ATM switching node location problem (ANLP). In this problem, there are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities. We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub via installed remote facilities with minimum cost, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we present a preprocessing procedure to tighten the formulation and develop a branch-and-price algorithm. In the algorithm, we consider the integer knapsack problem as the column generation problem. Computational experiments show that the algorithm gives optimal solutions in a reasonable time.

Keywords