• Title/Summary/Keyword: 평균 최단 경로 거리

Search Result 23, Processing Time 0.028 seconds

A Study on Bicycle Route Selection Using Optimal Path Search (최적 경로 탐색을 이용한 자전거 경로 선정에 관한 연구)

  • Baik, Seung Heon;Han, Dong Yeob
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.5
    • /
    • pp.425-433
    • /
    • 2012
  • Dijkstra's algorithm is one of well-known methods to find shortest paths over a network. However, more research on $A^*$ algorithm is necessary to discover the shortest route to a goal point with the heuristic information rather than Dijkstra's algorithm which aims to find a path considering only the shortest distance to any point for an optimal path search. Therefore, in this paper, we compared Dijkstra's algorithm and $A^*$ algorithm for bicycle route selection. For this purpose, the horizontal distance according to slope angle and average speed were calculated based on factors which influence bicycle route selection. And bicycle routes were selected considering the shortest distance or time-dependent shortest path using Dijkstra's or $A^*$ algorithm. The result indicated that the $A^*$ algorithm performs faster than Dijkstra's algorithm on processing time in large study areas. For the future, optimal path selection algorithm can be used for bicycle route plan or a real-time mobile services.

Computation of the Shortest distance and Forecasting movement distance for Y/T Multi-Cycle System (Multi-Cycle 작업을 위한 Y/T 최단거리 및 예상 이동거리 계산)

  • Park, Tae-jin;Kim, Han-soo;Kim, Cheeyong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.127-130
    • /
    • 2009
  • In this paper, we introduce a Y/T(Yard Tractor) Multi-Cycle System on the basis of RTLS that improves a low efficient loading and unloading. In the proposed approach, we apply the best suited algorithm looking for seeking of the optimum path and the shortest movement distance. In this paper, Our experiment results show that rate of a driving distance is reduced more than 12% compared to the average value, and that is reduced more than 23% compared to the maximum value.

  • PDF

Development of Integrated Accessibility Measurement Algorithm for the Seoul Metropolitan Public Transportation System (서울 대도시권 대중교통체계의 통합 시간거리 접근성 산출 알고리즘 개발)

  • Park, Jong Soo;Lee, Keumsook
    • Journal of the Korean Regional Science Association
    • /
    • v.33 no.1
    • /
    • pp.29-41
    • /
    • 2017
  • This study proposes an integrated accessibility measurement algorithm, which is applied to the Seoul Metropolitan public transportation system consisting of bus and subway networks, and analyzes the result. We construct a public transportation network graph linking bus-subway networks and take the time distance as the link weight in the graph. We develop a time-distance algorithm to measure the time distance between each pair of transit stations based on the T-card transaction database. The average travel time between nodes has been computed via the shortest-path algorithm applied to the time-distance matrix, which is obtained from the average speed of each transit route in the T-card transaction database. Here the walking time between nodes is also taken into account if walking is involved. The integrated time-distance accessibility of each node in the Seoul Metropolitan public transportation system has been computed from the T-card data of 2013. We make a comparison between the results and those of the bus system and of the subway system, and analyze the spatial patterns. This study is the first attempt to measure the integrated time-distance accessibility for the Seoul Metropolitan public transportation system consisting of 16,277 nodes with 600 bus routes and 16 subway lines.

Eight-Direction Anchor system and Location-based Shortest Relay in Wireless Sensor Networks with Mobile Sinks (센서 네트워크에서 모바일 싱크를 위한 8방향 앵커 시스템과 위치기반 최단거리 전송 프로토콜)

  • Jeon, Hyeon-Jae;Choo, Hyun-Seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.667-670
    • /
    • 2008
  • 센서노드는 무선 센서네트워크를 통해서 감지한 정보를 싱크에게 전송한다. 최근 휴대 무선장비의 이용률 증가로 센서네트워크에서 데이터를 수집하는 싱크를 휴대 무선장비로 대체하여 이동성을 보장하는 연구가 활발히 진행된다. 즉, 싱크가 이동성을 가짐으로써 센서노드가 감지한 정보를 전달하는 방법이 중요한 문제로 부각되고 있다. 따라서 모바일 싱크의 위치를 효율적으로 알리고, 다중 소스노드에서 다중 싱크로 정보를 전달하는 것이 필요하다. 특히, 고정된 싱크에서 사용하던 데이터 전송경로는 모바일 싱크 환경에서 더 이상 효율적이지 못하다. 본 논문에서는 소스노드의 위치정보를 제공하기 위한 서버로서 8방향 앵커시스템(Eight-Direction Anchor system: EDA)을 제안한다. EDA는 센서네트워크의 가장자리에 위치한 센서노드의 편중된 에너지 소모를 막고, 전체 센서노드를 균형적으로 사용함으로써 균등한 에너지 소모를 보장한다. 또한, 모바일 싱크가 소스노드로부터 데이터를 연속적으로 받기위해서 위치기반 최단거리 전송(Location-based Shortest Relay: LSR) 프로토콜을 제안한다. LSR은 소스노드에서 싱크로의 우회하는 경로를 막고, 최소 지연경로를 통하여 연속적인 데이터 전송을 보장한다. 실험결과를 통해서 제안 프로토콜은 효율적인 위치서비스의 제공뿐만 아니라, 다중 소스와 다중 모바일 싱크 환경에서 평균 데이터 전송 비용절감 효과를 얻을 수 있음을 보인다.

Evaluation on Reduction Effect of CO emission by The Real-time Traffic Information Service (실시간교통정보서비스의 일산화탄소 배출저감효과 평가)

  • Kim, Jun-Hyung;Um, Jung-Sup
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2010.09a
    • /
    • pp.129-133
    • /
    • 2010
  • 본 논문은 차량의 공회전시 불완전연소로 인한 일산화탄소의 배출량이 최대인 점에 착안하여 일반 네비게이션에서 제공하는 최단거리 모드로 주행했을 시와 '막힘없는 길 안내를 제공' 한다는 최신 공간정보기술인 실시간교통정보서비스를 적용했을 시의 공회전시간 및 일산화탄소 배출량을 비교 평가하여, 실시간교통정보서비스의 일산화탄소 저감효과를 추정해보기 위해 진행되었다. 대구시내의 교통정체구역인 수성구청에서 성서초등학교에 이르는 약 12km의 구간을 선정하여 2주간 동일구간을 요일별 시간대별로 주행함으로써 최단거리 안내서비스 주행시와 실시간교통정보서비스를 적용한 경로주행시의 공회전시간을 기록하고 환경부에서 제공하는 연료별 배출계수와 평균속도에 따른 일산화탄소 배출계수를 이용하여 일산화탄소 배출량을 산정하였으며, 측정결과 공회전시간이 약 28%, 일산화탄소 배출량은 약 57%의 감축효과를 보임을 확인하였다.

  • PDF

Diameter, Fault Diameter and Average Distance between Two Nodes in Z-cube Network (Z-cube 네트워크의 직경, 고장직경과 정점간 평균거리)

  • Gwon, Gyeong-Hui;Lee, Gye-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.1
    • /
    • pp.75-83
    • /
    • 1999
  • recently, a new hypercube-like interconnection network, the Z-cube, was proposed. The Z-cube retains most good topological properties, however, its node degree is 3/4 of hypercube's one. Considering hardware implementations, the Z-cube is a good alternative to the hypercube. In this paper, we obtained the diameter, fault diameter and the average distance between two nodes to evaluate the communication performance of the Z-cube. The recursive structure, the shortest path between two nodes I Z-cube and recurrence relation on the average distance were deduced, and node disjoint path was introduced. Although it is generally expected that the communication performance in an interconnection network with reduced node degree falls as much as that, this paper shows that the Z-cube's diameter is the same as the hypercube's one and the average distance between two nodes in Z-cube is about 1.125 times the average distance between two nodes in the hypercube and the fault diameter of Z-cube ranges approximately from 1.4times to 1.7times the fault diameter of the hypercube.

  • PDF

Adaptive routing algorithm for equitable load balancing with propagation delay (전송지연을 적용한 적응균등부하조절 경로설정 알고리듬)

  • 주만식;백이현;주판유;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2635-2643
    • /
    • 1997
  • In this paepr, a routing algorithm is proposed in order to reduce average end-to-end delay and congesting in the high speed network. The algorithm proposed here uses the existing one which adaptively modifies routes and the amount of traffic allocated to each link as user traffic partterns flutuate. This algorithm is ELB(Equitable Load Balancing). Also, the new algorithm considers the proportional to the distance between source and destination. It reduces congestion from the ELB and average end-to-end delay from the propagation dealy concepts respectively. Through the simulation, it shows that the algorithm proposed here reduces average end-to-end delay over low load to high load, and it also guarantees the congestion control.

  • PDF

A Non-Incremental Hierarchical Conference Organization Using Shortest Distance Terminal (최단 거리 단말기를 이용하는 비점진적 계층 회의 구성 방법)

  • Lee, Keonbae
    • Journal of IKEEE
    • /
    • v.18 no.2
    • /
    • pp.248-254
    • /
    • 2014
  • The hierarchical conference causes the data delay because the exchanged data between terminals in the conference go through the hierarchical structure. In this paper, we propose an algorithm which minimizes the average path distance between terminals in a non-incremental hierarchical conference, and which considers the computing resource. For terminals which want to join the ongoing hierarchical conference, our algorithm selects terminals that the new connection is possible among terminals in the conference with the computing resource consideration. Then, after all distance values between the selected terminals and terminals which want to join the ongoing hierarchical conference are computed, and the terminal-pair which have minimum distance value is selected, the ongoing hierarchical conference is extended with a connection of the terminal-pair which consists of a terminal among selected terminals and other terminal among terminals which want to join the ongoing hierarchical conference. This continues until all terminals are included in the conference. As the experimental results with the proposed non-incremental scheme, the hierarchical conference can be organized with 24% better performance than the earlier incremental scheme on the basis of average path distance between terminals.

An Economic Ship Routing System by a Path Search Algorithm based on Evolutionary Strategy (진화전략 기반 경로탐색 알고리즘을 활용한 선박경제운항시스템)

  • Bang, Se-hwan;Kwon, Yung-keun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.11a
    • /
    • pp.821-824
    • /
    • 2014
  • 선박경제운항이란 예보된 기상정보를 활용하여 연료소모량을 최소화하도록 선박을 운항하는 것으로서 최근 다양한 방법론이 연구되고 있다. 성공적인 경제운항시스템을 구현하기 위해서는 기상을 고려하여 지리적 운항경로를 바꾸거나 적절하게 엔진 출력을 조절하는 방법이 필요하다. 그러나 항해 시각에 따라 연료소모량이 변하는 동적 비용 문제임을 고려할 때 지리적 운항 경로의 결정은 최적의 해를 찾기가 어렵다. 이에 이 논문에서는 매우 많은 지리적 후보 경로들 중에서 우수한 품질의 해를 효과적으로 탐색하기 위한 진화전략 기반 경로탐색 알고리즘을 제안하였다. 제안된 방법을 5개 노선에 대해 실험한 결과 최단거리 운항 방법에 비해 운항소요시간은 거의 차이가 없으면서도 연료소모량을 평균 1.41%, 최대 1.45% 개선시킬 수 있었다.

Island Biogeographic Study on Distribution Pattern of the Naturalized Plant Species on the Uninhabited Islands in Korea (우리나라 무인도서의 귀화식물 분포에 대한 섬생물지리적 연구)

  • Chung, Jae-Min;Hong, Kyung-Nak
    • Journal of Ecology and Environment
    • /
    • v.29 no.6
    • /
    • pp.489-494
    • /
    • 2006
  • For the ecosystem conservation and the effective management of naturalized plant species on 261 uninhabited islands distributed in southern and western sea in Korea, we tested the interrelationship between the pattern of distribution and dispersal of the naturalized plant species and the factors of geographical environment of uninhabited islands such as island area, distance from mainland, latitude, longitude, human impacts and habitat diversity. Out of 261 uninhabited islands surveyed, 106 species of the naturalized plants occurred on 229 (87.7%) islands. The naturalized plant species per island averaged 4.6 (SD=4.07) species, and plant species number were higher in southern group (87 species) than in western group (64 species) of islands. Plant species occurred on more than 100 islands were three species : Rumex crispus L. (153 islands), Erigeron annuus Pers. (130 islands), and Conyza canadensis (L.) Cronquist (121 islands), the highest grade '5' of 'degree of naturalization'. The occurrence frequency of 106 naturalized plant species was significantly correlated with island area, distance to mainland, strength of human impacts, and latitude and longitude. Correlation coefficient (r=-0.330) between occurrence frequency and distance from mainland was higher than between occurrence frequency and island area (r=-0.182). The result of path analysis confirmed that plant species number was significantly affected by island area p=0.336) and distance from mainland (p=-0.490), but in this analysis the effect of human impacts on plant species number was very weak (p=0.003). On the basis of these results, strategies on the conservation of ecosystem and the management of naturalized plant species in the uninhabited islands of Korea were discussed.