%0 Journal Article
%T A DEA-based Approach for Finding a Favorable Multi-objective Shortest Path
%A Ramezani-Tarkhorani
%A Somayeh
%A Shirdel
%A Gholam Hassan
%J -
%D 2018
%R 10.17535/crorr.2018.0012
%X 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
%K common set of weights
%K data envelopment analysis
%K decision maker
%K multi-objective shortest path problem
%K weight restrictions
%U https://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=310534