• Title/Summary/Keyword: Dijkstra Algorithm

Search Result 163, Processing Time 0.023 seconds

A study on shortest problem between specified nodes with multiple travel time (다수개의 여행시간이 주어진 경우의 지정된 마디간의 최단경로 문제)

  • 이명석;박순달
    • Korean Management Science Review
    • /
    • v.7 no.2
    • /
    • pp.51-57
    • /
    • 1990
  • The purpose of this thesis is to find the shortest path between two nodes on an acyclic network where the arc costs are determined by the starting time at the starting node of the arc. A branch and bound method for optimal solutions and a heuristic method is developed. In heuristic method Dijkstra algorithm is modified to maintain the minimum arrival times of maximum informations in the each time period at each node and is updated by the result with the insertion technique. Expermetal results among two methods are presented with regard to run time and solution qualities.

  • PDF

A New Link-Based Single Tree Building Algorithm for Shortest Path Searching in an Urban Road Transportation Network

  • Suhng, Byung Munn;Lee, Wangheon
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.4
    • /
    • pp.889-898
    • /
    • 2013
  • The shortest-path searching algorithm must not only find a global solution to the destination, but also solve a turn penalty problem (TPP) in an urban road transportation network (URTN). Although the Dijkstra algorithm (DA) as a representative node-based algorithm secures a global solution to the shortest path search (SPS) in the URTN by visiting all the possible paths to the destination, the DA does not solve the TPP and the slow execution speed problem (SEP) because it must search for the temporary minimum cost node. Potts and Oliver solved the TPP by modifying the visiting unit from a node to the link type of a tree-building algorithm like the DA. The Multi Tree Building Algorithm (MTBA), classified as a representative Link Based Algorithm (LBA), does not extricate the SEP because the MTBA must search many of the origin and destination links as well as the candidate links in order to find the SPS. In this paper, we propose a new Link-Based Single Tree Building Algorithm in order to reduce the SEP of the MTBA by applying the breaking rule to the LBA and also prove its usefulness by comparing the proposed with other algorithms such as the node-based DA and the link-based MTBA for the error rates and execution speeds.

A Combined Heuristic Algorithm for Preference-based Shortest Path Search (선호도 기반 최단경로 탐색을 위한 휴리스틱 융합 알고리즘)

  • Ok, Seung-Ho;Ahn, Jin-Ho;Kang, Sung-Ho;Moon, Byung-In
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.8
    • /
    • pp.74-84
    • /
    • 2010
  • In this paper, we propose a preference-based shortest path algorithm which is combined with Ant Colony Optimization (ACO) and A* heuristic algorithm. In recent years, with the development of ITS (Intelligent Transportation Systems), there has been a resurgence of interest in a shortest path search algorithm for use in car navigation systems. Most of the shortest path search algorithms such as Dijkstra and A* aim at finding the distance or time shortest paths. However, the shortest path is not always an optimum path for the drivers who prefer choosing a less short, but more reliable or flexible path. For this reason, we propose a preference-based shortest path search algorithm which uses the properties of the links of the map. The preferences of the links are specified by the user of the car navigation system. The proposed algorithm was implemented in C and experiments were performed upon the map that includes 64 nodes with 118 links. The experimental results show that the proposed algorithm is suitable to find preference-based shortest paths as well as distance shortest paths.

MODELS AND SOLUTION METHODS FOR SHORTEST PATHS IN A NETWORK WITH TIME-DEPENDENT FLOW SPEEDS

  • Sung, Ki-Seok;Bell, Michael G-H
    • Management Science and Financial Engineering
    • /
    • v.4 no.2
    • /
    • pp.1-13
    • /
    • 1998
  • The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.

  • PDF

Hybrid Genetic Algorithm or Obstacle Location-Allocation Problem

  • Jynichi Taniguchi;Mitsuo Gen;Wang, Xiao-Dong;Takao Yokota
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.191-194
    • /
    • 2003
  • Location-allocation problem is known as one of the important problem faced in Industrial Engineering and Operations Research fielde. There are many variations on this problem for different applications, however, most of them consider no obstacle existing. Since the location-allocation problem with obstacles is very complex and with many infeasible solutions, no direct method is effective to solve it. In this paper we propose a hybrid Genetic Algorithm (hGA) method for solving this problem. The proposed hGA is based on Lagrangian relaxation method and Dijkstra's shortest path algorithm. To enhance the proposed hGA, a Fuzzy Logic Controller (FLC) approach is also adopted to auto-tune the GA parameters.

  • PDF

Steiner Tree Compilation of Multicast under Differentiated Services Constraints

  • Vrontis, Stavros;Xynogalas, Stavros;Sykas, Efstathios
    • Journal of Communications and Networks
    • /
    • v.9 no.1
    • /
    • pp.84-92
    • /
    • 2007
  • This paper deals with the creation of multicast trees in a differentiated services (DiffServ) domain. Initially, we model the integration problems of multicast & DiffServ and give a general de-scription of our framework for multicast provisioning in DiffServ domains. Within this framework, we introduce a novel heuristic algorithm which calculates the multicast trees efficiently. The multicast tree's format and the bandwidth constraints per service class are modeled. The heuristic is based on the Dijkstra's shortest path algorithm and aims to produce the cheapest possible trees (Steiner tree problem) that conform to the defined model. The produced trees can be considered as DiffServ-customized Steiner trees. Furthermore, we evaluate the algorithm with theoretical and experimental analysis and finally, we present our conclusions.

Improved Algorithm for Constructing Euclidean City Voronoi Diagrams (유클리드 씨티 보로노이 다이어그램 계산을 위한 향상된 알고리즘)

  • Bae, Sang-Won;Kim, Jae-Hoon;Chwa, Kyung-Yong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10a
    • /
    • pp.505-510
    • /
    • 2006
  • This paper presents an improved algorithm for constructing the city Voronoi diagram under the Euclidean metric given a transportation network consisting of roads having a constant number of speeds and orientations. The algorithm applies the continuous Dijkstra paradigm and its efficiency follows from new geometric insights that are first observed in this paper.

  • PDF

Design and Implementation of Indoor Positioning & Shortest Path Navigation System Using GPS and Beacons in Narrow Buildings

  • Sang-Hyeon, Park;Huhnkuk, Lim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.3
    • /
    • pp.11-16
    • /
    • 2023
  • As techniques for indoor positioning, fingerprinting, indoor positioning method using trilateration, and utilizing information obtained from equipments by Wi-Fi/Bluetooth, etc are common and representative methods to specify the user's indoor position. However, in these methods, an indoor space should be provided with enough space to install a large number of equipment (AP, Beacon). In this paper, we propose a technique that can express the user's location within a building by simultaneously using the GPS signal and the signal transmitted from the beacon in a building structure where the conventional method cannot be applied, such as a narrow building. A shortest path search system was designed and implemented by applying the Dijkstra Algorithm, one of the most representative and efficient shortest path search algorithms for shortest path search. The proposed technique can be considered as one of the methods for measuring the user's indoor location considering the structural characteristics of a building in the future.

Naval Ship Evacuation Path Search Using Deep Learning (딥러닝을 이용한 함정 대피 경로 탐색)

  • Ju-hun, Park;Won-sun, Ruy;In-seok, Lee;Won-cheol, Choi
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.59 no.6
    • /
    • pp.385-392
    • /
    • 2022
  • Naval ship could face a variety of threats in isolated seas. In particular, fires and flooding are defined as disasters that are very likely to cause irreparable damage to ships. These disasters have a very high risk of personal injury as well. Therefore, when a disaster occurs, it must be quickly suppressed, but if there are people in the disaster area, the protection of life must be given priority. In order to quickly evacuate the ship crew in case of a disaster, we would like to propose a plan to quickly explore the evacuation route even in urgent situations. Using commercial escape simulation software, we obtain the data for deep neural network learning with simulations according to aisle characteristics and the properties and number of evacuation person. Using the obtained data, the passage prediction model is trained with a deep learning, and the passage time is predicted through the learned model. Construct a numerical map of a naval ship and construct a distance matrix of the vessel using predicted passage time data. The distance matrix configured in one of the path search algorithms, the Dijkstra algorithm, is applied to explore the evacuation path of naval ship.

Flexible Intelligent Exit Sign Management of Cloud-Connected Buildings

  • Lee, Minwoo;Mariappan, Vinayagam;Lee, Junghoon;Cho, Juphil;Cha, Jaesang
    • International Journal of Advanced Culture Technology
    • /
    • v.5 no.1
    • /
    • pp.58-63
    • /
    • 2017
  • Emergencies and disasters can happen any time without any warning, and things can change and escalate very quickly, and often it is swift and decisive actions that make all the difference. It is a responsibility of the building facility management to ensure that a proven evacuation plan in place to cover various worst scenario to handled automatically inside the facility. To mapping out optimal safe escape routes is a straightforward undertaking, but does not necessarily guarantee residents the highest level of protection. The emergency evacuation navigation approach is a state-of-the-art that designed to evacuate human livings during an emergencies based on real-time decisions using live sensory data with pre-defined optimum path finding algorithm. The poor decision on causalities and guidance may apparently end the evacuation process and cannot then be remedied. This paper propose a cloud connected emergency evacuation system model to react dynamically to changes in the environment in emergency for safest emergency evacuation using IoT based emergency exit sign system. In the previous researches shows that the performance of optimal routing algorithms for evacuation purposes are more sensitive to the initial distribution of evacuees, the occupancy levels, and the type and level of emergency situations. The heuristic-based evacuees routing algorithms have a problem with the choice of certain parameters which causes evacuation process in real-time. Therefore, this paper proposes an evacuee routing algorithm that optimizes evacuation by making using high computational power of cloud servers. The proposed algorithm is evaluated via a cloud-based simulator with different "simulated casualties" are then re-routed using a Dijkstra's algorithm to obtain new safe emergency evacuation paths against guiding evacuees with a predetermined routing algorithm for them to emergency exits. The performance of proposed approach can be iterated as long as corrective action is still possible and give safe evacuation paths and dynamically configure the emergency exit signs to react for real-time instantaneous safe evacuation guidance.