• Journal of the Korean Operations Research and Management Science Society
• /
• v.6 no.1
• /
• pp.5-13
• /
• 1981

This paper considers a facility moving along a route of straight line to serve several facilities in xy plane. A route is obtained which minimizes the objective function expressed in terms of average rectilinear distance between the service facility and facilities to he served. The forms of the objective functions can be classified into several cases according to the initial and end points of the routes. In some cases, as in the problem of optimal location of new facility, the cordinates of the optimal routes are median of the cordinates of facilities to be served. In others, the optimal routes are obtained after examining the values of objective functions on the boundaries of slopes and intercepts. An overall optimal route is obtained by comparing these routes. The entire procedure has been programmed in BASIC language, and several case examples are given.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.1
• /
• pp.8-13
• /
• 2006

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.185-192
• /
• 2009

In wireless mesh networks multi-rate technology environment, a mesh node can dynamically modify the data transmission rate on a particular link, in response to link distance, or more accurately, the perceived SNR ratio between neighbor nodes. In such networks, existing route selection schemes use a link quality metric. Thus, these schemes may easily result in the network being overloaded. In this paper, a new route metric is proposed; it considers both per-hop service delay and link quality at mesh nodes. In addition, the Load-Aware AODV (LA-AODV) protocol using the proposed metric is presented. The performance evaluation is performed by simulation using the OPNET simulator. It is demonstrated that the LA-AODV protocol outperforms the existing routing protocols using other existing route metrics in multi-rate WMN environment.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.344-351
• /
• 2017

In this paper, we propose the obstacle database management module for obstacle estimation and clustering. The proposed G-eye manager system can create customized walking route for blind people using the UI manager and verify the coordinates of the path. Especially, G-eye management system designed a regional information module. The regional information module can improve the loading speed of the obstacle data by classifying the local information by clustering the coordinates of the obstacle. In this paper, we evaluate the reliability of the walking route generated from the obstacle map. We obtain the coordinate value of the path avoiding the virtual obstacle from the proposed system and analyze the error rate of the path avoiding the obstacle according to the size of the obstacle. And we analyze the correlation between obstacle size and route by classifying virtual obstacles into sizes.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.5 no.2
• /
• pp.246-262
• /
• 2013

With increases in international oil prices, the proportion of fuel cost to the operational costs of a ship is currently increasing. To reduce fuel cost, a method for determining an economical route for a ship based on the acquisition of the sea state and the estimation of fuel consumption is proposed. The proposed method consists of three items. The first item is to acquire the sea state information in real time. The second item is to estimate the fuel consumption of a ship according to the sea state. The last item is to find an economical route for minimal fuel consumption based on the previous two items. To evaluate the applicability of the proposed method, it was applied to routing problems in various ocean areas. The result shows that the proposed method can yield economical ship routes that minimize fuel consumption. The results of this study can contribute to energy savings for environmentally friendly ships.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.9 no.5
• /
• pp.492-498
• /
• 2017

Subsea pipeline route design is a crucial task for the offshore oil and gas industry, and the route selected can significantly affect the success or failure of an offshore project. Thus, it is essential to design pipeline routes to be eco-friendly, economical and safe. Obstacle avoidance is one of the main problems that affect pipeline route selection. In this study, we propose a technique for designing an automatic obstacle avoidance. The Laplacian smoothing algorithm was used to make automatically generated pipeline routes fairer. The algorithms were fast and the method was shown to be effective and easy to use in a simple set of case studies.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2015.10a
• /
• pp.239-240
• /
• 2015

This study aims to clarify current situation of transportation flow and determine to demand forecasting in new route between Korea and Mongolia. By follows the mongolia government information, there will be open 5 new routes in nearest 10 years. Thus, this study purpose is determining the efficiency way by consider time and cost factors for new route between Korea and Mongolia.

• Journal of the Korea Safety Management & Science
• /
• v.13 no.3
• /
• pp.97-105
• /
• 2011

In order to determine home delivery service routes, conditions specified for each parcel such as customer-assigned delivery times and parcel contents should be considered, so the conventional route search algorithms have some limits to be applied for home delivery services. In this study, a multi-purpose route searching algorithm is suggested in order to deal with every requirement of deliveries that vary in delivery distances, contents and appointed times. A simulation study to verify the performances of the system with example data of Seoul and Kyungki provinces shows that it significantly improves the customer satisfaction and the productivity of delivery businesses.

• 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

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.1
• /
• pp.115-122
• /
• 2014

Mobile robot has been studied for long time due to its simple structure and easy modeling. Regarding path planning of the mobile robot, we suggest real-time hybrid path planning algorithm which is the combination of optimal path planning and real-time path planning in this paper. Real-time hybrid path planning algorithm modifies, finds best route, and saves calculating time. It firstly plan the route with real-time path planning then robot starts to move according to the planned route. While robot is moving, update the route as the best outcome which found by optimal path planning algorithm. Verifying the performance of the proposed method through the comparing real-time hybrid path planning with optimal path planning will be done.