Abstract. This paper introduces a new method called multi-attribute Dijkstra that is an extension of Dijkstra used to determine the shortest path between two points of a graph while arcs between the points, in addition to the distance, have other attributes such as time (distance), cost, emissions, risk, etc. Technique for order preferences by similarity to the ideal (TOPSIS) method is used for ranking and selecting the routes which is a method for solving Multi-Attribute Decision-Making problems (MADM). In this regard, we try to choose appropriate weights for the attributes to consider the right decision for creating a balance between the e ective elements in route selection. In this paper, the algorithm of Dijkstra and TOPSIS will be reviewed, and the proposed method obtained by the combination of these two will also be described. Finally, three examples with di erent conditions are presented to represent the performance of the model. Then, these examples are compared with single-attribute Dijkstra to realize the e ectiveness of the proposed method. Obviously, in solving large-scale examples, the approach is based on coding in appropriate software.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.