In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...