DSpace Repository

An Efficient Multiple Sources Single Destination (MSSD) Heuristic Algorithm Using Nodes Exclusions

Show simple item record

dc.contributor.author Khamayseh, Faisal
dc.contributor.author Arman, Nabil
dc.date.accessioned 2017-01-18T08:21:43Z
dc.date.accessioned 2022-05-22T08:26:40Z
dc.date.available 2017-01-18T08:21:43Z
dc.date.available 2022-05-22T08:26:40Z
dc.date.issued 2015-01-01
dc.identifier.citation International Journal of Soft Computing 10(3) · January 2015 en_US
dc.identifier.issn 301306
dc.identifier.uri http://localhost:8080/xmlui/handle/123456789/7778
dc.description.abstract The problem of identifying the best paths between given set of nodes and a given single-destination in a graph of vertices is commonly referred to as network multiple sources single-destination problems. In real life researchers always find themselves in a critical situation that researchers seek the nearest set of related points such as the urgent need for fire stations. This study describes, the problem and proposes an algorithm for finding the shortest paths between the set of sources <si> and a single-destination <t> given that <si> and <t> ∈ weighted graph G(V, E, w) with vertex set V and arc set E associated with non-negative real valued weight. An efficient algorithm is developed based on different graph representations. The proposed heuristic determines a candidate subgraph G' and excludes all nodes that do not lead to destination. The proposed algorithm improves partially the performance of improved traditional shortest path algorithms, i.e., Dijkstra's algorithm. This is shown obviously by applying the algorithm on set of random graphs. en_US
dc.description.sponsorship This research is funded by "The Scientific Research Council", Ministry of Education and Higher Education, State of Palestine under a project number of 01/12/2013 and Palestine Polytechnic University en_US
dc.language.iso en_US en_US
dc.publisher International Journal of Soft Computing 10(3) en_US
dc.relation.ispartofseries 301306;
dc.subject Shortest path, communication network, graph, multiple sources single-destination, candidate subgraphs, node exclusions en_US
dc.title An Efficient Multiple Sources Single Destination (MSSD) Heuristic Algorithm Using Nodes Exclusions en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


My Account