An interface for exploring spatial alternatives for a corridor location problem
Computers & Geosciences - Special issue on geographical computing
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
Optimal paths in graphs with stochastic or multidimensional weights
Communications of the ACM
Communications of the ACM
Evolutionary Algorithms: The Role of Mutation and Recombination
Evolutionary Algorithms: The Role of Mutation and Recombination
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Indexing of network constrained moving objects
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
OpenStreetMap: User-Generated Street Maps
IEEE Pervasive Computing
Time-Aggregated Graphs for Modeling Spatio-temporal Networks
Journal on Data Semantics XI
A hybrid evolutionary-graph approach for finding functional network paths
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Effective vaccination policies
Information Sciences: an International Journal
| Hi-index | 0.00 |
This paper describes an approach to using evolutionary algorithms for reasoning about paths through network data. The paths investigated in the context of this research are functional paths wherein the characteristics (e.g., path length, morphology, location) of the path are integral to the objective purpose of the path. Using two datasets of combined surface and road networks, the research demonstrates how an evolutionary algorithm can be used to reason about functional paths. We present the algorithm approach, the parameters and fitness function that drive the functional aspects of the path, and an approach for using the algorithm to respond to dynamic changes in the search space. The results of the search process are presented in terms of the overall success based on the response of the search to variations in the environment and through the use of an occupancy grid characterizing the overall search process. The approach offers a great deal of flexibility over more conventional heuristic path finding approaches and offers additional perspective on dynamic network analysis.