• International Journal of Computer Science & Network Security
• /
• v.23 no.11
• /
• pp.43-52
• /
• 2023

The paper aims to clarify how to make a decision using geographic information systems and how to choose the best route between two cities to suit the expectations of the driver and his sense of safety and comfort on the road. Use a special model for network analysis, where the network analysis tool relied on the following data (maximum speed of the road - number of intersections - road width - peak period) in choosing the best safe path. The paper concluded that the best safe route for refugees between the cities of Khartoum - Arqin crossing is ( Khartoum - Shendi - Atbara - Meroe - Abu Hamad - Wadi Halfa). We advise all GIS users to use the theories of spatial analysis when creating a new model.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.71-82
• /
• 2003

In this paper, we present a new method to calculate reinforcement value in QoS routing algorithm targeted for real-time applications based on Ant algorithm to efficiently and effectively reinforce ant-like mobile agents to find the best route toward destination in a network regarding necessary QoS metrics. Simulation results show that the proposed method realizes QoS routing more efficiently and more adaptively than those of the existing method thereby providing better solutions for the best route selection for real-time application that has high priority on delay jitter and bandwidth.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.36-40
• /
• 2002

Routing algorithm uses metric to choose the route of Least cost to destination network, the best suited routing investigates all routes to the shortest destination among networks and is decided on the route given the minimum metric. This paper analyzed packet flow for setting up the best fitted path on the same network using RIP and EIGRP as the distance vector algorithm and measured the Link-efficiency.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.101-108
• /
• 2015

This paper presents the implementation of a system that recommends empirical best routes based on classification of large trajectory data. As many location-based services are used, we expect the amount of location and trajectory data to become big data. Then, we believe we can extract the best empirical routes from the large trajectory repositories. Large trajectory data is clustered into similar route groups using Hadoop MapReduce framework. Clustered route groups are stored and managed by a DBMS, and thus it supports rapid response to the end-users' request. We aim to find the best routes based on collected real data, not the ideal shortest path on maps. We have implemented 1) an Android application that collects trajectories from users, 2) Apache Hadoop MapReduce program that can cluster large trajectory data, 3) a service application to query start-destination from a web server and to display the recommended routes on mobile phones. We validated our approach using real data we collected for five days and have compared the results with commercial navigation systems. Experimental results show that the empirical best route is better than routes recommended by commercial navigation systems.

• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.2
• /
• pp.143-150
• /
• 2017

Previous methods to evaluate the risk of dropped objects rely on personnel experience of the engineer or operator without analyzed data. However analyzing historical statistic data is the best approach to find the safest operation route and to achieve more reasonable and reliable calculation results. By counting the failure frequency and fatal accident rate the risk can be quantified, and so controlled or mitigated with best economical risk reducing measures. This analysis gives a crane operator with useful information for selecting the best crane operation route, and a designer with an estimation of risk level for the dropped objects from a safety point of view.

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

• Journal of the Society of Naval Architects of Korea
• /
• v.52 no.2
• /
• pp.110-118
• /
• 2015

Weather routing method is one of the best practices of SEEMP (Ship Energy Efficiency Management Plan) for fuel-efficient operation of ship. KR is carrying out a basic research for development of the weather routing algorithm and making a monitoring system by FOC (Fuel Oil Consumption) analysis compared to the reference, which is the great circle route. The added resistances applied global sea/weather data can be calculated using ship data, and the results can be corrected to ship motions. The global sea/weather data such as significant wave height, ocean current and wind data can be used to calculate the added resistances. The reference route in a usual navigation is the great circle route, which is the shortest distance route. The global sea/weather data can be divided into grids, and the nearest grid data from a ship's position can be used to apply a ocean going vessel's sea conditions. Powell method is used as an optimized routing technique to minimize FOC considered sea/weather conditions, and FOC result can be compared with the great circle route result.

• International Journal of Computer Science & Network Security
• /
• v.21 no.4
• /
• pp.33-40
• /
• 2021

The traveling salesman problem (TSP) is one of the well-known and extensively studied NPC problems in combinatorial optimization. To solve it effectively and efficiently, various optimization algorithms have been developed by scientists and researchers. However, most optimization algorithms are designed based on the concept of improving route in the iterative improvement process so that the optimal solution can be finally found. In contrast, there have been relatively few algorithms to find the optimal solution using route construction mechanism. In this paper, we propose a route construction optimization algorithm to solve the symmetric TSP with the help of ratio value. The proposed algorithm starts with a set of sub-routes consisting of three cities, and then each good sub-route is enhanced step by step on both ends until feasible routes are formed. Before each subsequent expansion, a ratio value is adopted such that the good routes are retained. The experiments are conducted on a collection of benchmark symmetric TSP datasets to evaluate the algorithm. The experimental results demonstrate that the proposed algorithm produces the best-known optimal results in some cases, and performs better than some other route construction optimization algorithms in many symmetric TSP datasets.

• Journal of Information Technology Applications and Management
• /
• v.9 no.4
• /
• pp.13-34
• /
• 2002

This paper considers a postal transportation planning problem in the transportation network of the form of hub and spoke Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. The tabu search uses the best-admissible strategy, BA, and the first-best-admissible strategy, FBA. The algorithm was tested on problems consisting of 11, 16 and 21 mail sorting centers including one exchange center. Solutions of the problems consisting of 11 mail sorting centers including one exchange center were compared with optimal solutions On average, solutions using BA strategy were within 0.287% of the optimum and solutions using FBA strategy were within 0.508% of the optimum. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is very good.