• Proceedings of the KIEE Conference
• /
• 2003.07b
• /
• pp.1297-1299
• /
• 2003

The Present headway on KNR lines varies from 6 to 10 minutes depending on the each line. Therefore KNR would like to reduce the headway of the all lines by 4 minutes with the implementation of ERTMS/ECTS on-board system. With the operation of HSR lines in 2004 the bottleneck would be expected within a few sections such as Seoul-Siheung which will be the common route between KTX and conventional lines. This study will analyze and compare the optimal headway can be accomplished by the ATS trackside and that of ETRMS/ETCS on-board system within the Seoul-Siheung section.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.1-23
• /
• 2005

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.2
• /
• pp.38-44
• /
• 2009

Recently, automobile industry expands from mechatronics area through intelligent information area, and the telematics technology is one of the greatest developing points. The telematics is utilizing the on-board-unit of vehicle's communication system, and it provides necessary information and value-added service to vehicles as well as drivers. Most of the telematics offers the solution of searching a route or generates an optimal path. This paper investigates telematics with the logistics point of view, such as freight location tracking, vehicle emergency information, etc. The telematics is a core technology of automobile industry, and it becomes new business paradigm of IP(information provider). Especially, ETA(estimated arrival time) of freight and distribution tracing information are critical issues in the logistics industry. The successful integration with telematics is introduced in the paper.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.459-463
• /
• 2007

Overlay multicast is an emerging technology for next generation Internet service to various groups of multicast members. It will take the place of traditional IP multicast which is not widely deployed due to the complex nature of its technology. The overlay multicast which effectively reduces processing at IP routers can be easily deployed on top of a densely connected IP network. An end-to-end delay problem is considered which is serious in the multicast service. To periodically optimize the route in the overlay network and to minimize the maximum end-to-end delay, overlay multicast tree is investigated with genetic Algorithm. Outstanding experimental results are obtained which is comparable to the optimal solution and the tabu search.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.230-239
• /
• 2003

In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.

• Journal of Korean Neurosurgical Society
• /
• v.51 no.3
• /
• pp.182-186
• /
• 2012

In conventional percutaneous disc surgery, introducing instruments into disc space starts by inserting a guide needle into the triangular working zone. However, landing the guide needle tip on the annular window is a challenging step in endoscopic discectomy. Surgeons tend to repeat the needling procedure to reach an optimal position on the annular target. Obturator guiding technique is a modification of standard endoscopic lumbar discectomy, in which, obturator is used to access triangular working zone instead of a guide needle. Obturator guiding technique provides more vivid feedback and easy manipulation. This technique decreases the steps of inserting instruments and takes safer route from the peritoneum.

• Journal of KIBIM
• /
• v.7 no.2
• /
• pp.1-7
• /
• 2017

Urban planning involves many different disciplines. In order for the related stakeholders to have better understanding and acceptable outcomes, planners are required to present a methodology that would properly reflect people's interest. In order to justify the demand and distribute people's interest, planners actively utilized the suitability analysis. Accordingly, a suitability analysis to find the optimal route for high-speed rail was performed in this paper. With ArcGIS and geographic data sets, simple map algebra could be used. The final product of this research was a map indicating the suitable routes for high-speed rail using the shortest path analysis.

• IE interfaces
• /
• v.22 no.4
• /
• pp.359-367
• /
• 2009

The vehicle travel time between the demand points in downtown area is greatly influenced by complex road condition and traffic situation that change real time to various external environments. Most of research in the vehicle routing problems compose vehicle routes only considering travel distance and average vehicle speed between the demand points, however did not consider dynamic external environments such as traffic situation by service time zones. A realistic vehicle routing problem which considers traffic situation of smooth, delaying, and stagnating by three service time zones such as going to work, afternoon, and going home was suggested in this study. A mathematical programming model was suggested and it gives an optimal solution when using ILOG CPLEX. A hybrid genetic algorithm was also suggested to chooses a vehicle route considering traffic situation to minimize the total travel time. By comparing the result considering the traffic situation, the suggested algorithm gives better solution than existing algorithms.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.43.4-43
• /
• 2001

This paper deals with motion identification using artificial neural network (ANN) and its application to automatic ship berthing. As ship motions are expressed by multi-term non-linear model, it is very difficult to find optimal methods for automatic ship berthing especially under environmental disturbances. In this paper, metier identification was used to estimate the effect of environmental disturbances and then the differences between values of identification and state variables are used to estimate the effect of environmental disturbances. A rule based-algorithm using the difference is suggested to cope with the effect of the disturbances. The algorithm adjusts the value of input units of ANN, which control a ship to keep desired route ...

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.500-517
• /
• 2017

In this paper, an improved zone-based routing protocol for heterogeneous wireless sensor networks is proposed. The proposed protocol has fixed the sized zone according to the distance from the base station and used a dynamic clustering technique for advanced nodes to select a cluster head with maximum residual energy to transmit the data. In addition, we select an optimal route with minimum energy consumption for normal nodes and conserve energy by state transition throughout data transmission. Simulation results indicated that the proposed protocol performed better than the other algorithm by reducing energy consumption and providing a longer network lifetime and better throughput of data packets.