@article { author = {Tayyebi, Javad and Amirteymoori, Alireza}, title = {Further study on "an extended shortest path problem A data envelopment analysis approach"}, journal = {Communications in Combinatorics and Optimization}, volume = {8}, number = {1}, pages = {253-259}, year = {2023}, publisher = {Azarbaijan Shahid Madani University}, issn = {2538-2128}, eissn = {2538-2136}, doi = {10.22049/cco.2022.27510.1280}, abstract = {Amirteimoori proposed an approach based on data envelopment analysis (DEA) for  multi-objective path problems on networks whose arcs contain multiple positive and negative attributes [A. Amirteimoori, An extended shortest path problem: A data envelopment analysis approach, Applied Mathematics Letters 25 (2012) 1839-1843]. The approach is to define a relative efficiency for each arcs using DEA models, and then to solve a longest path problem for obtaining a path with maximum efficiency. In this note, we focus on two drawbacks of the approach and illustrate them using examples. Then, we propose remedies to eliminate them.}, keywords = {Data envelopment analysis,Shortest path,Multi attributes}, url = {http://comb-opt.azaruniv.ac.ir/article_14352.html}, eprint = {http://comb-opt.azaruniv.ac.ir/article_14352_daae7c08673222d8d10445fb190c76f1.pdf} }