The time-varying shortest path problem with fuzzy transit costs and speedup

Abstract

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.

Keywords

• time-varying optimization
• shortest path
• fuzzy numbers
• speedup
• 90c35
• 90b10