A Planning Method of Optical Fiber Cable Routing Based on Integer Programming(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)
スポンサーリンク
概要
- 論文の詳細を見る
Currently, the plan to route an optical fiber cable line to households is in progress. In this planning, generally, the trunk line is constructed utilizing electric power company or communication firm poles. A closure (splice closure) is then installed on a specific pole of the trunk line, and branch lines extend from the closure to respective households. Thus, when an optical fiber cable line is extended to ordinary households, a planning problem arises in which the type of closure to be used, the poles that bear the closures, and the routing methods of the trunk and branch lines have to be determined simultaneously so that the total cost can be minimized. This study proposes a near-optimal solution of the planning problem on the basis of the integer programming.
- 東海大学の論文
著者
-
HADA Takao
Department of Management Engineering
-
Hada Takao
Department Of Management Systems Engineering
-
MORIYAMA Hiroumi
Department of Management Engineering, School of Engineering
-
Moriyama Hiroumi
Department Of Management Systems Engineering
-
Moriyama Hiroumi
Department Of Management Engineering
関連論文
- An Algorithm for the Parameters Determination of a Dynamic Priority Discipline in a Central Server Model
- Approximate Solutions for Assembly Process Formation Problem in Aggregative Production System
- A Planning Method of Optical Fiber Cable Routing Based on Integer Programming(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)
- A Near-Optimal Solution for the Vehicle Routing Problem with Multiple Use of Vehicles(Production and Logistics)
- Approximate Algorithm For Group Technology Line Formation Problem(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)
- A Branch and Bound Algorithm for Precedence Constrained Knapsack Problem
- An Approximate Algorithm for the Resource Constrained Grouping Problem Based on the Lagrangian Relaxation Method