• Title/Summary/Keyword: Optimal Path Algorithm

Search Result 602, Processing Time 0.021 seconds

Energy Efficient Route Search Using Marine Data (해양 데이터를 활용한 에너지 효율적인 최적 항로 탐색)

  • Kim, Seong-Ho;Jin, Kyo-Hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.1
    • /
    • pp.44-49
    • /
    • 2020
  • Recently, one of the major issues of shipbuilding and marine is the reduction of air and marine pollution emission to ships. In response, the International Maritime Organization (IMO) has concluded an international convention (MARPOL) to prevent pollution from ships. A Annex Six of The Convention restricts and regulates air and marine pollution of ship from exhausting gases. To this end, it is required to apply EEDI (Energy Efficiency Design Indicators) to the construction of new ships, and to minimize the emission of environmental pollutants by recommending the application of EEOI (Energy Efficiency Operation Indicators) to operational ships. Therefore, in this study, we propose to calculate the grade of operating efficiency (EG) of ships based on actual operational data for transport ships and to provide energy-efficient optimal path search information through analysis of marine environment data.

Applications to Recommend Moving Route by Schedule Using the Route Search System of Map API (지도 API의 경로 탐색 시스템을 활용한 일정 별 동선 추천 애플리케이션)

  • Ji-Woo Kim;Jung-Yi Kim
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.2
    • /
    • pp.1-6
    • /
    • 2023
  • The purpose of this study is to research and develop so that users who are gradually progressing in the popularization of smartphones and the calculation of agricultural quality can use more active and flexible applications than existing application fields. People use event management applications to remember what they need to do, and maps applications to get to their appointments on time. You will need to build a glue-delivered application that leverages the Maps API to be able to recommend the glove's path for events so that the user can use the application temporarily. By comparing and analyzing currently used calendar, map, and schedule applications, several Open Maps APIs were compared to supplement the weaknesses and develop applications that converge the strengths. The results of application development by applying the optimal algorithm for recommending traffic routes according to time and place for the schedule registered by the user are described.

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.

Design of lift-down kitchen cabinet for elderly and disabled (고령자 및 장애인을 위한 승강형 주방 상부장 설계)

  • Kibum Shim;Hoon Shim;Geon-Hyeok Lim;Jiwon Jang;Sang-Hyun Kim
    • The Journal of the Convergence on Culture Technology
    • /
    • v.10 no.1
    • /
    • pp.465-470
    • /
    • 2024
  • Kitchen cabinets are widely used for their spacious storage and efficient use of space, but their high installed location makes it difficult for the elderly and disabled to access. Therefore, in this paper, we propose a new height-adjustable kitchen cabinet that can be used more easily and safely. The lift-down range of cabinet was set considering the installation location of cabinet for efficient use of kitchen space and the maximum height accessible to the elderly and disabled, and the link geometry and driving method of the complex link mechanism were determined through the mechanism design procedure to ensure that the selected floor come down safely along the optimal descend path. In addition, the appropriate motor and control algorithm were added to allow the user to descend to the desired height with a simple button operation. It was confirmed through actual production that the proposed linkage mechanism performs the desired lift-down motion.

Reviews of Bus Transit Route Network Design Problem (버스 노선망 설계 문제(BTRNDP)의 고찰)

  • Han, Jong-Hak;Lee, Seung-Jae;Lim, Seong-Su;Kim, Jong-Hyung
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.3 s.81
    • /
    • pp.35-47
    • /
    • 2005
  • This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.

Traffic Control using Multi Rule-Base in an ATM Network (ATM 네트워크에서 멀티 룰-베이스 기법을 이용한 트래픽 제어)

  • Kim, Young-Il;Ryoo, In-Tae;Shim, Cheul;Lee, Sang-Bae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.12
    • /
    • pp.1870-1883
    • /
    • 1993
  • In this paper, in order to build up the User Network Interface based on ATM, a study on traffic control techniques which should be performed by main function groups-B 75,5 NT2, LEX-is discussed. The structure of B-NT2 which is the most important function group In the User Network Interface is defined in quite a simple manner in addition, the functional blocks of LEX are defined in a similar manner as those of B NT2. It is possible to distribute total traffic control functions by using the similarities between B-NT2 and LEX and by allocating virtual path identifiers fixedly according to the characteristics of the traffics. For the traffic control techniques of ATM, relations among Connection Admtsslon Control, Usage Parameter Control and Bandwidth Allocation Control are defined and Multi Rule Base structure to realize optimal control functions according to the characteristics of the source traffics is proposed. And the Real-time Variable Window algorithmsimply designed to be suitable for the Multi Rule Base architecture is also proposed. The performances of the proposed algorithm are analyzed through the computer simulation by generating on-off source traffic in a virtual system that has the form of the proposed hardware. The analyzed results show that the distributed control is possible and that the implementation of the proposed architecture and algorithm is possible.

  • PDF

State-Aware Re-configuration Model for Multi-Radio Wireless Mesh Networks

  • Zakaria, Omar M.;Hashim, Aisha-Hassan Abdalla;Hassan, Wan Haslina;Khalifa, Othman Omran;Azram, Mohammad;Goudarzi, Shidrokh;Jivanadham, Lalitha Bhavani;Zareei, Mahdi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.146-170
    • /
    • 2017
  • Joint channel assignment and routing is a well-known problem in multi-radio wireless mesh networks for which optimal configurations is required to optimize the overall throughput and fairness. However, other objectives need to be considered in order to provide a high quality service to network users when it deployed with high traffic dynamic. In this paper, we propose a re-configuration optimization model that optimizes the network throughput in addition to reducing the disruption to the mesh clients' traffic due to the re-configuration process. In this multi-objective optimization model, four objective functions are proposed to be minimized namely maximum link-channel utilization, network average contention, channel re-assignment cost, and re-routing cost. The latter two objectives focus on reducing the re-configuration overhead. This is to reduce the amount of disrupted traffic due to the channel switching and path re-routing resulted from applying the new configuration. In order to adapt to traffic dynamics in the network which might be caused by many factors i.e. users' mobility, a centralized heuristic re-configuration algorithm called State-Aware Joint Routing and Channel Assignment (SA-JRCA) is proposed in this research based on our re-configuration model. The proposed algorithm re-assigns channels to radios and re-configures flows' routes with aim of achieving a tradeoff between maximizing the network throughput and minimizing the re-configuration overhead. The ns-2 simulator is used as simulation tool and various metrics are evaluated. These metrics include channel-link utilization, channel re-assignment cost, re-routing cost, throughput, and delay. Simulation results show the good performance of SA-JRCA in term of packet delivery ratio, aggregated throughput and re-configuration overhead. It also shows higher stability to the traffic variation in comparison with other compared algorithms which suffer from performance degradation when high traffic dynamics is applied.

MDP(Markov Decision Process) Model for Prediction of Survivor Behavior based on Topographic Information (지형정보 기반 조난자 행동예측을 위한 마코프 의사결정과정 모형)

  • Jinho Son;Suhwan Kim
    • Journal of Intelligence and Information Systems
    • /
    • v.29 no.2
    • /
    • pp.101-114
    • /
    • 2023
  • In the wartime, aircraft carrying out a mission to strike the enemy deep in the depth are exposed to the risk of being shoot down. As a key combat force in mordern warfare, it takes a lot of time, effot and national budget to train military flight personnel who operate high-tech weapon systems. Therefore, this study studied the path problem of predicting the route of emergency escape from enemy territory to the target point to avoid obstacles, and through this, the possibility of safe recovery of emergency escape military flight personnel was increased. based problem, transforming the problem into a TSP, VRP, and Dijkstra algorithm, and approaching it with an optimization technique. However, if this problem is approached in a network problem, it is difficult to reflect the dynamic factors and uncertainties of the battlefield environment that military flight personnel in distress will face. So, MDP suitable for modeling dynamic environments was applied and studied. In addition, GIS was used to obtain topographic information data, and in the process of designing the reward structure of MDP, topographic information was reflected in more detail so that the model could be more realistic than previous studies. In this study, value iteration algorithms and deterministic methods were used to derive a path that allows the military flight personnel in distress to move to the shortest distance while making the most of the topographical advantages. In addition, it was intended to add the reality of the model by adding actual topographic information and obstacles that the military flight personnel in distress can meet in the process of escape and escape. Through this, it was possible to predict through which route the military flight personnel would escape and escape in the actual situation. The model presented in this study can be applied to various operational situations through redesign of the reward structure. In actual situations, decision support based on scientific techniques that reflect various factors in predicting the escape route of the military flight personnel in distress and conducting combat search and rescue operations will be possible.

Development and Evaluation of Safe Route Service of Electric Personal Assistive Mobility Devices for the Mobility Impaired People (교통약자를 위한 전동 이동 보조기기 안전 경로 서비스의 개발과 평가)

  • Je-Seung WOO;Sun-Gi HONG;Sang-Kyoung YOO;Hoe Kyoung KIM
    • 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.

OD matrix estimation using link use proportion sample data as additional information (표본링크이용비를 추가정보로 이용한 OD 행렬 추정)

  • 백승걸;김현명;신동호
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.4
    • /
    • pp.83-93
    • /
    • 2002
  • To improve the performance of estimation, the research that uses additional information addition to traffic count and target OD with additional survey cost have been studied. The purpose of this paper is to improve the performance of OD estimation by reducing the feasible solutions with cost-efficiently additional information addition to traffic counts and target OD. For this purpose, we Propose the OD estimation method with sample link use proportion as additional information. That is, we obtain the relationship between OD trip and link flow from sample link use proportion that is high reliable information with roadside survey, not from the traffic assignment of target OD. Therefore, this paper proposes OD estimation algorithm in which the conservation of link flow rule under the path-based non-equilibrium traffic assignment concept. Numerical result with test network shows that it is possible to improve the performance of OD estimation where the precision of additional data is low, since sample link use Proportion represented the information showing the relationship between OD trip and link flow. And this method shows the robust performance of estimation where traffic count or OD trip be changed, since this method did not largely affected by the error of target OD and the one of traffic count. In addition to, we also propose that we must set the level of data precision by considering the level of other information precision, because "precision problem between information" is generated when we use additional information like sample link use proportion etc. And we Propose that the method using traffic count as basic information must obtain the link flow to certain level in order to high the applicability of additional information. Finally, we propose that additional information on link have a optimal counting location problem. Expecially by Precision of information side it is possible that optimal survey location problem of sample link use proportion have a much impact on the performance of OD estimation rather than optimal counting location problem of link flow.