MULTI-CRITERIA PATH FINDING

  • Mohammadi E
  • Hunter A
N/ACitations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Path finding solutions are becoming a major part of many GIS applications including location based services and web-based GIS services. Most traditional path finding solutions are based on shortest path algorithms that tend to minimize the cost of travel from one point to another. These algorithms make use of some cost criteria that is usually an attribute of the edges in the graph network. Providing one shortest path limits user's flexibility when choosing a possible route, especially when more than one parameter is utilized to calculate cost (e.g., when length, number of traffic lights, and number of turns are used to calculate network cost.) K shortest path solutions tend to overcome this problem by providing second, third, and K th shortest paths. These algorithms are efficient as long as the graphs edge weight does not change dynamically and no other parameters affect edge weights. In this paper we try to go beyond finding shortest paths based on some cost value, and provide all possible paths disregarding any parameter that may affect total cost. After finding all possible paths, we can rank the results by any parameter or combination of parameters, without a substantial increase in time complexity.

Cite

CITATION STYLE

APA

Mohammadi, E., & Hunter, A. (2012). MULTI-CRITERIA PATH FINDING. ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, XXXIX-B2, 157–159. https://doi.org/10.5194/isprsarchives-xxxix-b2-157-2012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free