ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Technical Note - Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
Cited 19 time in scopus Download 2 time Share share facebook twitter linkedin kakaostory
저자
이충목, 이경식, 박경철, 박성수
발행일
201208
출처
Operations Research, v.60 no.3, pp.604-610
ISSN
0030-364X
출판사
INFORMS
DOI
https://dx.doi.org/10.1287/opre.1120.1049
협약과제
12MC1100, SMART Post 구축 기술 개발, 정훈
초록
This paper presents a robust optimization approach to the network design problem under traffic demand uncertainty. We consider the specific case of the network design problem in which there are several alternatives in edge capacity installations and the traffic cannot be split over several paths. A new decomposition approach is proposed that yields a strong LP relaxation and enables traffic demand uncertainty to be addressed efficiently through localization of the uncertainty to each edge of the underlying network. A branch-and-price-and-cut algorithm is subsequently developed and tested on a set of benchmark instances. © 2012 INFORMS.
KSP 제안 키워드
Benchmark instances, Branch-and-price, Decomposition approach, LP relaxation, Network Design Problem, Robust network design, Robust optimization, Traffic Demand, demand uncertainty, optimization approach