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...

Full description

Bibliographic Details
Main Authors: Ting, Kien Hua, Noraini Abdullah
Format: Article
Language:English
Published: 2018
Subjects:
Online Access: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
_version_ 1796910263917608960
author Ting, Kien Hua
Noraini Abdullah
author_facet Ting, Kien Hua
Noraini Abdullah
author_sort Ting, Kien Hua
collection UMS
description 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 of a single criterion. Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. Weighted Sum Method (WSM) is one of the weighting methods to solve the multi criteria decision making problems (MCDM). In order to achieve the objective, Weighted Sum-Dijkstra’s Algorithm (WSDA), a combination method between WSM and Dijkstra’s Algorithm is applied to solve multiple criteria network problems. In this paper, Dijkstra’s Algorithm and WSM are reviewed and compared as to the WSDA. In addition, two examples with equal criteria values to evaluate the performances of the approach are presented. Results show that WSDA performed better in terms of the criteria concerned as it was compared to the Dijkstra’s algorithm. Moreover, the results could be directly found without considering all the alternative paths of the problem. WSDA can be user friendly to users from non-mathematical background. It is not only applicable to urban road problems, but other network problems such as pipelines and bandwidth network problems. When come to large scale data problems, Maple software is used to solve it with ease.
first_indexed 2024-03-06T03:01:53Z
format Article
id ums.eprints-24374
institution Universiti Malaysia Sabah
language English
last_indexed 2024-03-06T03:01:53Z
publishDate 2018
record_format dspace
spelling ums.eprints-243742019-12-18T08:09:01Z https://eprints.ums.edu.my/id/eprint/24374/ Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria Ting, Kien Hua Noraini Abdullah Q Science (General) 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 of a single criterion. Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. Weighted Sum Method (WSM) is one of the weighting methods to solve the multi criteria decision making problems (MCDM). In order to achieve the objective, Weighted Sum-Dijkstra’s Algorithm (WSDA), a combination method between WSM and Dijkstra’s Algorithm is applied to solve multiple criteria network problems. In this paper, Dijkstra’s Algorithm and WSM are reviewed and compared as to the WSDA. In addition, two examples with equal criteria values to evaluate the performances of the approach are presented. Results show that WSDA performed better in terms of the criteria concerned as it was compared to the Dijkstra’s algorithm. Moreover, the results could be directly found without considering all the alternative paths of the problem. WSDA can be user friendly to users from non-mathematical background. It is not only applicable to urban road problems, but other network problems such as pipelines and bandwidth network problems. When come to large scale data problems, Maple software is used to solve it with ease. 2018-12-03 Article PeerReviewed text en 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 Ting, Kien Hua and Noraini Abdullah (2018) Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria. Journal of Computer Science & Computational Mathematics, 8 (3). pp. 107-113. http://DOI: 10.20967/jcscm.2018.04.008
spellingShingle Q Science (General)
Ting, Kien Hua
Noraini Abdullah
Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria
title Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria
title_full Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria
title_fullStr Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria
title_full_unstemmed Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria
title_short Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria
title_sort weighted sum dijkstra s algorithm in best path identification based on multiple criteria
topic Q Science (General)
url 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
work_keys_str_mv AT tingkienhua weightedsumdijkstrasalgorithminbestpathidentificationbasedonmultiplecriteria
AT norainiabdullah weightedsumdijkstrasalgorithminbestpathidentificationbasedonmultiplecriteria