• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.6
• /
• pp.1845-1850
• /
• 2014

Railway operators have given a lot of efforts to determine the railway route of the minimum cost. In order to determine the optimal alignment, the alignment should be allocated satisfying the design criteria on various geographical condition with the minimum earth works. The determination of the optimal railway alignment is a kind of combination optimization because that must consider various design elements. This study developed a numerical model to determine the optimal railway alignment with the minimum construction cost. The problem was analyzed by the genetic algorithm, and the concept of the optimal alignment was established with the results from the analyses. The methodology was applied to a fictitious rail construction section and the result was evaluated. This methodology is meaningful considering the fact that the cost for energy is greater than that of the construction.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.4
• /
• pp.1261-1267
• /
• 2014

It is generally recognize that the weight of energy cost for railroad alignment in the life cycle cost is higher than that for roadway. This study analyzed the relative weights of railroad road-bed construction cost and energy cost in the case of Seoul-Pusan High Speed Rail. Recently, the optimization of railroad alignment with computerized methodology has been studies. The optimization is supposed to aim the minimization of life cycle cost including the energy cost as well as the minimization of the construction cost. The operation period of the Seoul-Pusan High Speed Rail is limited to ten years, then various future operation scenario were developed for the next 20 years. The weight of energy cost is estimated 10~30% of the construction cost by scenario, and it is lower than the figure generally expected. It may be meaningful to provide the method to include the energy cost in the railroad alignment optimization.

• Journal of the Korean Society for Railway
• /
• v.17 no.6
• /
• pp.466-473
• /
• 2014

Recently, there is has been significant interest in the allocation systems of rail track capacities with considerations of the multiple train operating companies. The system indicates both a well-defined procedure and an algorithmic method to allocate the rail track capacities. Among them, this study considers the algorithmic method to derive the optimal timetable for the trains, which the companies propose together with their arrival and departure times at each station. However, most studies have focused on the adjustment of the departure and arrival times without conflicts, which could result in incompatible allocations with the line plan, which would result in an insufficient number of trains on each line to satisfy the demands. Our study presents a new optimization model and algorithm for the allocation problem in order to reflect the predetermined line plan. Furthermore, we provide the experimental results that were applied to the Korean high-speed railway network including the Suseo lines.

• Journal of the Korean Society for Railway
• /
• v.15 no.2
• /
• pp.185-192
• /
• 2012

Line planning is to determine the frequency of trains on each line to satisfy origin-destination demand while minimizing total operation cost. However, different from the line planning in passenger transportation, it is more important at which intermediate stations each train should be stopped and shunted because the freight car handling works like drop-off or(and) pick-up can incur much time and high cost so that the delay deteriorates the quality of rail freight transportation service. We present an optimization model for constructing line plan in rail freight transportation to simultaneously minimize the train operation cost and total transportation time of freights. And we suggest a column generation approach for our problem, which can solve the real network instances in reasonable computation times.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.35 no.2
• /
• pp.407-415
• /
• 2015

The railway route and alignment planning have been executed with a limited number of alternatives based on the site pre-survey and the topographic map. This study developed an intelligent railway alignment planning program (ei-Rail) which can derive all the considerable design alternatives and provide the data for the alternative evaluation such as constructions cost, operation cost, and etc. According to the comparisons with prevailing planned railway projects, the time and cost for planning can be reduced as well as the construction costs. This program may contribute to the development of railway industry by reducing the time and cost for planning as well as the total project cost.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.35 no.1
• /
• pp.165-172
• /
• 2015

The appropriateness of railway route design is generally evaluated by the future value corresponding to the travel demand or benefit-cost analysis. These methods may have the limitation for the reasons that all the design alternatives cannot be considered, and the differentiation between the alternatives may not be significant because the alternatives are based on the strict basic scheme such as the design criteria. In addition, the cost varies by the design elements. In this study, all the design alternatives are considered with the automatized tool and the design criteria, and evaluated with the multi-criterion decision making method. The weight for each design element with the analytic hierarchical process may be helpful to derive more efficient railway alignment.

• Journal of Korean Society of Transportation
• /
• v.31 no.2
• /
• pp.80-89
• /
• 2013

The purpose of this research is to optimize the line planning of the intercity passenger railway. In this study, the line planning problem has been formulated into a mixed integer programming by minimizing both user costs (passenger's total travel time) and operator costs (operation, maintenance and vehicle costs) with multiple train types. As a solution algorithm, the branch-and-bound method is used to solve this problem. The change of travel demand, train speed and the number of schedules have been tested through sensitivity analysis. The optimal stop-schedules and frequency as well as system split with respect to each train type have been found in the case study of Kyoung-bu railway line in Korea. The model and results of this research are useful to make a decision for railway operation strategy, to analyze the efficiency of new railway systems and to evaluate the social costs of users and operators.

• Journal of the Korean Society for Railway
• /
• v.17 no.2
• /
• pp.140-147
• /
• 2014

Line planning is an important step to determine the optimal frequencies of trains given the forecasted demand for each train type. The main input data for line planning is the leg traffic demand which can be derived using suitable traffic assignment models. However most assignment models require a line plan, in other words, train frequencies or headways, so that inconsistent results just by the procedural approach to find an optimal line plan after determining leg traffic can be avoided. This paper suggests a unified model that can consider the traffic assignment and line planning, simultaneously. We further provide an elaborated approximation algorithm and, finally, provide experimental results determined for the Korean railway network.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.39 no.6
• /
• pp.853-858
• /
• 2019

One of the methods which can enhance the efficiency of railroad network is construction of interconnection branch line for several route to share one railway. In Korea, this method already has been implemented or excuted as project level. This study suggests a network design model and a solution algorithm to choice most proper site to construction it and determine the priority of branch lines which can be considered in planning level, not project level. The model is a non-linear optimization program which minimize total cost-construction cost, operating cost and passengers' travel cost. The decision variables are a binary variable to explain whether construction or not and its direction and a integer variable of the frequencies of travel routes. The solution algorithm-problem solution and route choice and also the result of implementation for example network are suggested. This result can be more advanced after application in real network and calibration of parameters.

• Journal of the Korean Society for Railway
• /
• v.12 no.3
• /
• pp.427-436
• /
• 2009

This paper introduced Railway Network Design Problem (RNDP) to provide priority decisions on high-speed railway investment scenarios defined by various network segments and train systems. The RNDP optimizes the objective functions of minimize total travel time. Results show that the priority of high-speed railway investment is found to be East-west, West-coast, and South-coast line respectively. An entirely new line built with 400km/h is found to be the best alternative to East-west line. Regarding West-coast and South-coast line, the combined alternative of upgrading Geolla and Kyeonjon line with 200km/h and building a new line with 400km/h and 350km/h for remains of each line is the best.