Back to Search
Start Over
Fuzzy Constrained Shortest Path Problem for Location-Based Online Services
- Source :
- International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems. 29:231-248
- Publication Year :
- 2021
- Publisher :
- World Scientific Pub Co Pte Lt, 2021.
-
Abstract
- One of the important issues under discussion connected with traffic on the roads is improving transportation. In this regard, spatial information, including the shortest path, is of particular importance due to the reduction of economic and environmental costs. Here, the constrained shortest path (CSP) problem which has an important application in location-based online services is considered. The aim of this problem is to find a path with the lowest cost where the traversal time of the path does not exceed from a predetermined time bound. Since precise prediction of cost and time of the paths is not possible due to traffic and weather conditions, this paper discusses the CSP problems with fuzzy cost and fuzzy time. After formulating the CSP problem an efficient algorithm for finding the constrained optimal path is designed. The application of the proposed model is presented on a location-based online service called Snap.
Details
- ISSN :
- 17936411 and 02184885
- Volume :
- 29
- Database :
- OpenAIRE
- Journal :
- International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
- Accession number :
- edsair.doi...........f177d50d917ffcaa6c6b487612050780