Improved intelligent water drops algorithm using adaptive schema

Authors:
Mohammed M. Msallam;Mohammad Hamdan
Affiliations:
Computer Sciences Department, Faculty of Applied Science, Al-aqsa University, Gaza, Palestine.;Computer Sciences Department, Faculty of Information Technology and Computer Science, Yarmouk University, Irbid, Jordan
Venue:
International Journal of Bio-Inspired Computation
Year:
2011

Citing 6
Cited 1

Ant Colony Optimization

Ant Colony Optimization
Improved Ant Colony Algorithm and its Applications in TSP

ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 02
A Bee Colony Optimization Algorithm for Traveling Salesman Problem

AMS '08 Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS)
An Improved Discrete Particle Swarm Optimization Based on Cooperative Swarms

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm

International Journal of Bio-Inspired Computation
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

A New Image Registration Technique with Free Boundary Constraints: Application to Mammography

ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

Intelligent water drops (IWD) algorithm is a new meta-heuristic approach belonging to a class of swarm intelligence-based algorithms. It is inspired from observing processes of natural water swarm that happen in the natural river systems. This paper presents an improved IWD algorithm based on developing an adaptive schema to prevent the IWD algorithm from premature convergence. The performance of the adaptive IWD is compared with original IWD and other meta-heuristic algorithms in solving travelling salesman problem (TSP). The results clearly show that the proposed algorithm has better performance than those of original IWD, and MIWD-TSP algorithm and very competitive results to others meta-heuristics.