• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.168-170
• /
• 2016

Drone package delivery routing problem is realistic problem used to find efficient route of drone package delivery service. In this paper, we present an approach for solving drone routing problem for package delivery service using two different heuristics algorithms, genetic and nearest neighbor. We implement and analyze both heuristics algorithms for solving the problem efficiently with respect to cost and time. The respective experimental results show that for the range of customers 10 to 50 nearest neighbor and genetic algorithms can reduce the tour length on average by 34% and 40% respectively comparing to FIFO algorithm.

• Proceedings of the KSR Conference
• /
• 2006.11b
• /
• pp.530-537
• /
• 2006

Recently, the railroad route plan is trying to minimize the damage of the local resident which is caused by railroad construction. For this reason, reducing the banking height of soil roadbed, lowering the bridge girder height of a solid intersection and a part of cross river, the through bridge type which can achieve a required span length must apply. The representative through bridges of railroad are arch bridges, truss bridges and plate girder bridges, the through plate girder bridge of variable section can apply that the span length of these bridges is about $30{\sim}50m$, namely, middle span length bridge types, and that can satisfy structural capacity and beauty of railroad at the same time. This paper introduces plan and design process of the Su-eo cheon bridge applied by a through plate girder bridge type of the Jinju-Gwangyang double track 6th construction ordered at Korea Rail network Authority in 2005.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.81-90
• /
• 2004

A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile nodes dynamically self-organizing in arbitrary and temporary network topologies without the use of any existing network infrastructure. The AODV (Ad Hoc On-Demand Distance Vector) Protocol is one of the typical reactive routing protocols, in that mobile nodes initiate routing activities only in the presence of data packets in need of a route. In this paper, we focus upon the local repair mechanism of AODV. When a link is broken, the upstream node of the broken link repairs the route to the destination by initiating a local route discovery process. The process involves the flooding of AODV control messages in every node within a radius of the length from the initiating node to the destination. In this paper, we propose an efficient local repair scheme for AODV called AFLRS (AODV-based Fast Local Repair Scheme). AFLRS utilizes the existing routing information in the intermediate nodes which have been on the active route to the destination before a link break occurs. AFLRS can reduce the flooding range of AODV control messages and the route recovery time because it can repair route through the intermediate nodes. For the performance evaluation of the proposed AFLRS, we have simulated the local repair mechanisms by using NS2 and AODV-UU. The performance results show that AFLRS can achieve faster route recovery than the local repair mechanism of AODV.

• Journal of Korean Society of Transportation
• /
• v.26 no.5
• /
• pp.227-235
• /
• 2008

This study analyzed the efficiency of a trunk with branches and a trunk with feeders route system comparing the user cost and operator cost of those route systems. Basically, a trunk with branches is more efficient than a trunk with feeders in the passengers' perspective if the transit system of a trunk and feeders are the same. In the case that the trunk system is hierarchically higher than the feeder system, a trunk with feeders has the competitive edge over a trunk with branches if the saving of travel cost induced by using the trunk line is larger than the increasing waiting and transfer cost. This result is consistent with the previous research by Park et al.(2007c), which analyzed the efficiency of hierarchical structure in a grid transit network. If the travel demand of each origins and destinations is low, increasing headway according to the travel demand can increase passenger load or operating efficiency in a trunk with feeders route system. In this case, a trunk with feeders route system is more prevalent as the operating cost, route length, and number of destinations increases, while it is less prevalent as the transfer cost and passengers' time value of the waiting time increases. In cases that central business district, which is located in the middle of a trunk line, generates travel demand, a trunk with feeders is more efficient than a trunk with branches with the increasing travel demand from and to the CBD. Therefore it can be concluded that to have a dual operating system between CBD and suburban is more efficient than one type transit system. The efficiency of that system can be increased through an efficient transfer system that can reduce the transfer cost.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.24 no.6
• /
• pp.670-678
• /
• 2018

In coastal waters where the traffic volume of the ship is high, there is a high possibility of a collision accident because complicated encounter situations frequently occurs between ships. To reduce the collision accidents at sea, a quantitative collision risk assessment is required in addition to the navigator's compliance with COLREG. In this study, a new collision risk assessment system was developed to evaluate the collision risk on ship's planned sailing routes. The appropriate collision risk assessment method was proposed on the basis of reviewing existing collision risk assessment models. The system was developed using MATLAB and it consists of three parts: Map, Bumper and Assessment. The developed system was applied to the test sea area with simple computational conditions for testing and to actual sea areas with real computational conditions for validation. The results show the length of own ship, ship's sailing time and sailing routes affect collision risks. The developed system is expected to be helpful for navigators to choose the optimum safe route before sailing.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.4
• /
• pp.67-75
• /
• 2020

This paper proposes a methodology for gantry route optimization in order to maximize the productivity of a odd-type surface mount device (SMD). A odd-type SMD is a machine that uses a gantry to mount electronic components on the placement point of a printed circuit board (PCB). The gantry needs a nozzle to move its electronic components. There is a suitability between the nozzle and the electronic component, and the mounting speed varies depending on the suitability. When it is difficult for the nozzle to adsorb electronic components, nozzle exchange is performed, and nozzle exchange takes a certain amount of time. The gantry route optimization problem is divided into the mounting order on PCB and the allocation of nozzles and electronic components to the gantry. Nozzle and electronic component allocation minimized the time incurred by nozzle exchange and nozzle-to-electronic component compatibility by using an mixed integer programming method. Sequence of mounting points on PCB minimizes travel time by using the branch-and-price method. Experimental data was made by randomly picking the location of the mounting point on a PCB of 800mm in width and 800mm in length. The number of mounting points is divided into 25, 50, 75, and 100, and experiments are conducted according to the number of types of electronic components, number of nozzle types, and suitability between nozzles and electronic components, respectively. Because the experimental data are random, the calculation time is not constant, but it is confirmed that the gantry route is found within a reasonable time.

• Health Policy and Management
• /
• v.19 no.3
• /
• pp.27-44
• /
• 2009

The length of stay in emergency departments has been used as a quality indicator to reflect the overall efficiency of emergency care. Identifying characteristics associated with length of stay is critical to monitor overcrowding and improve efficient throughput function of emergency departments. This study examined the level of waiting time for initial assessment by physician and length of stay in emergency departments. Furthermore, we investigated the characteristics of patients' attendance associated with length of stay. An observational study was performed for a sample of 1,526 patients visiting ten nation-wide emergency departments. A structured form was designed to collect information about patients' demographics, route of admission, time and mode of arrival, triage level, cause of attendance, initial assessment time by physician, departure time, and disposition. Multiple regression analysis was performed to determine factors associated with length of stay. The average length of stay was 209.4 minutes (95% confidence interval [CI]=197.1-221.7), with a mean waiting time for initial assessment of 5.9 minutes (95% CI=5.1-6.7). After controlling for emergency department characteristics, increasing age, longer waiting times, attendance due to diseases, higher acuity, multiple diagnoses($\geq$2) and requiring admission or transfer to other health care facilities were positively associated with length of stay in emergency departments. The findings suggest that both patients' characteristics and the flow between emergency departments and parent hospitals should be taken into account in predicting length of stay in emergency departments.

• Journal of Korean Society of Transportation
• /
• v.20 no.3
• /
• pp.129-147
• /
• 2002

This paper presents a variational equality formulation by Providing new dynamic route choice condition for a link-based dynamic traffic assignment model. The concepts of used paths, used links, used departure times are employed to derive a new link-based dynamic route choice condition. The route choice condition is formulated as a time-dependent variational equality problem and necessity and sufficiency conditions are provided to prove equivalence of the variational equality model. A solution algorithm is proposed based on physical network approach and diagonalization technique. An asymmetric network computational study shows that ideal dynamic-user optimal route condition is satisfied when the length of each time interval is shortened. The I-394 corridor study shows that more than 93% of computational speed improved compared to conventional variational inequality approach, and furthermore as the larger network size, the more computational performance can be expected. This paper concludes that the variational equality could be a promising approach for real-time application of a dynamic traffic assignment model based on fast computational performance.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.22 no.3
• /
• pp.51-64
• /
• 2019

Mt. Geumgang has been a scenic spot representing the Korean peninsula since the Joseon Dynasty, and became a symbol of inter-Korean exchanges with the Gaesong Industrial Complex after the division of the South and North. Mt. Geumgang Tour Course is divided into the Inner-Geumgang (Naegeumgang) and the Outer-Geumgang (Oegeumgang). It was common for the Mt. Geumgang tour route during the Joseon Dynasty and the Japanese Imperialization period to enter the Inner-Geumgang, near Seoul, and come to the East Sea through the Outer-Geumgang. However, the tour route starting from Goseong was utilized for the Mt. Geumgang tour course operated by Hyundai. Because North Korea opened only the Outer-Geumgang area. North Korea has only opened some of its tour courses to Hyundai, but if Geumgang tourism is resumed in the future, there is a high possibility that it will be opened further, such as opening some sections of the Inner-Geumgang in 2007. In this case, it is necessary to connect additional transportation networks to access Inner-Geumgang from South Korea. The best alternative was the restoration of the Mt. Geumgang Railway. However, considering the fact that the reconstruction of the Mt. Geumgang Railway can not be completed due to the construction of the Imnam Dam, it is the most realistic alternative to restore Route 31 connecting Yanggu and Geumgang-eup. As a result of the analysis of road connecting Inner-Geumgang, three routes were confirmed. All of which were adjacent to the existing National Route 31. These routes passing through Dutayeon and Mundeung-ri and joining the Route 31 from Inje. Considering road length, topography characteristics, and military facility layout, it seems that the connection of 'Dutaeyun - Mundeung - Geumgang' is a realistic alternative connecting from South Korea to Inner-Geumgang.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.133-136
• /
• 2003

In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IP based mobile networks. The proposed multicast routing protocol is a hybrid method employing the merits of the bi-directional tunneling and the remote subscription by considering the mobility of mobile hosts. The proposed protocol satisfies the bound of end-to-end delay and supports the seamless handoff. The simulation results show that the proposed protocol has better performance in the number of multicast tree reconstruction and tunneling length and packet loss time than the previous protocols.