Izvorni znanstveni članak
https://doi.org/10.17535/crorr.2018.0012
A DEA-based Approach for Finding a Favorable Multi-objective Shortest Path
Gholam Hassan Shirdel
orcid.org/0000-0003-2759-4606
; Faculty of Science, University of Qom, Iran
Somayeh Ramezani-Tarkhorani
; Faculty of Science, University of Qom, Iran
Sažetak
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.
Ključne riječi
common set of weights; data envelopment analysis; decision maker; multi-objective shortest path problem; weight restrictions
Hrčak ID:
212358
URI
Datum izdavanja:
13.12.2018.
Posjeta: 949 *