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

Hassan Rezapour | Zendy; Gholamhassan Shirdel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Hassan Rezapour,

Gholamhassan Shirdel

Publication year - 2016

Publication title -

acta universitatis sapientiae mathematica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.351

H-Index - 9

eISSN - 2066-7752

pISSN - 1844-6094

DOI - 10.1515/ausm-2016-0010

Subject(s) - speedup , shortest path problem , vertex (graph theory) , computer science , k shortest path routing , mathematical optimization , transit time , fuzzy logic , mathematics , graph , parallel computing , theoretical computer science , artificial intelligence , transport engineering , engineering

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research