A longest path algorithm is used to obtain bounding information for subproblems in a branch and bound solution procedure. Computational results are presented for several small to moderate size ...

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 ...