• Proceedings of the KSR Conference
• /
• 2010.06a
• /
• pp.380-388
• /
• 2010

This paper explored an effective scheduling method for the Seoul-Busan High Speed Rail. It is important to decide train frequency influencing on scheduling method. Main factors to decide train frequency are location of station, social economic index, land use of station area and travel demand. In this paper, we focused on travel demand which is critical factor to decide train frequency. And we studied on standardized scheduling method. Simulation method is used to analyze the performance of explored method.

• International Journal of Railway
• /
• v.6 no.1
• /
• pp.7-12
• /
• 2013

This paper provides an overview of Pakistan Railways scheduling and rescheduling. First of all, Pakistan Railways is introduced with its brief history and importance in this country. Assets of this network with passengers and freight using this are given. Current hope less situation is leading to privatization of this system as well as promoting short distance traveler to use road and Government efforts to retain is also presented. Train scheduling in Pakistan is being done manually, based on manual time distance graph preparation and resolution of conflicts based on manager's experience and ability. In Real-time management of this traffic Lahore head office is connected with six control stations in the Pakistan, decision for resolution of any disturbance is coordinated among them. It is recommended that computer aided tools must be developed for this system to help traffic managers and it is needed to invest on the segments to increase their speed limits which might attract passengers to use this mode of transportation with high priority.

• Proceedings of the KIEE Conference
• /
• 1998.11a
• /
• pp.341-343
• /
• 1998

Hitherto, train schedules are made by several human experts and the scheduling is very long and tedious job. Moreover those results are not accepted as the optimal solution. The purpose of this research is the finding of optimal methodology and useful constraints for locomotive scheduling. For these purposes, the interactive simulation program for train linking schedule is developed. Some constraints and technique for train linking scheduling is able to be edited or modified by various interactive windows. The constraints, rules and methodology for scheduling can be analyzed and also obtained useful schedule results by using this program.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.513-515
• /
• 1995

A computer aided process is inevitable for the optimization of train operation planning. Developing of train diagrams is very important for the train operation planning. In this paper, the user friendly program related to the train scheduling that can be used for the basic data on developing of train diagram is introduced. It can also provide basic data for other train operation plannings, such as Timetabling, Crew Operation Scheduling, etc. It provides the planner with data moving, data changing and zooming functions, and it can assist the user easily produces their optimal solution. All this operations are performed interactively through graphic windows.

• The KSFM Journal of Fluid Machinery
• /
• v.15 no.2
• /
• pp.36-40
• /
• 2012

Pitch control of wind turbine is activated above rated wind speed for the purpose of rated power regulation. When we design pitch controller, its gain-scheduling is essential due to nonlinear characteristics of aerodynamic torque. In this study, 2-mass model including a vibration mode of drive-train for a 2 MW wind turbine is considered and pitch control with gain-scheduling using a linearization analysis of the nonlinear aerodynamic torque is applied. Some simulation results for the pitch gain-scheduling under step wind speed are presented and investigated. It is shown that gain-scheduling in pitch control is important especially in the region of high wind speeds when there exists a vibration mode of drive-train.

• Journal of the Korean Society for Railway
• /
• v.17 no.4
• /
• pp.313-319
• /
• 2014

Additional train scheduling is often required to increase the capacity of transporting passengers or freight. In most previous studies on scheduling additional trains, operation time of the added train is designated first; and then the train operation feasibility is examined. However, it is often difficult to apply this approach to domestic trains because the density of the railroad network in Korea is high and various types of trains are in use. Moreover, for freight trains, it is even more challenging because the delay is accumulated due to lower priority whenever a freight train and a passenger train contend for a common segment of rail. In this paper, we address the additional train scheduling problem which entails finding a feasible schedule for an additional train having a fixed departure time or departure time windows. The problem is modeled as a mixed integer programming and a column generation technique is used to solve it.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.1
• /
• pp.67-73
• /
• 2001

This paper proposes a new scheduling algorithm for broadband ATM access network. The existed scheduling algorithms (Train, Chao. Dynamic scheduling algorithm) have high cell loss rate and waste channel. These proposed mechanism utilize to control of multimedia services based on the quality of service level of the input traffic This paper suggests a functional architecture of scheduling and the scheduling algorithm to satisfy various QoS requirements. The performance measures of interest, namely steady-state cell loss probability and average delay, average delay, are discussed by simulation results.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.4B no.1
• /
• pp.29-35
• /
• 2004

Locomotive scheduling in railway systems experiences many difficulties because of the complex interrelations among resources, knowledge and various constraints. Artificial intelligence technology has been applied to solve these scheduling problems. These technologies have proved to be efficient in representing knowledge and rules for complex scheduling problems. In this paper, we have applied the CSP (Constraints Satisfaction Problems) programming technique, one of the AI techniques, to solve the problems associated with locomotive scheduling. This method is more effective at solving complex scheduling problems than available mathematical programming techniques. The advanced locomotive scheduling system using the CSP programming technique is realized based on the actual timetable of the Saemaul type train on the Kyong-bu line. In this paper, an overview of the CSP programming technique is described, the modeling of domain and constraints is represented and the experimental results are compared with the real-world existing schedule. It is verified that the scheduling results by CSP programming are superior to existing scheduling performed by human experts. The executing time for locomotive scheduling is remarkably reduced to within several decade seconds, something requiring several days in the case of locomotive scheduling by human experts.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.1810-1815
• /
• 2011

Although the effectiveness of an express train's service is measured in "Total System Time or Cost" units, many cases had used indirect method what based on the distintion by number of passengers in a station or experiential knowledgements. These methods are not guarantee itself as an optimal strategy. Focusing "Total System Time or Cost" directly, this paper investigates the express train service's stop scheduling based on each OD-volume and trip time which mainly affect system time and cost. To do this, we built an IP model which has a binary set presenting express train's stop scheduling as decision variable and suggest a Genetic Algorithm (GA) to find heuristic optimal solution.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2198-2202
• /
• 2003

The data transmission of MVB(Multifunction Vehicle Bus) of TCN(Train Network Communication) is divided into the periodic transmission phase and the sporadic transmission phase. TCN standard defines the event-polling method for the message transfer in the sporadic phase. However, since the event-polling method does not use pre-scheduling to the priority of the messages to be transmitted, it is inefficient for the real-time systems. To schedule message transmission, a master node should know the priority of message to be transmitted by a slave node prior to the scheduling the sporadic phase, but the existing TCN standard does not support any protocol for this. This paper proposes the slave frame bit-stuffing algorithm, with which a master node gets the necessary information for transmission scheduling and includes the simulation results of the event-polling method and the proposed algorithm.