Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria
People faced decision making in choosing a suitable path for their own preferences. Usually, more than one criterion is involved in order to match with the preferences of the decision makers. The main objective of this paper was to identify the best path selection based on multiple criteria instead...
Päätekijät: | Ting, Kien Hua, Noraini Abdullah |
---|---|
Aineistotyyppi: | Artikkeli |
Kieli: | English |
Julkaistu: |
2018
|
Aiheet: | |
Linkit: | https://eprints.ums.edu.my/id/eprint/24374/2/Weighted%20Sum-Dijkstra%E2%80%99s%20Algorithm%20in%20Best%20Path%20Identification%20based%20on%20Multiple%20Criteria.pdf |
Samankaltaisia teoksia
-
Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions
Tekijä: Ting Kien Hua, et al.
Julkaistu: (2020) -
Performance Analysis of Dijkstra-Based Weighted Sum Minimization Routing Algorithm for Wireless Mesh Networks
Tekijä: Nuha A. S. Alwan
Julkaistu: (2014-01-01) -
An adaptive distributed Dijkstra shortest path algorithm
Julkaistu: (2003) -
Implementation of Dijkstra's shortest path algorithm for vehicle routing
Tekijä: Pang, Jacquelyn Jiaqi
Julkaistu: (2017) -
Analysis of Dijkstra’s and A* algorithm to find the shortest path
Tekijä: Alija, Amani Saleh
Julkaistu: (2015)