This paper considers a stochastic shortest path problem where the arc lengths are independent random variables following a normal distribution. In this problem, the optimal path is one that maximizes ...

The Ant Colony Optimization (ACO) algorithm is a metaheuristic nature-inspired technique for solving various combinatorial optimization problems. The shortest-path problem is an important ...

Wiener index: A distance-based index determined by summing the shortest path lengths between all pairs of vertices in a molecular graph.