期刊
INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS
卷 29, 期 2, 页码 231-248出版社
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0218488521500116
关键词
Shortest path problem; dynamic programming; location-based online service; fuzzy numbers; distance function
资金
- Spanish Ministry of Economy and Competitiveness [TIN2017-86647-P]
- FEDER funds from the European Union [TIN2017-86647-P]
The important issue of improving transportation in connection with traffic is discussed, focusing on the constrained shortest path (CSP) problem and an efficient algorithm designed to find the optimal path.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据