Trapezoidal Fuzzy Shortest Path (TFSP) Selection for Green Routing and Scheduling Problems
The routing of vehicles represents an important component of many distribution and transportation systems. Finding the shortest path is one of the fundamental and popular problems. In real life applications, like vehicle green routing and scheduling, transportation, etc. which are related to environmental issues the arc lengths could be uncertain due to the fluctuation with traffic conditions or weather conditions. Therefore finding the exact optimal path in such networks could be challenging. In this paper, we discuss and analyze different approaches for finding the Fuzzy Shortest Path. The shortest path is computed using the ranking methods based on i)Degree of Similarity ii) Acceptable Index, where the arc lengths are expressed as trapezoidal fuzzy numbers. The Decision makers can choose the best path among the various alternatives from the list of rankings by prioritizing the scheduling which facilitates Green Routing.
KeywordsFuzzy Shortest Path Bellman’s Dynamic Programming Trapezoidal Fuzzy shortest path Degree of Similarity Acceptable Index
Unable to display preview. Download preview PDF.
- 1.Touati-Moungla, N., Jost, V.: On green routing and scheduling problem, hal-00674437, version 1 - 7 (March 2012)Google Scholar
- 9.De, P.K., Bhinchar, A.: Computation of Shortest Path in a Fuzzy Network: Case Study with Rajasthan Roadways Network. International Journal of Computer Applications (0975 – 8887) 11(12) (December 2010)Google Scholar
- 10.Sujatha, L., Elizabeth, S.: Fuzzy Shortest Path Problem Based on Index Ranking. Journal of Mathematics Research 3(4) (November 2011)Google Scholar