Solving shortest path problems using an ant colony algorithm with triangular neutrosophic arc weights

Said Broumi^1,2, Prasanta Kumar Raut³, Siva Prasad Behera^3,*

¹Laboratory of Information Processing, Faculty of Science Ben M’Sik, University Hassan II, Casablanca,

Morocco

³Department of Mathematics, C.V. Raman Global University, Bhubaneswar-752054, Odisha, India

Emails: broumisaid78@gmail.com; prasantaraut95@gmail.com; sivaiitkgp12@gmail.com

Abstract

Indeed, one of the most well-known topics in the area of graph theory is the shortest path (SP) problem, which has practical applications in various areas of research, including transportation, communication via networks, life-saving services, fire department services, etc. The edges of the connected SP problems are typically characterized by various numbers in practical applications. In this research paper, we calculate the shortest path using an ant colony optimization (ACO) algorithm with single value triangular neutrosophic numbers as arc weights. The method is used to estimate the shortest path of a neutrosophic network. One numerical example is used to test the suggested method, and outcomes are provided.

Keywords: Ant colony optimization; Neutrosophic shortest path problem; Neutrosophic directed graph; Single value triangular neutrosophic numbers; Neutrosophic network.