A two-level location-allocation problem in designing local access fiber optic networks

Gigyoung Park, Youngho Lee, Junghee Han

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

This paper deals with a two-level facility location-allocation problem on tree topology arising from the design of access networks. The access network design problem seeks to find an optimal location of switch and allocation of demands such that the total cost of switch and fiber cable is minimized, while satisfying switch port constraint, switch capacity constraint, and no-split routing constraint. The problem is formulated as a mixed-integer programming model and alternative formulations are developed by the reformulation- linearization technique (RLT) for improving computational effectiveness. By exploiting the tree structure of the problem, we develop some valid inequalities that have complementary strength and devise separation problems for finding effective valid inequalities that cut off fractional LP solutions. Also, we develop an effective MIP-based tree partitioning heuristic for finding good quality solutions for large size problems. Computational results demonstrate the efficacy of the valid inequalities and the proposed heuristic.

Original languageEnglish
Pages (from-to)52-63
Number of pages12
JournalComputers and Operations Research
Volume51
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Location-allocation
Fiber optic networks
Fiber Optics
Switches
Valid Inequalities
Switch
Integer programming
Reformulation-linearization Technique (RLT)
Linearization
Heuristics
Cables
Optimal Location
Capacity Constraints
Facility Location
Mixed Integer Programming
Topology
Network Design
Tree Structure
Cable
Programming Model

ASJC Scopus subject areas

  • Computer Science(all)
  • Management Science and Operations Research
  • Modelling and Simulation

Cite this

A two-level location-allocation problem in designing local access fiber optic networks. / Park, Gigyoung; Lee, Youngho; Han, Junghee.

In: Computers and Operations Research, Vol. 51, 01.01.2014, p. 52-63.

Research output: Contribution to journalArticle

@article{4438d767886a4697981b6409f7a8c5a5,
title = "A two-level location-allocation problem in designing local access fiber optic networks",
abstract = "This paper deals with a two-level facility location-allocation problem on tree topology arising from the design of access networks. The access network design problem seeks to find an optimal location of switch and allocation of demands such that the total cost of switch and fiber cable is minimized, while satisfying switch port constraint, switch capacity constraint, and no-split routing constraint. The problem is formulated as a mixed-integer programming model and alternative formulations are developed by the reformulation- linearization technique (RLT) for improving computational effectiveness. By exploiting the tree structure of the problem, we develop some valid inequalities that have complementary strength and devise separation problems for finding effective valid inequalities that cut off fractional LP solutions. Also, we develop an effective MIP-based tree partitioning heuristic for finding good quality solutions for large size problems. Computational results demonstrate the efficacy of the valid inequalities and the proposed heuristic.",
keywords = "Access networks, Fiber optic access networks, MIP-based tree partitioning heuristic, Mixed integer programming, Reformulation- linearization technique (RLT)",
author = "Gigyoung Park and Youngho Lee and Junghee Han",
year = "2014",
month = "1",
day = "1",
doi = "10.1016/j.cor.2014.05.005",
language = "English",
volume = "51",
pages = "52--63",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - A two-level location-allocation problem in designing local access fiber optic networks

AU - Park, Gigyoung

AU - Lee, Youngho

AU - Han, Junghee

PY - 2014/1/1

Y1 - 2014/1/1

N2 - This paper deals with a two-level facility location-allocation problem on tree topology arising from the design of access networks. The access network design problem seeks to find an optimal location of switch and allocation of demands such that the total cost of switch and fiber cable is minimized, while satisfying switch port constraint, switch capacity constraint, and no-split routing constraint. The problem is formulated as a mixed-integer programming model and alternative formulations are developed by the reformulation- linearization technique (RLT) for improving computational effectiveness. By exploiting the tree structure of the problem, we develop some valid inequalities that have complementary strength and devise separation problems for finding effective valid inequalities that cut off fractional LP solutions. Also, we develop an effective MIP-based tree partitioning heuristic for finding good quality solutions for large size problems. Computational results demonstrate the efficacy of the valid inequalities and the proposed heuristic.

AB - This paper deals with a two-level facility location-allocation problem on tree topology arising from the design of access networks. The access network design problem seeks to find an optimal location of switch and allocation of demands such that the total cost of switch and fiber cable is minimized, while satisfying switch port constraint, switch capacity constraint, and no-split routing constraint. The problem is formulated as a mixed-integer programming model and alternative formulations are developed by the reformulation- linearization technique (RLT) for improving computational effectiveness. By exploiting the tree structure of the problem, we develop some valid inequalities that have complementary strength and devise separation problems for finding effective valid inequalities that cut off fractional LP solutions. Also, we develop an effective MIP-based tree partitioning heuristic for finding good quality solutions for large size problems. Computational results demonstrate the efficacy of the valid inequalities and the proposed heuristic.

KW - Access networks

KW - Fiber optic access networks

KW - MIP-based tree partitioning heuristic

KW - Mixed integer programming

KW - Reformulation- linearization technique (RLT)

UR - http://www.scopus.com/inward/record.url?scp=84902181823&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902181823&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2014.05.005

DO - 10.1016/j.cor.2014.05.005

M3 - Article

VL - 51

SP - 52

EP - 63

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

ER -