Page 4 - POSTER FYP MAC-OGOS 2025

K242/04

SITI AISHAH BINTI MOHD BAHARUDIN (2022862746)

SUPERVISOR : DR. SITI NURUL FITRIAH BINTI MOHAMAD

FLOYD-WARSHALL ALGORITHM BASED ON NEUTROSOPHIC

SET FOR ROUTING NETWORK PROBLEM

ABSTRACT METHODOLOGY IMPLEMENTATION

The classical Floyd-Warshall algorithm

efficiently solves All-Pairs Shortest Path

(APSP) problems. However, it struggles in

uncertain environments. This study

introduces a modified version using

Single-Valued Neutrosophic Sets to handle

uncertainty and multi-criteria inputs. The

new SVNFW algorithm shows robust and

flexible performance in complex routing

network scenarios, making it well-suited

for real-world dynamic systems.

PROBLEM STATEMENT

Classical algorithms like Floyd-

Warshall rely on precise inputs.

Real-world networks (e.g., traffic,

communication) involve uncertain,

vague, or inconsistent data.

Single-valued neutrosophic sets

(SVNS) can better represent ambiguity STEP 1 : Convert network edge weights

but are underutilized in routing into SVNN. Peng and Dai (2018)

algorithms.

There's a need for a hybrid method

that handles multiple criteria and

uncertainty simultaneously.

OBJECTIVES

1.To propose the concept of a matrix for Use a score function to quantify SVNN into

the shortest path problem (SPP) a usable scalar for calculations. (Ye, 2013)

FloydWarshall algorithm with a single-

valued neutrosophic set, namely as the

SVNFW algorithm. STEP 2 : Matrix Initialization

2.To apply the proposed method to solve

routing network problems

RESULTS & DISCUSSION

STEP 3 : Shortest Path Calculation

STEP 4 : SELECT THE FINAL PATH

CONCLUSION

This research introduces the SVNFW

algorithm, a hybrid method combining RECOMMENDATIONS

Floyd-Warshall and Single-Valued

Neutrosophic Sets (SVNS) to model Future research should explore the

uncertainty in routing networks. application of the SVNFW algorithm in

The algorithm addresses limitations of dynamic networks that require real-time

classical methods by incorporating truth, adaptability.

indeterminacy, and falsity, enabling more The algorithm could be improved by

realistic and flexible decision-making. integrating live data sources, such as GPS

It effectively handles multiple routing or sensor inputs, to enhance accuracy and

parameters such as length, bandwidth, responsiveness.

delay, cost, MTU, throughput, hop count, There is a need to optimize the algorithm

load, and reliability. for large-scale networks to manage

A practical implementation on a sample increasing computational demands

network demonstrates the step-by-step effectively.

application and confirms its capability to Benchmarking against other uncertainty-

produce optimal paths under uncertainty. handling frameworks (e.g., rough sets,

This work expands the field of neutrosophic bipolar-valued neutrosophic sets) can

graph theory and provides a foundation for provide deeper insights into performance.

future development in uncertainty-aware Developing a software tool or web-based

optimization for real-world networks. platform for the SVNFW algorithm would

increase its accessibility and usability for

real-world applications