The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling salesman problem the distances between cities as travel times are no longer fixed.
Aug 24, 2012
A new parallel computing technique based on ant colony optimization for a dynamic routing problem for the dynamic traveling salesman problem, ...
The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. Ant Colony Optimization is a ...
$37.50
Abstract. The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem.
for the Dynamic Traveling Salesman Problem. (DTSP) is introduced in the current paper. Parallel ACO with a Ring. Neighborhood for Dynamic TSP. Camelia M ...
Oct 1, 2012 · The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem.
The new technique uses a parallel model for a problem variant that allows a slight movement of nodes within their neighborhoods. The algorithm is tested with ...
The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. Ant Colony Optimization is a ...
The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. Ant Colony Optimization is a ...
The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling ...