• Korean Journal of Geomatics
• /
• v.4 no.2
• /
• pp.53-57
• /
• 2004

Due to the traffic congestion and public-oriented transportation policies of Seoul, public transportation is receiving attention and being used increasingly. However, current transport routes configuration is showing unbalanced accessibility throughout the city area creating differences in time, expenses and metal burden of users who travel the same distances. One of the reasons is that transport route planning has been partially empirical and non-quantitative tasks due to lack of relevant methods for assessing the complexity of the transport routes. This paper presents a method to compute the connectivity of public transport system based on the topological structure of the network of transport routes. The main methodological issue starts from the fact that the more transfers take place, the deeper the connectivity becomes making that area evaluated as less advantageous as for public transport accessibility. By computing the connectivity of each bus or subway station with all others in a city, we can quantify the differences in the serviceability of city areas based on the public transportation. This paper is based on the topological interpretation of the routes network and suggests an algorithm that can automate the computation process. The process is illustrated using a simple artificial network data built in a GIS.

• Journal of the Korea Society for Simulation
• /
• v.22 no.4
• /
• pp.119-128
• /
• 2013

We need to consider a number of technical constraints to build new warehouses. In particular, it is essential to assure that the flow of trucks is smooth and seamless even in large size warehouses. The flow of trucks in warehouses are subject to, for instance, the routes of trucks, the frequency and the time stamps of their in-and-out's. Also, the routes of trucks interfere each other. Thus, finding good flow of trucks in a warehouse is a tough task when all interferences among trucks are considered. In this paper, we find some layouts of the routes of trucks exhibiting good performance based on simulation. we use ARENA ver. 11 for simulation.

• Journal of the Korean Institute of Navigation
• /
• v.21 no.2
• /
• pp.19-40
• /
• 1997

When designing new marine traffic routes, it is desirable that the congestion due to traffic volume is evaluated by theoretical traffic capacity or by traffic simulation. Most of these techniques are applied to single server which is not considered channel width. Over-taking or paralle sailing of two or more vessels is allowalbe in Dover, Uraga, Gaduk-sudo, etc under their traffic capacity. In this paper, the Bumper Model is introduced to multiple severs in narrow channel and applied to Uraga Channel in Japan. The minimum width of Uraga Channel is 1, 400 m and its design traffic capacity is evaluated 19.26 ~ 19.52% of the basic traffic capacity. The traffic capacity on Gaduk Channel according to Busan New Port Development in 2011 will be estimated 3.59 % of maximum density and equal to 18.6% of that on Uraga Channel in 1992. The channel width Gaduk-sudo is designed 1, 600~2, 460 m and evaluated safe enough.

• Journal of Preventive Medicine and Public Health
• /
• v.38 no.2
• /
• pp.163-169
• /
• 2005

Objectives: Pedestrian traffic injuries have been an important cause of childhood mortality and morbidity for decades. The aim of this study was to describe the epidemiological characteristics of child pedestrian traffic injuries that occurred during 2000 in one metropolitan city and its school-zones, and to determine the factors associated with those accidents. Methods: A cross-sectional study was performed in 2001. Police records were used to identify the cases of pedestrian injury. Children aged between 6 and 15 years, injured during road walking, were included in this study. A direct survey of the environmental factors within the school-zones in study area (n=116) was also performed. Self-administered questionnaires, via mail and telephone surveys, were used to assess the safety education programmes. The schools were divided into two groups according to the occurrence of pedestrian traffic injuries in their school-zone. Results: Pedestrian injuries (n=597) were found to account for 3.2% of all traffic injuries in the subject area. The epidemiological characteristics were not significantly different between genders. There were some significant risk factors within the environmental factors, such as local road (OR: 2.3, 95% CI=1.05-5.35), heavy traffic volume (OR: 2.2, 95% CI=1.00-5.04), poor visibility of speed-limit signs (OR: 2.8, 95% CI=1.25-6.42), no separation of pedestrian routes from cars (OR: 2.6, 95% CI=1.02-6.75) and barriers on the pedestrian routes (OR: 2.2, 95% CI=1.01-5.08). Only one factor, that of education in a safety-park (OR: 0.3, 95% CI=0.09-0.96), was significantly associated in the traffic and pedestrian safety education factors. Conclusion: Significant associations with pedestrian injury risk were identified in some of the modifiable environmental factors than in the educational factors.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.350-355
• /
• 2007

Border gateway protocol allows autonomous systems(ASes) to apply diverse routing policies for selecting routes and for propagating reachability information to other ASes. Although a significant number of studies have been focused on the Internet topology, little is known about what routing policies network operators employ to configure their networks. In this paper, we infer and characterize routing policies employed in the Internet. We find that routes learned from customers are preferred over those from peers and providers, and those from peers are typically preferred over those from providers. We present an algorithm for inferring and characterizing export policies. We show that ASes announce their prefixes to a selected subset of providers to perform traffic engineering for incoming traffic. We find that the selective announcement routing policies imply that there are much less available paths in the Internet than shown in the AS connectivity graph, and can make the Internet extremely sensitive to failure events. We hope that our findings will help network operators in designing routing policies.

• The Journal of Information Technology and Database
• /
• v.7 no.1
• /
• pp.42-53
• /
• 2000

The major goal of this research is to develop an optimal route search algorithm for an intelligent route guidance system, one sub-area of ITS. ITS stands for intelligent Transportation System. ITS offers a fundamental solution to various issues concerning transportation and it will eventually help comfortable and swift moves of drivers by receiving and transmitting information on humans, roads and automobiles. Genetic algorithm, and fuzzy logic are utilized in order to implement the proposed algorithm. Using genetic algorithm, the proposed algorithm searches shortest routes in terms of travel time in consideration of stochastic traffic volume, diverse turn constraints, etc. Then using fuzzy logic, it selects driver-preference optimal route among the candidate routes searched by GA, taking into account various driver's preferences such as difficulty degree of driving and surrounding scenery of road, etc. In order to evaluate this algorithm, a virtual road-traffic network DB with various road attributes is simulated, where the suggested algorithm promptly produces the best route for a driver with reference to his or her preferences.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2012.06a
• /
• pp.52-54
• /
• 2012

Saigon-Vungtau fairway is the main and the most important fairway of the major economic areas: Ho Chi Minh City, Dong Nai Province and Ba Ria-Vung Tau Province in Vietnam. In last 5 years, 80% of accidents happened on the fairway were caused by collision and contact/impact. This presentation study on marine traffic investigation in the adjacent of the fairway to find out problems related to marine traffic for improving Marine Traffic Safety Management in this area.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.4
• /
• pp.1836-1842
• /
• 2015

On road networks, the clustering of moving objects is important for traffic monitoring and routes recommendation. The existing schemes find out density route by considering the number of vehicles in a road segment. Since they don’t consider the features of each road segment such as width, length, and directions in a road network, the results are not correct in some real road networks. To overcome such problems, we propose a clustering method for congested routes discovering from the trajectories of moving objects on road networks. The proposed scheme can be divided into three steps. First, it divides each road network into segments with different width, length, and directions. Second, the congested road segments are detected through analyzing the trajectories of moving objects on the road network. The saturation degree of each road segment and the average moving speed of vehicles in a road segment are computed to detect the congested road segments. Finally, we compute the final congested routes by using a clustering scheme. The experimental results showed that the proposed scheme can efficiently discover the congested routes in different directions of the roads.

• 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.

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1544-1553
• /
• 2017

The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.