The time-varying shortest path problem with fuzzy transit costs and speedup
y | 02 ago 2016
Acerca de este artículo
Publicado en línea: 02 ago 2016
Páginas: 166 - 173
Recibido: 16 may 2016
DOI: https://doi.org/10.1515/ausm-2016-0010
Palabras clave
© 2016 Hassan Rezapour et al., published by De Gruyter Open
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
In this paper, we focus on the time-varying shortest path problem, where the transit costs are fuzzy numbers. Moreover, we consider this problem in which the transit time can be shortened at a fuzzy speedup cost. Speedup may also be a better decision to find the shortest path from a source vertex to a specified vertex.