• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.660-663
• /
• 2004

The vehicle routing problem with time-varying speed(VRPTVS) is difficult to handle with regular problem solving approaches. An approach by partitioning the service zone into three sub-zones to reduce computing time and vehicle traveling distance is suggested in this paper. To develop a partitioning algorithm for VRPTVS, all customer locations are divided into two sections such as morning zone and evening zone, excluding daytime zone. And then each service zone is calculated to find a possible number of delivery points and chosen by time window having more number of possible delivery points by considering customer location and varying speeds. A temporary complete route that can serve all target points is developed by this procedure and a pairwise exchange method is applied to reduce the traveling time.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.2
• /
• pp.89-95
• /
• 2017

There are a variety of apps that are finding their way. And in car navigation, we launched a product that reflects Augmented Reality technology this year. However, existing apps have problems. It is implemented in 2D or 3D, has a large error range because it has been modified in most vehicles, is not updated in real time, and car augmented reality navigation is a vehicle, and a separate device is required, etc. In this study, we implemented a smartphone app for walking directions using augmented reality, and made it possible to intuitively use a route service from a user 's location to a destination. The Dijkstra algorithm is applied to calculate the shortest path to solve the problem of finding the route with the least cost. By using this application, it is possible to use the route search service even in a data-free environment, to solve the inconvenience of the language barrier, and to update in real time, so that the latest information can be always maintained. In the future, we want to develop an app that can be commercialized by using a character in the path to promote it.

• Journal of Advanced Marine Engineering and Technology
• /
• v.32 no.8
• /
• pp.1269-1277
• /
• 2008

Ships at sea cannot exchange data among them easily so far. Basically voice-oriented communication systems are the main methods, some of them utilize the HF radio systems at lower bit rates, and for higher bit rates, the Inmarsat or VSAT are adopted. None of them are used widely because of lower qualities and higher costs. There exist many technical and economical limits to have the Internet service just like on land such as the WWW service. In order to achieve the improved transmission rates of the maritime communication networks at farther sea, MANET(Mobile Ad Hoc Network) is one of the most practical models. In this paper, a new routing protocol named EZR (Expansive Search Zone Routing Protocol) is proposed, which is based on SANET (Ship Ad Hoc Network) model that has some different features from MANET and VANET (Vehicular Ad Hoc Network). The search zone for the shortest path is firstly found by EZR. If no path is searched in the zone, the zone is expanded according to the rule of EZR. The zone-expanding and path-searching procedures are repeated until the path is found out. The performance of EZR is evaluated and compared with LAR protocol which is one of the most typical routing protocols based on geographical information. The simulated results show that EZR is much better than LAR at sea environments in terms of routing success rate, route optimality, and a single index of performance combined the previous two metrics.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.260-262
• /
• 2021

In recent years, many studies are being conducted to reduce the damage to humans in the event of a fire. In case of fire in large cities, evacuation route guidance services are provided using Mobile GIS (geographic information system). However, among the algorithms used in the existing evacuation route system, Dijkstra Algorithm has a problem that when the cost is negative, it cannot obtain an infinite loop or an accurate result value, and does not help to select an appropriate shortest route by searching all routes. For this reason, in this paper, we propose the shortest route guidance system based on A^* Algorithm. In case of fire, the shortest route is searched and the shortest route is visualized and provided using a map service on a mobile device using mobile GIS.

• Journal of Information Technology Services
• /
• v.17 no.4
• /
• pp.85-100
• /
• 2018

In this study, we formulated rational criteria to efficiently provide traffic information services via a crafted approach. By utilizing this, we presented a detailed traffic information service providing method that can overcome the limitations of existing link unit information provision system. Three methodologies such as user survey, data mining, and KHCM (Korea Highway Capacity Manual) utilization method were applied to formulate a rational expression standard for traffic information service. Each method was designed to establish a quantitative criterion for various traffic conditions and to enable user-oriented traffic information service in consideration of the traffic principal/compatibility. Considering the results of each methodological analysis in a comprehensive manner, the basic expression standards for traffic information service was formulated. Then we presented improvements such as traffic condition step by road, speed range of traffic condition, expression term of traffic condition and so on. In order to complement the problems of the information provision system of the existing link unit based on the derived improvement criterion, we presented the detailed traffic information service provision method by using the traffic speed data of the second order. And we applied this to the two links of Daegu city. The method presented in this research can improve the quality of traffic information service. Not only it can be used for various fields such as optimal route search, traffic safety service and so on.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.5
• /
• pp.117-125
• /
• 2022

Recently, as users' interest for travel increases, research on a travel route recommendation service that replaces the cumbersome task of planning a travel itinerary with automatic scheduling has been actively conducted. The most important and common goal of the itinerary recommendations is to provide the shortest route including popular tour spots near the travel destination. A number of existing studies focused on providing personalized travel schedules, where there was a problem that a survey was required when there were no travel route histories or SNS reviews of users. In addition, implementation issues that need to be considered when calculating the shortest path were not clearly pointed out. Regarding this, this paper presents a quantified method to find out popular tourist destinations using social big data, and discusses problems that may occur when applying the shortest path algorithm and a heuristic algorithm to solve it. To verify the proposed method, 63,000 places information was collected from the Gyeongnam province and big data analysis was performed for the places, and it was confirmed through experiments that the proposed heuristic scheduling algorithm can provide a timely response over the real data.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.459-463
• /
• 2007

Overlay multicast is an emerging technology for next generation Internet service to various groups of multicast members. It will take the place of traditional IP multicast which is not widely deployed due to the complex nature of its technology. The overlay multicast which effectively reduces processing at IP routers can be easily deployed on top of a densely connected IP network. An end-to-end delay problem is considered which is serious in the multicast service. To periodically optimize the route in the overlay network and to minimize the maximum end-to-end delay, overlay multicast tree is investigated with genetic Algorithm. Outstanding experimental results are obtained which is comparable to the optimal solution and the tabu search.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.1
• /
• pp.153-165
• /
• 2009

This paper apollos an ant colony system (ACS) for the vehicle routing problem with time window (VRPTW). The VRPTW is a generalization of the VRP where the service of a customer can begin within the time windows defined by the earliest and latest times when the customer will permit the start of service. The ACS has been applied effectively in geographical environment such as TSP or VRP by meta-heuristic that imitate an ant's biologic special duality in route construction, 3 saving based ACS (SB-ACS) is introduced and its solution is improved by local search. Through iterative precesses, the SB-ACS is shown to drive the best solution. The algorithm has been tested on 56 Solomon benchmarking problems and compared to the best-known solutions on literature. Experimental results shows that SB-ACS algorithm could obtain food solution in total travel distance minimization.

• The Journal of the Korea Contents Association
• /
• v.20 no.2
• /
• pp.561-571
• /
• 2020

Location information service using big data is continuously developing. In terms of navigation, the range of services from map API service to ship navigation information has been expanded, and system application information has been extended to SNS and blog search records for each location. Recently, it is being used as a new industry such as location-based search and advertisement, driverless cars, Internet of Things (IoT) and online to offline (O2O) services. In this study, we propose an information system that enables users to receive information about nearby stores more effectively by using big data when a user moves a specific route. In addition, we have designed this system so that local stores can use this system to effectively promote it at low cost. In particular, we analyzed web-based information in real time to improve the accuracy of information provided to users by complementing the data. Through this system, system users will be able to utilize the information more effectively. Also, from a system perspective, it can be used to create new services by integrating with various web services.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.99-107
• /
• 2008

Recently route guiding system using GPS is spread widely. In the parking management system of complex mall, RFID is mainly used to control status of parking lots. However, in a case that a vehicle only with RFID tag enters into small market-populated district with service of parking lots, there is no parking route guiding system optimized with information of real tine status of parking lots and the system only with GPS can't provide a function of using real time status of parking lots. This paper proposes a location recognizing method of RFID tag object for parking control system to integrated several parking lots in the business district and database-linked route guiding system optimized for parking. The proposed location recognizing method makes the search of optimized parking route possible by abstracting decoding order of tag and antenna number and recognizing direction of tag linked with database. Ihe implemented system that is composed of RFID tag, reader, middleware, server, parking lot clients and mobile clients shows that the proposed method works well and it will be useful for integrated parking control system.