hrcak mascot   Srce   HID

Original scientific paper
https://doi.org/10.17535/crorr.2018.0012

A DEA-based Approach for Finding a Favorable Multi-objective Shortest Path

Gholam Hassan Shirdel   ORCID icon orcid.org/0000-0003-2759-4606 ; Faculty of Science, University of Qom, Iran
Somayeh Ramezani-Tarkhorani ; Faculty of Science, University of Qom, Iran

Fulltext: english, pdf (3 MB) pages 149-164 downloads: 230* cite
APA 6th Edition
Shirdel, G.H. & Ramezani-Tarkhorani, S. (2018). A DEA-based Approach for Finding a Favorable Multi-objective Shortest Path. Croatian Operational Research Review, 9 (2), 149-164. https://doi.org/10.17535/crorr.2018.0012
MLA 8th Edition
Shirdel, Gholam Hassan and Somayeh Ramezani-Tarkhorani. "A DEA-based Approach for Finding a Favorable Multi-objective Shortest Path." Croatian Operational Research Review, vol. 9, no. 2, 2018, pp. 149-164. https://doi.org/10.17535/crorr.2018.0012. Accessed 25 Sep. 2021.
Chicago 17th Edition
Shirdel, Gholam Hassan and Somayeh Ramezani-Tarkhorani. "A DEA-based Approach for Finding a Favorable Multi-objective Shortest Path." Croatian Operational Research Review 9, no. 2 (2018): 149-164. https://doi.org/10.17535/crorr.2018.0012
Harvard
Shirdel, G.H., and Ramezani-Tarkhorani, S. (2018). 'A DEA-based Approach for Finding a Favorable Multi-objective Shortest Path', Croatian Operational Research Review, 9(2), pp. 149-164. https://doi.org/10.17535/crorr.2018.0012
Vancouver
Shirdel GH, Ramezani-Tarkhorani S. A DEA-based Approach for Finding a Favorable Multi-objective Shortest Path. Croatian Operational Research Review [Internet]. 2018 [cited 2021 September 25];9(2):149-164. https://doi.org/10.17535/crorr.2018.0012
IEEE
G.H. Shirdel and S. Ramezani-Tarkhorani, "A DEA-based Approach for Finding a Favorable Multi-objective Shortest Path", Croatian Operational Research Review, vol.9, no. 2, pp. 149-164, 2018. [Online]. https://doi.org/10.17535/crorr.2018.0012

Abstracts
Multi-objective shortest path problems deals with networks in which each are is associated with multiple types of costs and profits. The conditions can increase number of non-dominated paths and compounds difficulty of selecting a favorable one for Decision Maker (DM). In this paper we suggest a hybrid method to generate a non-dominated path which fulfills decision maker’s demands. It uses DEA in a more logical way than some previous DEA-based approaches. We take advantage of common weights methodology. DM can give relative importance of some cost and profit indicators. Eventually, we have a shortest path problem that can be solved with Dijkstra’s algorithm. Two numerical examples are presented and the results are analyzed.

Keywords
common set of weights; data envelopment analysis; decision maker; multi-objective shortest path problem; weight restrictions

Hrčak ID: 212358

URI
https://hrcak.srce.hr/212358

Visits: 450 *