• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.369-374
• /
• 2005

Currently, ECDIS and GPS plotters are much used as equipment providing operators with route information, but they do not have any function of automatic route creation and route explanation, so available for only experienced operators. Especially, the present situation is that no study is made of the automatic route creation and route explanation using ENC for ECDIS, substitution system of paper chart. ENC is the electronic navigation chart that is produced using S-52, 5-57 standard format required by IHO. In this paper, an Navigation Guiding System(NGS) is proposed to generate an optimal route where ENC and GPS data is fusioned including the wind direction and speed of an anemometer. The proposed system was testified by a simulation, and its effectiveness was verified.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.15 no.1
• /
• pp.34-42
• /
• 2012

Life and Property damage has increased during traffic congestion and isolation because natural disasters such as flood and landslide have occurred every year. When disaster occurs, if there is insufficient information in advance when entering the flooding areas which subsequently cause confusion. In this paper, we developed the system that could provide display of detour route using disaster information and evacuation route in disaster areas. User will receive result of analysis using smart phone application to prevent additional damages when disaster areas were entered by manager.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.19-30
• /
• 2008

Recently, the query processing algorithm in the field of spatial network database(SNDB) has been attracted by many Interests. But, there is little research on route-based queries. Since the moving objects move only in spatial networks, the efficient route-based query processing algorithms, like in-route nearest neighbor(IRNN), are essential for Location-based Service(LBS) and Telematics application. However, the existing IRNN query processing algorithm has a problem that it does not consider traffic jams in the road network. In this thesis, we propose an IRNN query processing algorithm which considers space restriction. Finally, we show that space-constrained IRNN query processing algorithm is efficient compared with the existing IRNN algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.203-210
• /
• 2008

Because BSP(Basic Support Protocol) of NEMO(Network Mobility) has important limitation of not providing route optimization, several route optimization schemes have been proposed. By analyzing and improving the limitations of the existing schemes. we Propose an advanced integrated route optimization scheme for the communication through both the internal and external routing of nested NEMO. Our proposal includes a secure route optimization protocol which connects TLMR directly to an external node CN without passing through any HAs. and allows TLMR to control the internal path without passing through the internet. Thus, our scheme can strengthen the security as well as improve the path and delay of NEMO communication.

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

• Acta Via Serica
• /
• v.9 no.1
• /
• pp.33-66
• /
• 2024

There is a lot of evidence of early port cities and small habitation sites along the Thai-Malay Peninsula's coastlines. These sites appeared on the trans-peninsular routes during the Maritime Silk Roads period, from 2,000 to 1,500 BP. The Thai-Malay Peninsula was mentioned in many documents as Suvarnabhumi (India), Aurea Chersonese (Greek), and Jin Lin (Chinese), meaning the Golden Land. Ptolemy's map displays that there were many port cities along this peninsula. It corresponds to the Milinda-panha, which depicts many port cities in Suvarnabhumi. Foreign documents primarily documented the presence of major port cities, while inland habitation sites received less recognition. This paper aims to reconstruct the trans-peninsular routes in order to understand their networks, connections, and roles. The second aim is to understand the hierarchy of each site. This paper will focus on two important settlements and high-value artifacts along three routes: the Kra Isthmus Route, the Pho Khao Thong and Tha Chana Route, and the Krabi to Surat Thani Route. I conducted an archaeological survey of these three routes and others during 2021-2023 under the Suvarnabhumi Studies Center, TASSHA Institute, and the Ministry of Higher Education, Science, Research, and Innovation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.9
• /
• pp.25-37
• /
• 2007

The existing route re-establishment methods which intend to extend the lifetime of the network attempt to find new routes in order not to overly consume energy of certain nodes. These methods outperform other routing algorithms in the network lifetime extension aspect because they try to consume energy evenly for the entire network. However, these algorithms involve heavy signaling overheads because they find new routes based on the flooding method and route re-acquisition occurs often. Because of the overhead they often can not achieve the level of performance they intend to. In this paper, we propose a new route re-acquisition algorithm ARROW which takes into account the cost involved in the packet transmission and the route re-acquisition. Since the proposed algorithm considers future route re-acquisition costs when it first finds the route, it spends less energy to transmit given amount of data while evenly consuming the energy as much as possible. Using 2-dimensional Markov Chain model, we compare the performance of the proposed algorithm and that of other algorithms. Analysis results show that the proposed algorithm outperforms the existing route re-acquisition methods in the signaling overhead and network lifetime aspects.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.57-78
• /
• 2005

The vehicle routing problem (VRP) is to determine a set of feasible vehicle routes, one for each vehicle, such that each customer is visited exactly once and the total distance travelled by the vehicles is minimized. A feasible route is defined as a simple circuit including the depot such that the total demand of the customers in the route does not exceed the vehicle capacity. While there have been significant advances recently in exact solution methodology, the VRP is not a well solved problem. We find most approaches still relying on the branch and bound method. These approaches employ various methodologies to compute a lower bound on the optimal value. We introduce a new modelling approach, termed route-splitting, for the VRP that allows us to address problems whose size is beyond the current computational range of set-partitioning models. The route-splitting model splits each vehicle route into segments, and results in more tractable subproblems. Lifting much of the burden of solving combinatorially hard subproblems, the route-splitting approach puts more weight on the LP master problem, Recent breakthroughs in solving LP problems (Nemhauser, 1994) bode well for our approach. Lower bounds are computed on five symmetric VRPs with up to 199 customers, and eight asymmetric VRPs with up to 70 customers. while it is said that the exact methods developed for asymmetric instances have in general a poor performance when applied to symmetric ones (Toth and Vigo, 2002), the route splitting approach shows a competent performance of 93.5% on average in the symmetric VRPs. For the asymmetric ones, the approach comes up with lower bounds of 97.6% on average. The route-splitting model can deal with asymmetric cost matrices and non-identical vehicles. Given the ability of the route-splitting model to address a wider range of applications and its good performance on asymmetric instances, we find the model promising and valuable for further research.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.131-142
• /
• 2011

In this paper, we propose a new multipath routing protocol and compare it with other multipath routing protocols in mobile ad hoc network (MANET) environments. The new multipath routing establishes the main route using a mechanism based on Ad Hoc On-demand Distance Vector(AODV), after which data transmission starts immediately. The backup route search process takes place while data are transmitted, to reduce the transmission delay. The protocol can also operate in a hybrid node-disjoint/link-disjoint mode, where the protocol finds the node-disjoint backup route first; if the node-disjoint does not exist, the protocol discovers the link-disjoint backup route from the main route. When either of the main route or the backup route is broken, data are transmitted continuously through the other route and the broken route is recovered by the route maintenance process. The results of simulations, based on the Qualnet simulator, show that the proposed multipath routing protocol increases the packet transmission success rate and reduces end-to-end delays, when compared with AODV and AOMDV protocols.

• Journal of Korean Society of Occupational and Environmental Hygiene
• /
• v.31 no.1
• /
• pp.73-82
• /
• 2021

Objectives: This study aimed to investigate the public cognition and information acquisition route for heavy metals and organic solvents in the general population in order to provide information for the development of public relations materials. Methods: The study was carried out by questionnaire from January to March 2011 by an interview with trained surveyors. There were 700 participants, divided by gender and age. A questionnaire was issued consisting of subjective and objective cognition evaluation items and questions about information acquisition route and preferred information acquisition route for six heavy metals and five organic solvents. Data were expressed as a percentage using the SPSS 23.0 software package. Result: For heavy metals, subjective and objective cognition degrees were higher in the order of lead, mercury, cadmium, and arsenic. They were higher among males than females, and in adults compared to school-age subjects. For organic solvents, both cognition degrees were high in the order of acetone, benzene, and formaldehyde. However, cognition degree by gender and age showed a complex pattern. As a response to information acquisition route, broadcast media had the highest in all ages and genders, followed by word of mouth from neighbors in elementary school children, school education or expert lectures in middle and high school students up to people in their 30s, and print media among those in their 40s to over 60s. There was no difference in the order by gender. As a response to preference for information acquisition route, broadcast media also proved the highest in all ages and genders, followed by school education or professional lectures among those in elementary school and over their 60s, and the internet in other age groups. Females preferred school education or expert lectures and word of mouth from neighbors, while males preferred the internet. In the case of the internet, the ranking was higher for preferred information acquisition route compared with the ranking for information acquisition route. Conclusions: This data on cognition degree, information acquisition route, and preferred information acquisition route according to gender and age can provide basic data for the development of educational and promotional materials for heavy metals and organic solvents exposure management.