L-shaped decomposition method for multi-stage stochastic concentrator location problem

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

A stochastic version of a concentrator location problem is dealt with in which traffic demand at each terminal location is uncertain. The concentrator location problem is defined as to determine the following: (i) the numbers and locations of concentators that are to be open, and (ii) the allocation of terminals to concentrator sites. The problem is formulated as a stochastic multi-stage integer linear program, with first stage binary variables concerning network design and continuous recourse variables concerning expansion of capacity. Given a first stage decision, the series of realization of traffic demand may possibly imply a violation of the capacity constraint of the concentrator. Therefore from the second stage to the last stage, recourse action is taken to correct the violation. The objective function minimizes the cost of connecting terminals and the cost of opening concentrators and the expected recourse cost of capacity expansion. We propose a new algorithm which combines an L-shaped method and a branch-and-bound method. Under some assumptions it decomposes the problem into a set of problems as many as the number of stages in parallel. Finally we demonstrate the computational efficiency of our algorithm for the multi-stage model.

Original languageEnglish
Pages (from-to)317-332
Number of pages16
JournalJournal of the Operations Research Society of Japan
Volume43
Issue number2
Publication statusPublished - 2000 Jun
Externally publishedYes

Fingerprint

Decomposition
Location problem
Costs
Violations
Integer
Capacity expansion
Capacity constraints
Stage model
Linear program
Branch-and-bound
Network design
Objective function

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this

@article{d105328f5daa48ee8a69b4fee385438f,
title = "L-shaped decomposition method for multi-stage stochastic concentrator location problem",
abstract = "A stochastic version of a concentrator location problem is dealt with in which traffic demand at each terminal location is uncertain. The concentrator location problem is defined as to determine the following: (i) the numbers and locations of concentators that are to be open, and (ii) the allocation of terminals to concentrator sites. The problem is formulated as a stochastic multi-stage integer linear program, with first stage binary variables concerning network design and continuous recourse variables concerning expansion of capacity. Given a first stage decision, the series of realization of traffic demand may possibly imply a violation of the capacity constraint of the concentrator. Therefore from the second stage to the last stage, recourse action is taken to correct the violation. The objective function minimizes the cost of connecting terminals and the cost of opening concentrators and the expected recourse cost of capacity expansion. We propose a new algorithm which combines an L-shaped method and a branch-and-bound method. Under some assumptions it decomposes the problem into a set of problems as many as the number of stages in parallel. Finally we demonstrate the computational efficiency of our algorithm for the multi-stage model.",
author = "Takayuki Shiina",
year = "2000",
month = "6",
language = "English",
volume = "43",
pages = "317--332",
journal = "Journal of the Operations Research Society of Japan",
issn = "0453-4514",
publisher = "Operations Research Society of Japan",
number = "2",

}

TY - JOUR

T1 - L-shaped decomposition method for multi-stage stochastic concentrator location problem

AU - Shiina, Takayuki

PY - 2000/6

Y1 - 2000/6

N2 - A stochastic version of a concentrator location problem is dealt with in which traffic demand at each terminal location is uncertain. The concentrator location problem is defined as to determine the following: (i) the numbers and locations of concentators that are to be open, and (ii) the allocation of terminals to concentrator sites. The problem is formulated as a stochastic multi-stage integer linear program, with first stage binary variables concerning network design and continuous recourse variables concerning expansion of capacity. Given a first stage decision, the series of realization of traffic demand may possibly imply a violation of the capacity constraint of the concentrator. Therefore from the second stage to the last stage, recourse action is taken to correct the violation. The objective function minimizes the cost of connecting terminals and the cost of opening concentrators and the expected recourse cost of capacity expansion. We propose a new algorithm which combines an L-shaped method and a branch-and-bound method. Under some assumptions it decomposes the problem into a set of problems as many as the number of stages in parallel. Finally we demonstrate the computational efficiency of our algorithm for the multi-stage model.

AB - A stochastic version of a concentrator location problem is dealt with in which traffic demand at each terminal location is uncertain. The concentrator location problem is defined as to determine the following: (i) the numbers and locations of concentators that are to be open, and (ii) the allocation of terminals to concentrator sites. The problem is formulated as a stochastic multi-stage integer linear program, with first stage binary variables concerning network design and continuous recourse variables concerning expansion of capacity. Given a first stage decision, the series of realization of traffic demand may possibly imply a violation of the capacity constraint of the concentrator. Therefore from the second stage to the last stage, recourse action is taken to correct the violation. The objective function minimizes the cost of connecting terminals and the cost of opening concentrators and the expected recourse cost of capacity expansion. We propose a new algorithm which combines an L-shaped method and a branch-and-bound method. Under some assumptions it decomposes the problem into a set of problems as many as the number of stages in parallel. Finally we demonstrate the computational efficiency of our algorithm for the multi-stage model.

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

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

M3 - Article

VL - 43

SP - 317

EP - 332

JO - Journal of the Operations Research Society of Japan

JF - Journal of the Operations Research Society of Japan

SN - 0453-4514

IS - 2

ER -