scholarly journals Route planning on orienteering maps with least-cost path analysis

2021 ◽  
Vol 4 ◽  
pp. 1-7
Author(s):  
Gáspár Albert ◽  
Zsófia Sárközy
Keyword(s):  
Land Cover ◽  
Linear Function ◽  
Road Network ◽  
Route Planning ◽  
Time Cost ◽  
Least Cost Path ◽  
Setting Process ◽  
Cost Surface ◽  
Least Cost Path Analysis ◽  
The Ideal

Abstract. The feature categories of an orienteering map are prepared to allow the map reader to estimate the travel time between any two points on the map with a good approximation. This requires not only an accurate map, but also a key that adapts to the speed of travel. Such map key is developed and maintained by the IOF (International Orienteering Federation), and technically all the orienteering maps are compiled by using it. Estimated time also plays an important role in planning the courses of orienteering races. The course setter estimates time based on a route he thinks is ideal, but the speed of travel is basically a non-linear function of terrain, road network and land cover. Because of this, the easiest (ideal) route between the two points and its time cost can be calculated using the least-cost path (LCP) GIS method, which can be prepared to take into account these three map feature categories. This method is based on the calculation of a cost surface, then the analysis of the ideal path from a given point to the destination. The automation can be adapted to any orienteering map due to the similarities of the map keys. This study shows that if the weight corresponding to the different feature categories is given properly, the ideal path between two points on orienteering maps can be calculated. The ideal path, however is still a subjective category, which may depend on the capabilities and preferences of the orienteer. In this study the routes calculated with the LCP method were compared with the suggestions of the ideal routes by orienteering runners of different ages. The results show that the routes given by sportsmen can be simulated with the LCP method and even the time cost of the calculated routes can be calculated. This study can lay the groundwork for a GIS tool helping the course setting process on standard orienteering maps.

scholarly journals Towards Alleviating Traffic Congestion: Optimal Route Planning for Massive-Scale Trips

2020 ◽  
Author(s):  
Ke Li ◽  
Lisi Chen ◽  
Shuo Shang
Keyword(s):  
Traffic Congestion ◽  
Road Network ◽  
Route Planning ◽  
Exact Algorithm ◽  
Optimal Route ◽  
Time Cost ◽  
Traffic Flow Management ◽  
Massive Scale ◽  
Global Travel ◽  
Insight Into

We investigate the problem of optimal route planning for massive-scale trips: Given a traffic-aware road network and a set of trip queries Q, we aim to find a route for each trip such that the global travel time cost for all queries in Q is minimized. Our problem is designed for a range of applications such as traffic-flow management, route planning and congestion prevention in rush hours. The exact algorithm bears exponential time complexity and is computationally prohibitive for application scenarios in dynamic traffic networks. To address the challenge, we propose a greedy algorithm and an epsilon-refining algorithm. Extensive experiments offer insight into the accuracy and efficiency of our proposed algorithms.

Development of a Relational Accident Database Management System for Mexican Federal Roads

2000 ◽  
Vol 1717 (1) ◽  
pp. 84-93
Author(s):  
Alberto Mendoza ◽  
Aristóteles Uribe ◽  
Claudia Z. Gil ◽  
Emilio Mayoral
Keyword(s):  
Geographic Information Systems ◽  
Management System ◽  
Database Management ◽  
Road Network ◽  
Data Exchange ◽  
Information Sources ◽  
Database Management System ◽  
The Internet ◽  
Computer Based ◽  
The Ideal

Two years ago, the Mexican Transportation Institute began to develop a computer-based management system of the information collected by various organizations about accidents occurring on the Federal Road Network. This system combines the information gathered by these organizations with the purpose of completing and validating the data so that tools can be developed for processing and analyzing the validated data and the processed data and developed tools can be made available to users. It was decided to support the development of such efforts on computer databases already being generated, on database processing and management software, on geographic information systems, and on remote data-exchange systems (e.g., the Internet). The progress made so far in the development of the computer system is reviewed. The system has been named the “Relational Accident Database Management System for Mexican Federal Roads” (SAIACF, in Spanish). The information sources beneficial to this project are identified and analyzed. The ideal scheme conceived for the integration of the various information sources is presented, and the SAIACF system is outlined. Some of the results obtained after its application to the information corresponding to 1997 are shown. Also, the element that was generated to make the information and the tools available to users is described, and conclusions are drawn.

Impact of Spatial Filtering on the Least Cost Path Method

2010 ◽  
Vol 1 (4) ◽  
pp. 32-44
Author(s):  
Amy E. Rock ◽  
Amanda Mullett ◽  
Saad Algharib ◽  
Jared Schaffer ◽  
Jay Lee
Keyword(s):  
Land Cover ◽  
High Speed ◽  
Least Cost Path ◽  
High Speed Rail ◽  
Highway Infrastructure ◽  
Advantages And Disadvantages ◽  
Passenger Rail ◽  
The Face ◽  
Cost Paths ◽  
Cost Factors

In the face of renewed interest in High-Speed Rail (HSR) projects, Ohio is one of several states seeking federal funding to relieve pressure on aging, overburdened highway infrastructure by constructing passenger rail routes between major cities. This paper evaluates the creation of a new rail route in Ohio’s 3-C Corridor utilizing GIS. The authors consider two primary cost factors in construction, slope and land cover, to generate alternative least-cost paths. To assess the importance of the cost factors, two separate paths are created using two different weighting methods for the land cover layer. The land cover is weighted first by difficulty of construction, and second by relative acquisition costs. These two paths are then compared against a path selected by the Ohio Hub Project which uses existing track lines, advantages and disadvantages of each are discussed.

scholarly journals Modeling and optimizing transmission lines with GIS and Multi-Criteria Decision Analysis

2017 ◽  
Vol 59 (1) ◽  
pp. 1-9 ◽  
Author(s):  
Joram Schito
Keyword(s):  
Decision Analysis ◽  
Transmission Lines ◽  
Least Cost Path ◽  
Ongoing Research ◽  
Stable Algorithm ◽  
Multi Criteria Decision Analysis ◽  
Transmission Towers ◽  
Cost Surface ◽  
First Results ◽  
Simple Additive Weighting

AbstractIn planning transmission lines with the use of Geographic Information Systems, the use of the Least Cost Path (LCP) algorithm has been established while relevant criteria are modeled using Multi-Criteria Decision Analysis (MCDA). Despite their established use, this combination (MCDA/LCP) often leads to results that do not correspond to realistic conditions. Therefore, the MCDA/LCP computation must usually be optimized on an algorithmic level as well as on the decision model and the underlying data relevant for the MCDA. The current paper presents the state-of-the-art of an ongoing research project that aims to solve these issues. First results are promising since a stable algorithm has been developed that computes a cost surface, a Least Cost Corridor (LCC), a LCP, and the transmission towers' positions by simple additive weighting based on user's weights. Optimizations on the MCDA models have already been implemented and tested. The findings are integrated into a 3D Decision Support System which aims at facilitating the work of TL planners by realistic modeling and by reducing the approval process for new TL.

Sign in / Sign up

Export Citation Format

Share Document