New robust and efficient ant colony algorithms: Using new interpretation of local updating process

Authors:
Hossein Miar Naimi;Nima Taherinejad
Affiliations:
Electrical Engineering Faculty-University of Mazandaran, Dr. Shariati Street, Babol, Iran;Electrical Engineering Faculty-University of Mazandaran, Dr. Shariati Street, Babol, Iran
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 2
Cited 7

A Study of Some Properties of Ant-Q

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
The traveling salesman: computational solutions for TSP applications

The traveling salesman: computational solutions for TSP applications

Population declining ant colony optimization algorithm and its applications

Expert Systems with Applications: An International Journal
Analysis of the efficacy of a Two-Stage methodology for ant colony optimization: Case of study with TSP and QAP

Expert Systems with Applications: An International Journal
Ant colony optimization algorithm with mutation mechanism and its applications

Expert Systems with Applications: An International Journal
Parallelized genetic ant colony systems for solving the traveling salesman problem

Expert Systems with Applications: An International Journal
An ant colony optimization algorithm for setup coordination in a two-stage production system

Applied Soft Computing
A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems

Expert Systems with Applications: An International Journal
Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.06

Visualization

Abstract

Two new efficient and robust ant colony algorithms are proposed. These algorithms contain two new and reasonable local updating rules that make them more efficient and robust. While going forward from start point to end point of a tour, the ants' freedom to make local changes on links is gradually restricted. This idea is implemented in two different forms, leaving two new algorithms, KCC-Ants and ELU-Ants. To evaluate the new algorithms, we run them along with the old one on the standard TSP library, where in almost all of the cases the proposed algorithms had better solutions and even for some problem samples found the optimal solution.