.png){kind=icon}
.png){kind=icon}
Return
Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-020-00234-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The shortest path problem (SPP) is a special network structured linear programming problem that appears in a wide range of applications. Classical SPPs consider only one objective in the networks while some or all of the multiple, conflicting and incommensurate objectives such as optimization of cost, profit, time, distance, risk, and quality of service may arise together in real-world applications. These types of SPPs are known as the multi-objective shortest path problem (MOSPP) and can be solved with the existing various approaches. This paper develops a Data Envelopment Analysis (DEA)-based approach to solve the MOSPP with fuzzy parameters (FMOSPP) to account for real situations where input-output data include uncertainty of triangular membership form. This approach to make a connection between the MOSPP and DEA is more flexible to deal with real practical applications. To this end, each arc in a FMOSPP is considered as a decision-making unit with multiple fuzzy inputs and outputs. Then two fuzzy efficiency scores are obtained corresponding to each arc. These fuzzy efficiency scores are combined to define a unique fuzzy relative efficiency. Hence, the FMOSPP is converted into a single objective Fuzzy Shortest Path Problem (FSPP) that can be solved using existing FSPP algorithms.
Keywords:
Shortest path problem
Fuzzy numbers
Data envelopment analysis
Fuzzy efficiency
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K