DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Sung, Chang-Sup | - |
dc.contributor.advisor | 성창섭 | - |
dc.contributor.author | Song, Sang-Hwa | - |
dc.contributor.author | 송상화 | - |
dc.date.accessioned | 2011-12-14T02:39:53Z | - |
dc.date.available | 2011-12-14T02:39:53Z | - |
dc.date.issued | 2003 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=231072&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/40557 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 산업공학과, 2003.8, [ viii, 134 p. ] | - |
dc.description.abstract | This thesis considers layered network design problems for communication and supply chain networks, where the main decision problem is to determine the set of logical tunnels to be established and the logical paths, through which any given demands should be routed. The problems are described in mathematical expressions, for which solution algorithms are developed in the integer programming approaches. In Chapter 2 and Chapter 3, layered communication network design problems for ATM networks and virtual private networks (VPN’s) are considered. Chapter 4 considers a layered supply chain network design problem for cross-docking networks. Specifically, Chapter 2 considers a combined problem of establishing virtual paths (VP’s) and routing traffic (packet) demands through the virtual paths in ATM networks where each physical link is subject to its capacity constraints. The problem is modeled as a path-based formulation for which a branch-and-price solution algorithm is derived. The solution algorithm is composed of an efficient pricing algorithm and branching rules based on a variable dichotomy which does not destroy the structure of the associated pricing problems. Computational experiments are performed to test the efficiency of the algorithm, which show that the proposed solution algorithm works quite well in finding optimal solutions (for the test instances) within reasonable time. Its immediate application may be made to a centralized ATM network management on mid-term global reconfiguration and long-term VP planning. Chapter 3 considers a VPN tunnel design problem of establishing VPN tunnels between nodes subject to a VPN tunnel hop count restriction. The relationship between the VPN tunnel design problem and the minimum-cost directed Steiner tree problem is investigated in detail. The problem is modeled as a layered network flow model for which the exact solution is derived based on the path-based branch-and-price methodology with a preprocessing technique in... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | 가상사설망 | - |
dc.subject | 크로스도킹 | - |
dc.subject | 공급사슬관리 | - |
dc.subject | 가상경로 | - |
dc.subject | Layered Network | - |
dc.subject | virtual path | - |
dc.subject | virtual private network | - |
dc.subject | supply chain management | - |
dc.subject | cross-docking | - |
dc.subject | 계층형 네트워크 | - |
dc.title | Design of layered networks for communication and supply chain networks | - |
dc.title.alternative | 통신 및 공급사슬 네트워크를 위한 계층형 네트워크의 최적 설계에 관한 연구 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 231072/325007 | - |
dc.description.department | 한국과학기술원 : 산업공학과, | - |
dc.identifier.uid | 000995205 | - |
dc.contributor.localauthor | Sung, Chang-Sup | - |
dc.contributor.localauthor | 성창섭 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.