• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.342-352
• /
• 2021

Multicast Routings is a big challenge due to limitations such as node power and bandwidth Mobile Ad-hoc Network (MANET). The path to be chosen from the source to the destination node requires protocols. Multicast protocols support group-oriented operations in a bandwidth-efficient way. While several protocols for multi-cast MANETs have been evolved, security remains a challenging problem. Consequently, MANET is required for high quality of service measures (QoS) such infrastructure and application to be identified. The goal of a MANETs QoS-aware protocol is to discover more optimal pathways between the network source/destination nodes and hence the QoS demands. It works by employing the optimization method to pick the route path with the emphasis on several QoS metrics. In this paper safe routing is guaranteed using the Secured Multicast Routing offered in MANET by utilizing the Ant Colony Optimization (ACO) technique to integrate the QOS-conscious route setup into the route selection. This implies that only the data transmission may select the way to meet the QoS limitations from source to destination. Furthermore, the track reliability is considered when selecting the best path between the source and destination nodes. For the optimization of the best path and its performance, the optimized algorithm called the micro artificial bee colony approach is chosen about the probabilistic ant routing technique.

• Journal of Internet Computing and Services
• /
• v.23 no.1
• /
• pp.1-9
• /
• 2022

Recently, interest in living safety and crime prevention is increasing. The reality is that most women have anxiety about social safety and ultimately want a safe return to home. As a result of these issues, the Seoul Metropolitan Government and the National Police Agency are implementing various services to alleviate them. However, there are limitations such as that the service can be used only during a limited time or the process of checking whether the patrol is really completed is complicated. Therefore, in this paper, we propose a service platform that overcomes these limitations and suggests the best and shortest patrol route to the police based on the desired patrol location applied by citizens. It is designed based on the MVC pattern, and the functions are divided for each user. It is hoped that the platform will reduce crime rates and allow citizens to ultimately return home with peace of mind. Also we expect that the police will ablet to find places where they did not know about or need to patrol with more attention through the recommended route of the platform, which will be helpful in their task.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.46-55
• /
• 2012

This study proposes an estimate method of willingness to pay(WTP) for real-time route guidance systems using contingent valuation method(CVM) under double bounded dichotomous choice question(DBDCQ) and analysis for impact factors of WTP estimation. This study assumed that provided real-time traffic information service is optimal route concepts dealing with traffic conditions on origin-destination. Analysis targets were classified into two groups as short distance path and middle distance path for estimating WTP for realtime route guidance system in a year using the survival analysis method and the regression model with personal information, actual condition and satisfaction of information usage and users' awareness and usage of facilities. As a result, mean WTP of realtime route guidance system is 4,034won/year in short distance path, and 4,884won/year in middle distance path. Therefore real-time route guidance system for longer distance path is recognized as more valuable than shorter distance path. Moreover, the necessity of information was required on a higher income group and higher WTP was estimated on owners of vehicle group and lower awareness of a route group.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.4
• /
• pp.73-85
• /
• 2014

Approaching to aging society with increasing transportation vulnerable, most developed countries has positively promote low-floor bus. Such circumstance in Korea has plan to introduce low-floor bus to intra-city bus system which accounted for 30 percent of total number of buses however there is no specific operating plan for this matter. According to the revealed preference study on bus service, the study shows that the efficiency of low-floor is relatively low than that of other buses, therefore, it is necessary to establish feasible plan for bus route selection. Thus, this study is to conduct research on analyzing trip characteristics of transportation vulnerable and establish bus route selection measures for low-floor bus. The result from the survey in Jeollabuk-do Province reveals that the trip purpose of transportation vulnerable is mainly for welfare and medical service, which was made less than 6 times a week. Futhermore, 37.6 percent of transportation vulnerable use buses, thus, it is essential to improve its service quality for enhancing user's convenience and safety. In that transportation vulnerable O-D needs to be established and forecasts future demand for selecting optimal bus route. According to the estimation, route passing through densely populated areas with transportation vulnerable should take the first priority, city circular and other route would be next. Moreover, it is economically efficient that areas populated more than 200,000 with fixed route and less than 200,000 with limited route responsive to demands would be feasible plans. This study will have greater an impact on transportation planning and further research on transportation vulnerable.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.26 no.3
• /
• pp.85-96
• /
• 2023

This study developed and evaluated a safe route guidance service for electric personal assistive mobility device used mainly by the mobility impaired people to improve their mobility. Thirteen underlying factors affecting the mobility of electric personal assistive mobility device have been derived through a survey with the mobility impaired people and employees in related organizations in Busan Metropolitan City. After assigning safety scores to individual factors and identifying the relevant factors along routes of interest with an object detection AI model, the safe route for electric personal assistive mobility device was provided through an optimal path-finding algorithm. As a result of comparing the general route of T-map and the recommended route of this study for the identical routes, the latter had relatively fewer obstacles and the gentler slope than the former, implicating that the recommended route is safer than the general one. As future works, it is necessary to enhance the function of a route guidance service based on the real-time location of users and to conduct spot investigations to evaluate and verify its social acceptability.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1998.10a
• /
• pp.315-322
• /
• 1998

It is discussed how to route yard-side equipment during the loading operation in port container terminals. The number of containers to be picked up at each yard-bay, as well as the route of a yard-side equipment (for example, transfer crane or straddle carrier) in a yard, are determined. The objective of the problem is to minimize the total container handling time in the yard. An encoding method to represent nodes in the search space is introduced utilizing inherent properties of the optimal solution by which the search space is greatly reduced. A beam search algorithm is suggested. A numerical experiment is carried out to compared the performance of the beam search algorithm with those of other approaches.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.3
• /
• pp.289-295
• /
• 2008

The shared-route decision algorithms in multicasting communications networks to provide the internet-based services such as IPTV, remote education/health, and internet broadcasting are presented. The three main measures of maximum delay, average delay and estimated delay between each node and member are adopted. Under the Mesh network with the uniform random cost between each node, the algorithm's performance is compared to the optimal solution with the minimum cost by all enumeration. The simulation results show that the algorithm using the estimated delay outperforms the other two methods.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.153-168
• /
• 1994

This paper is concerned with the development of tree-search algorithm for the exact solution to the vehicle problem (VRP), where set of vehicles of known capacity based at depot, have to be routed in order to supply customers with known requirements. When is required is to design routes, so that the total cost (i. e. total route length or time duration, ect.) is minimized. For obtianing the exact solution, the most important factors are the value of bound and branching strategy. Using the bound based on with bound ascent procedures from subgradient and state-space ascents, the incorporation of bounds into tree search algorithm to solve the problem is shown. Computational results of the corresponding algorithm show that VRPs with up to 40 customers can be solved optimally with this algorithm.

• Journal of the Korean Society of Industry Convergence
• /
• v.19 no.2
• /
• pp.75-80
• /
• 2016

This study proposes a efficient technology to control the optimal trajectory planning and real-time implementation method which can perform autonomous travelling for unmaned factory automation. Online path planning should plan and execute alternately in a short time, and hence it enables the robot avoid unknown dynamic obstacles which suddenly appear on robot's path. Based on Route planning and control algorithm, we suggested representation of edge cost, heuristic function, and priority queue management, to make a modified Route planning algorithm. Performance of the proposed algorithm is verified by simulation test.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.231-240
• /
• 2001

U-turn and P-turn as well as left-turn restriction exist in real traffic network. the optimal route should be selected for considering these using shortest path algorithms. But, the traditional algorithms have some limitations to use for considering there. The objective of this paper is to modify Dijkstra algorithm in order to find the optimal path in real traffic network. The continuous three nodes are used to check turn-restrictions and exclude these from and optimal path. A virtual connection is used to consider U-turn and P-turn.