International Journal of Neutrosophic Science IJNS 2690-6805 2692-6148 10.54216/IJNS https://www.americaspg.com/journals/show/1694 2020 2020 Laboratory of Information Processing, Faculty of Science Ben M’Sik, University Hassan II, Casablanca, Morocco Said Broumi Department of Mathematics, C.V. Raman Global University, Bhubaneswar-752054, Odisha, India Prasanta Kumar Raut Department of Mathematics, C.V. Raman Global University, Bhubaneswar-752054, Odisha, India Siva Prasad Behera 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. 2023 2023 128 137 10.54216/IJNS.200410 https://www.americaspg.com/articleinfo/21/show/1694