• Title/Summary/Keyword: a shortest route

Search Result 182, Processing Time 0.039 seconds

An Efficient Public Bicycle Reallocation using the Real-Time Bicycle on-Demand HDPRA Scheme (효율적인 공공 자전거 재배치를 위한 실시간 자전거 수요량 기반의 HDPRA 기법 제안)

  • Eun-Ok Yun;Kang-Min Kim;Hye-Sung Park;Sung-Wook Chung
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.17 no.2
    • /
    • pp.83-92
    • /
    • 2024
  • Currently, various countries are enhancing accessibility by providing bicycle rental services for convenient usage within daily life. This paper introduces the Nubija public bicycle service in Changwon, South Korea, aiming to address the imbalance between demand and supply of Nubija bicycles. We propose a Highest Priority Reallocation Scheme to prevent this disparity. Comparing this scheme with others that randomly visit terminals for redistribution and those that prioritize terminals closest to current locations, we illustrate its superior efficiency. Our proposed Highest Priority Reallocation Scheme prioritizes terminals with the highest demand and shortest distances nearby. Through experiments, our proposed scheme demonstrates superior performance, with the lowest average of 817.44km distance and an average of 6437.45 times, i.e., 88.14% successful rental occurrences. This highlights its superiority over the other two algorithms.

Routing Protocol with QoS Support in ice Mobile Ad Hoc Networks (이동 애드 흑 네트워크에서의 QoS를 지원하는 라우팅 프로토콜)

  • 강경인;박경배;유충열;정찬혁;이광배
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4C
    • /
    • pp.273-281
    • /
    • 2002
  • Recently, demand for real-time data and multimedia data is rapidly increasing, and it is impossible for mobile Ad Hoc networks with only best effort service to efficiently transfer such data. So, we absolutely need the QoS service which reserves the communication resources in advance. The existing routing protocols, which assume that the links between nodes are bidirectional, provide the convenience for the route discovery and maintenance, but can not support the routing function for the unidirectional links due to the wireless link property easily changing with time under the real wireless environment. In order to solve such problems, in this dissertation we suggested a unidirectional QoS routing a waste of communication resources. The waste of protocol that supports unidirectional links and reduces communication resources is reduced by establishing the shortest route suitable to QoS support, considering in advance the usable communication resources at each node.

Route Selection in the Network of Public Transportation using the GA and the GIS (유전자 알고리즘과 GIS를 이용한 대중교통 경로선택에 관한 연구)

  • 전철민
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.21 no.4
    • /
    • pp.323-330
    • /
    • 2003
  • GIS-based applications for route guidance are increasingly developed recently, but most of them are for self$.$driven cars. Although some of them are intended for public transportation, they show limitations in dealing with time constraints problems taken place in transfer areas. Developing a public transportation guidance system requires the fallowing aspects: (i) people may change transportation means not only within the same type but also among different modes such as between buses and subways, and (ii) the system should take into account the time taken in transfer from one mode to the other. This study suggests the framework for developing a public transportation guidance system that generates optimized paths in the transportation network of mixed means including buses, subways and other modes. For this study, the Genetic Algorithms are used to find the best routes that take into account transfer time and other service-time constraints. The method for constructing the data structure in the GIS was also suggested.

Mission Planning for Underwater Survey with Autonomous Marine Vehicles

  • Jang, Junwoo;Do, Haggi;Kim, Jinwhan
    • Journal of Ocean Engineering and Technology
    • /
    • v.36 no.1
    • /
    • pp.41-49
    • /
    • 2022
  • With the advancement of intelligent vehicles and unmanned systems, there is a growing interest in underwater surveys using autonomous marine vehicles (AMVs). This study presents an automated planning strategy for a long-term survey mission using a fleet of AMVs consisting of autonomous surface vehicles and autonomous underwater vehicles. Due to the complex nature of the mission, the actions of the vehicle must be of high-level abstraction, which means that the actions indicate not only motion of the vehicle but also symbols and semantics, such as those corresponding to deploy, charge, and survey. For automated planning, the planning domain definition language (PDDL) was employed to construct a mission planner for realizing a powerful and flexible planning system. Despite being able to handle abstract actions, such high-level planners have difficulty in efficiently optimizing numerical objectives such as obtaining the shortest route given multiple destinations. To alleviate this issue, a widely known technique in operations research was additionally employed, which limited the solution space so that the high-level planner could devise efficient plans. For a comprehensive evaluation of the proposed method, various PDDL-based planners with different parameter settings were implemented, and their performances were compared through simulation. The simulation result shows that the proposed method outperformed the baseline solutions by yielding plans that completed the missions more quickly, thereby demonstrating the efficacy of the proposed methodology.

An Approach to Global Path Replanning Method Considering 4D Environmental Information (4D 환경정보를 반영한 광역 경로수정계획 기법에 관한 연구)

  • Kwak, Dong Jun;Shin, Jongho;Kim, Chong Hui
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.19 no.6
    • /
    • pp.779-788
    • /
    • 2016
  • In this paper, a global path replanning method is proposed in order to plan a global path minimizing the risk of the unmanned vehicle on the battlefield. We first introduce 4D environmental information consisting of mobility, visibility, kill, and hit attributes, and a unified threat map and a mobility map are defined by the four attributes. Using the mobility map, the unmanned vehicle can find the shortest path on the traversable area. And then taking into account the deterrent according to the type of the unmanned vehicle on the integrated threat map, the vehicle can generate a route to suppress or avoid the threat of enemy as well. Moreover, we present a waypoints bypassing method to exclude unnecessary waypoints rather than the mission point when planning paths for the multiple waypoints.

Improvement of Mobile Tour-Guide Robots from the Perspective of Users (이용자 측면의 이동형 관람 안내 로봇 개선)

  • Ahn, Tae-Beom;Kang, E-Sok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.10
    • /
    • pp.955-963
    • /
    • 2012
  • A mobile tour-guide robot is a very attractive tour-guide in the exhibition hall of science museums and the necessity of tour-guide robots for museums is gradually increasing. Two kinds of robots have served as tour-guide robots in an exhibition hall of the Korea National Science Museum which is a very densely populated museum of many people and exhibits. The robots move around the large exhibition area and provide guide services to lots of visitors. A robot leads the way to the exhibit that a visitor wants to find and it takes the shortest route. Robots were operated for four months from January to April 2011, and we observed behavior of visitors and collected subjective evaluation of users. The result shows that there are four stages of using a mobile tour-guide robot and some differences of subjective evaluations depending on the gender and the age of the user and we suggest several improvements on the mobile tour-guide robot.

Heuristic Algorithm for Searching Multiple Paths (복수 경로 탐색을 위한 휴리스틱 알고리즘에 대한 연구)

  • Shin, Yongwook;Yang, Taeyong;Baek, Won
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.32 no.3
    • /
    • pp.226-235
    • /
    • 2006
  • Telematics is expected to be one of the fastest growing businesses in information technology area. It may create a new emerging market in industry related to automotive, telecommunications, and information services. Especially vehicle navigation service is considered as a killer application among telematics service applications. The current vehicle navigation service typically recommends a single path that is based on the traveling time or distance from the origin to the destination. The system provides two options for users to choose either via highway or via any road. Since the traffics and road conditions of big cities are very complicated and dynamic, the demand of multi-path guidance system is increasing in telematics market. The multi-path guidance system should allow drivers to choose a path based on their individual preferences such as traveling time, distance, or route familiarity. Using the Lawler's algorithm, it is possible to find multiple paths; however, due to the lengthy computational time, it is not suitable for the real-time services. This study suggests a computationally feasible and efficient heuristic multiple paths finding algorithm that is reliable for the real-time vehicle navigation services.

Design and Implement of TIP in tour (TIP(Travel Interesting Plan in tour)의 설계 및 구현)

  • Wee, Chan-hyuk;Choi, Younggil;Cho, Wijae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.605-607
    • /
    • 2016
  • The trend is growing domestic and international travelers. Research before making plans to travel people, Leave the tour you do not know the way, there are people who can not find a better destination. In this paper, to solve this problem and provide a mobile-to efficiency in traveling through a smart-phone application. At the same time to improve the convenience and satisfaction, etc. Select the destination country and traveling through the guidance system and the destination in the shortest path from the current location of the user to select multiple destinations shorten the travel route and save time. Also implemented to provide a convenience to guide the position of the additional facilities.

  • PDF

Correlation Distance Based Greedy Perimeter Stateless Routing Algorithm for Wireless Sensor Networks

  • Mayasala, Parthasaradhi;Krishna, S Murali
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.1
    • /
    • pp.139-148
    • /
    • 2022
  • Research into wireless sensor networks (WSNs) is a trendy issue with a wide range of applications. With hundreds to thousands of nodes, most wireless sensor networks interact with each other through radio waves. Limited computational power, storage, battery, and transmission bandwidth are some of the obstacles in designing WSNs. Clustering and routing procedures have been proposed to address these concerns. The wireless sensor network's most complex and vital duty is routing. With the Greedy Perimeter Stateless Routing method (GPSR), an efficient and responsive routing protocol is built. In packet forwarding, the nodes' locations are taken into account while making choices. In order to send a message, the GPSR always takes the shortest route between the source and destination nodes. Weighted directed graphs may be constructed utilising four distinct distance metrics, such as Euclidean, city block, cosine, and correlation distances, in this study. NS-2 has been used for a thorough simulation. Additionally, the GPSR's performance with various distance metrics is evaluated and verified. When compared to alternative distance measures, the proposed GPSR with correlation distance performs better in terms of packet delivery ratio, throughput, routing overhead and average stability time of the cluster head.

Evaluating GHG Emissions Reduced by Real-time Traffic Information in Gasoline Vehicle (실시간교통정보 이용에 따른 가솔린차량의 온실가스 저감효과 평가)

  • Kim, Jun-Hyung;Um, Jung-Sup
    • Journal of Korean Society for Atmospheric Environment
    • /
    • v.27 no.4
    • /
    • pp.443-453
    • /
    • 2011
  • Real-time Traffic Information Service could play a key role in reducing incomplete combustion time remarkably since it can provide traffic information in real-time basis. Emission characteristics of test engines were studied in terms of travel distance and speed. The present study focused on a north district in Daegu, 12 km. The driving for the emission test was done at 8AM, 3PM, 7PM which represents various traffic conditions. The reduced emissions of Greenhouse Gases (GHG) have been measured for a travel distance running at different loads (conventional shortest route and Real-time Traffic Information) and GHG ($CO_2$, $CH_4$, $N_2O$) are all inventoried and calculated in terms of existing emission factors. The emission of GHG has been shown to reduce linearly with travel distance: $CO_2$ (9.15%), $CH_4$ (18.43%), $N_2O$(18.62%).