Next Article in Journal
Stakeholder Specific Multi-Scale Spatial Representation of Urban Building-Stocks
Previous Article in Journal
Coupling Traditional Monitoring and Citizen Science to Disentangle the Invasion of Halyomorpha halys
Article Menu
Issue 5 (May) cover image

Export Article

Open AccessArticle
ISPRS Int. J. Geo-Inf. 2018, 7(5), 172; https://doi.org/10.3390/ijgi7050172

Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach

1
,
1,2,3,* , 1,2
,
1,4
,
1
and
1,2,3
1
Key Laboratory of Virtual Geographic Environment, Ministry of Education, Nanjing Normal University, Nanjing 210046, China
2
State Key Laboratory Cultivation Base of Geographical Environment Evolution, Nanjing 210023, China
3
Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application, Nanjing 210023, China
4
Institute of Computer Science and Technology, Nanjing Normal University, Nanjing 210023, China
*
Author to whom correspondence should be addressed.
Received: 2 March 2018 / Revised: 22 April 2018 / Accepted: 28 April 2018 / Published: 4 May 2018
View Full-Text   |   Download PDF [1765 KB, uploaded 4 May 2018]   |  

Abstract

The process of searching for a dynamic constrained optimal path has received increasing attention in traffic planning, evacuation, and personalized or collaborative traffic service. As most existing multiple constrained optimal path (MCOP) methods cannot search for a path given various types of constraints that dynamically change during the search, few approaches for dynamic multiple constrained optimal path (DMCOP) with type II dynamics are available for practical use. In this study, we develop a method to solve the DMCOP problem with type II dynamics based on the unification of various types of constraints under a geometric algebra (GA) framework. In our method, the network topology and three different types of constraints are represented by using algebraic base coding. With a parameterized optimization of the MCOP algorithm based on a greedy search strategy under the generation-refinement paradigm, this algorithm is found to accurately support the discovery of optimal paths as the constraints of numerical values, nodes, and route structure types are dynamically added to the network. The algorithm was tested with simulated cases of optimal tourism route searches in China’s road networks with various combinations of constraints. The case study indicates that our algorithm can not only solve the DMCOP with different types of constraints but also use constraints to speed up the route filtering. View Full-Text
Keywords: geometric algebra; multiconstrained optimal path; network analysis; network coding; path extension; route planning; geographical information system geometric algebra; multiconstrained optimal path; network analysis; network coding; path extension; route planning; geographical information system
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Li, D.; Yu, Z.; Luo, W.; Hu, Y.; Che, X.; Yuan, L. Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach. ISPRS Int. J. Geo-Inf. 2018, 7, 172.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
ISPRS Int. J. Geo-Inf. EISSN 2220-9964 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top