The combination of TOPSIS method and Dijkstra’s algorithm in multi-attribute routing

  title={The combination of TOPSIS method and Dijkstra’s algorithm in multi-attribute routing},
  author={Emad Roghanian and Zohreh Shakeri Kebria},
  journal={Scientia Iranica},
This paper introduces a new method called multi-attribute Dijkstra that is an extension of  Dijkstra to determine the shortest path between two points of a graph while arcs between points, in addition to the distance, have other attributes such as time(distance), cost, emissions, risk and etc. Technique for order preferences by similarity to ideal (TOPSIS) method is used for ranking and selection of the routes which is a method for solving multi-attribute decision making problems (MADM). In… 

Figures and Tables from this paper

Weighted Sum-Dijkstra's Algorithm in Best Path Identification based on Multiple Criteria
  • Ting Hua, N. Abdullah
  • Computer Science
    Journal of Computer Science & Computational Mathematics
  • 2018
Results show that WSDA performed better in terms of the criteria concerned as it was compared to the Dijkstra’s algorithm, and can be user friendly to users from non-mathematical background.
Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions
Weighted Product-Dijkstra’s Algorithm (WPD A) was introduced in this paper for optimal path identification with involvement of multiple criteria in choosing the best path within a network based on multiple criteria.
A bi objective dynamic reliable hub location problem with congestion effects
This study solves a new model of hub locating with respect to the reliability and importance of flow congestion on hub nodes in a dynamic environment and obtains the optimal boundary by using εconstraint method.
Experiment Study of Rapid Laser Polishing of Freeform Steel Surface by Dual-Beam
One of the challenges regarding widespread use of parts made from alloy steel is their time-consuming polishing process. A rough freeform surface of part has been often expected to be polished
Multi-Objective Simulation Optimization Integrated With Analytic Hierarchy Process and Technique for Order Preference by Similarity to Ideal Solution for Pollution Routing Problem
  • A. Boru İpek
  • Business
    Transportation Research Record: Journal of the Transportation Research Board
  • 2022
Routing is one of the most important components of logistics and has a vital role in economic growth. Inefficient routing has also contributed to troubling pollutants that have adverse environmental
Uptake and Dissemination of Multi-Criteria Decision Support Methods in Civil Engineering—Lessons from the Literature
  • M. Bruen
  • Computer Science
    Applied Sciences
  • 2021
Analysis of the papers in this area indicated that the full range of supporting software available for multi-criteria decision analysis may not be fully appreciated by potential users.


An improved label heuristic algorithm for multi-attribute vehicle routing problem
In this paper, we propose a new algorithm Label based Ant Colony System (LACS) based on the multi-attribute label (MAL) algorithm and multi ant colony system (MACS) algorithm to address the
Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment
This paper aims to study the split load vehicle routing problem in order to find a solution which would decrease logistics’ cost by implementing simultaneous delivery and pickup which is part of the
Integration of a robust shortest path algorithm with a time dependent vehicle routing model and applications
A way of combining two techniques, based on the ant colony system (ACS) and the robust shortest path (RPS), in order to define a framework that can deal with the following problem: find an optimized set of routes when the customers set is a proper subset of an entire network, and variable traffic conditions have to be taken into account.
Extensions of the TOPSIS for group decision-making under fuzzy environment
Finding shortest paths on real road networks: the case for A*
It is shown that the most efficient state‐of‐the‐art implementations of Dijkstra can be improved by taking advantage of network properties associated with GIS‐sourced data.