• Proceedings of the KSR Conference
• /
• 2008.11b
• /
• pp.1220-1226
• /
• 2008

A route control in railway is one of the very important system to operate a train. An efficient train route control assures to increase train operation performance with a same railway system. The erroneous route control can accompany serious accidents which occur train collision or derailment which provokes death. A Route control carries out exactly lest the accident should take place. An interlocking table is widely used for the exact route control. The table has the problem of its exactness proving because it has been established by experts. In this paper, We tried to formalize a route control using mathematical logic. A route consists of symbolized tracks, signals, switch and crossing. It represents as a set, respectively. We proposed route setting control logic, converted the elements to set logics and construct route logics with the set logics of the elements. Finally we proposed a model which presents a prototype routes and we proved the proposed logics using the proposed method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.57-78
• /
• 2005

The vehicle routing problem (VRP) is to determine a set of feasible vehicle routes, one for each vehicle, such that each customer is visited exactly once and the total distance travelled by the vehicles is minimized. A feasible route is defined as a simple circuit including the depot such that the total demand of the customers in the route does not exceed the vehicle capacity. While there have been significant advances recently in exact solution methodology, the VRP is not a well solved problem. We find most approaches still relying on the branch and bound method. These approaches employ various methodologies to compute a lower bound on the optimal value. We introduce a new modelling approach, termed route-splitting, for the VRP that allows us to address problems whose size is beyond the current computational range of set-partitioning models. The route-splitting model splits each vehicle route into segments, and results in more tractable subproblems. Lifting much of the burden of solving combinatorially hard subproblems, the route-splitting approach puts more weight on the LP master problem, Recent breakthroughs in solving LP problems (Nemhauser, 1994) bode well for our approach. Lower bounds are computed on five symmetric VRPs with up to 199 customers, and eight asymmetric VRPs with up to 70 customers. while it is said that the exact methods developed for asymmetric instances have in general a poor performance when applied to symmetric ones (Toth and Vigo, 2002), the route splitting approach shows a competent performance of 93.5% on average in the symmetric VRPs. For the asymmetric ones, the approach comes up with lower bounds of 97.6% on average. The route-splitting model can deal with asymmetric cost matrices and non-identical vehicles. Given the ability of the route-splitting model to address a wider range of applications and its good performance on asymmetric instances, we find the model promising and valuable for further research.

• Journal of the Korean Society for Railway
• /
• v.5 no.2
• /
• pp.104-111
• /
• 2002

The purpose of interlocking system was to prevent the route for a train being set up and its protecting signal cleared if there was already another, conflicting route set up and the protecting signal for that route cleared. This paper proposed Interlocking Inspection System(IIS) consisting of interlocking simulator and field simulator to operate interlocking test of computer based Electronic Interlocking System(EIS) in this paper. Interlocking simulator consists of Design Edit System(DES), Logical Database Management Tool(LDMT) and real-time confirming system, field simulator is a equipment to simulate a control object of EIS and constitutes configuration operated in 19 inch standard rack. As a result of test to prove capacity of this IIS, the efficiency was shown as excellent. Therefore by using inspection system, we obtain every advantages. It has the functions for test data generation and automatic test execution based on personal computer. Time and cost for test work can be reduced more efficiently by using this developed inspection system

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.67-74
• /
• 2001

In this paper, we propose a new method to improve tile processing of route recovery of the existing DSR algorithm on detection of route error. In mobile ad hoc networks, mobile nodes themselves have routing capability. Thus, a well-defined routing protocol is required for route set-up between two mobile nodes. However, the existing DSR routing protocol has problem with dropping of packets due to the recovery delay when a route error occurs. In order to alleviate tile problem, we propose an enhanced DSR protocol to reduce the route error recovery tine and evaluate the protocol through simulation. As tile result of evaluation, we found the proposed DSR protocol provided about 4 to 30 times faster route error recovery time according to the test scenario than the existing DSR protocol.

• Journal of Korean Society of Transportation
• /
• v.23 no.3 s.81
• /
• pp.35-47
• /
• 2005

This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.

• Proceedings of the KSR Conference
• /
• 2000.05a
• /
• pp.261-268
• /
• 2000

The purpose of interlocking system was to prevent the route for a train being set up and its protecting signal cleared if there was already another, conflicting route set up and the protecting signal for that route cleared. Recently, the computer based control systems instead of conventional relays circuitry are widely used to industrial systems, therefore, interlocking system are rapidly changing from relay interlocking system to computer controlled interlocking system that control requirements of interlocking at junctions using electronic circuits. However, the reliability of interlocking logic for those systems are harder to demonstrate than in traditional relays circuitry because the faults or errors can not be analyzed and predicted to those systems, In this paper, by examine checking technique of computer controlled interlocking system, we will to acquire interlocking inspection algorithm and method for computer controlled interlocking system

• Journal of Navigation and Port Research
• /
• v.41 no.6
• /
• pp.445-450
• /
• 2017

It is necessary to set a route to reflect the traffic flow for the safety of the traffic vessels. This ongoing analysis is needed to ensure that the vessels comply with a route. The purpose of this study is to discover the problems of the recommended route vicinity for Wando Harbor and suggest an improvement plan. We used a support vector machine based on the ship's trajectory to establish an efficient route center line. Since the vessels should navigate to the starboard side, with reference to the center line of the recommended route, the trajectories of the vessels were divided into two clusters. The support vector machine is being used in many fields such as pattern recognition, and it is effective for this binary classification. As a result of this study, about 79.5 % of the merchant eastbound ships in a 2.4 NM distance to Jangjuk Sudo did not observe the recommended route, so the risk of collision always existed. The contraflow traffic rate of the route of the eastbound ships decreased from 79.5 % to 30.9 % when the recommended route was reset about 300 meters to the north, from its present position. The support vector machine applied in this study is expected to be applicable, to effectively set the route center line because the ship trajectories can be classified into two clusters.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.6 s.336
• /
• pp.23-32
• /
• 2005

This paper proposes a new algorithm for the energy constraint ad-hoc network which efficiently spread the energy usage over the network through the backup route scheme in order to increase the network lifetime. Recently, the various energy-efficient routing algorithms based on On-demanding method are proposed. Among them, PSR(Power-aware Source Routing) increased the network lifetime through the periodical route alternation depended on the use of the battery while DSR(Dynamice Source Routing) uses only the route selected during the route discovery phase. But PSR has a problem that it increases the route overhead because of the frequent flooding for the route alternation. For solving this problem, we propose HPSR(Hierarchical Power-aware Source Routing) which uses the backup route set during the route discovery in order to alternation the route without the flooding. HPSR increases the network lifetime due to the frequent route alternation using backup route while it decreases the routing overhead due to the reduced flooding. In this paper, we also prove the performance of HPSR through the simulation using OPNET.

• Journal of the Korean Society of Industry Convergence
• /
• v.24 no.6_2
• /
• pp.891-897
• /
• 2021

In this paper, we propose a destination optimal route algorithm for providing route finding service for the transportation handicapped by using the multi-criteria decision-making technique and the modified A-STAR optimal route search algorithm. This is a method to set the route to the destination centering on safety by replacing the distance cost of the existing A-STAR optimal route search algorithm with the safety cost calculated through AHP/TOPSIS analysis. To this end, 10 factors such as road damage, curb, and road hole were first classified as poor road factors that hinder road driving, and then pairwise comparison of AHP was analyzed and then defined as the weight of TOPSIS. Afterwards, the degree of driving safety was quantified for a certain road section in Busan through TOPSIS analysis, and the development of an optimal route search algorithm for the transportation handicapped that replaces the distance cost with safety in the finally modified A-STAR optimal route algorithm was completed.

• Journal of Korean Society of Transportation
• /
• v.17 no.2
• /
• pp.137-147
• /
• 1999

This paper studies on the optimal bus network design in the framework of the set covering theory. The theory enables to cover passenger's loading and alighting areas as the set, and maximize the covering set as much as possible. In other words, it calculates the minimal set of the bus routes for covering whole bus passengers demand. After the optimal set of the bus routes is generated by the set covering theory, multimodal traffic equilibrium assignment is used for evaluating the generated set in terms of passenger's mode and route choice behavior. Whilst most previous works on it have been based on analyzing a specific route in a limited area, this study seeks to optimize the whole bus network.