Volume 18, Issue 1 (3-2021)                   2021, 18(1): 21-38 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Davtalab-Olyaie M, Ghandi F. Solving Multi-Objective Shortest Path Problem Using Data Envelopment Analysis. Journal of Operational Research and Its Applications. 2021; 18 (1) :21-38
URL: http://jamlu.liau.ac.ir/article-1-1775-en.html
Abstract:   (593 Views)
In the traditional shortest path problems, there is one attribute associated with each arc. However, in many real applications several cost and profit attributes should be considered for the arcs. In the presence of multi attributes for the arcs, one can aggregate different attributes to determine a score for each arc. To this end, we propose two methods in this paper. In the first method we use the cross-efficiency evaluation for evaluating the efficiency score of each arc. We convert multi-objective shortest path problem to a single-objective optimization by inserting the cross-efficiency scores of the arcs in the objective function. The objective function of the proposed model is so designed to provide the shortest path with maximum efficiency between the source and the sink node in the network, called the efficient shortest path. Due to the discriminating power of the cross-efficiency evaluation approach, our method improves the discriminating power in determining the best path between two specific nodes in a given network. Furthermore, our estimated efficiency scores for the arcs have a global nature; that is, the efficiency score of each arc is measured against all the arcs in the network. In the second method, in order to finding the Pareto-optimal shortest path for a given network, we use a common set of weights, which it maximizes the efficiency of all arcs, for all arcs to convert multi-objective shortest path problem to a single-objective optimization.
Full-Text [PDF 978 kb]   (189 Downloads)    
Type of Study: Research | Subject: Special
Received: 2018/11/4 | Accepted: 2020/09/26

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.