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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
