Authors: Hamed Shah-Hosseini
Addresses: Faculty of Electrical and Computer Engineering, Shahid Beheshti University, G.C., Tehran, Iran
Abstract: A natural river often finds good paths among lots of possible paths in its ways from the source to destination. These near optimal or optimal paths are obtained by the actions and reactions that occur among the water drops and the water drops with the riverbeds. The intelligent water drops (IWD) algorithm is a new swarm-based optimisation algorithm inspired from observing natural water drops that flow in rivers. In this paper, the IWD algorithm is tested to find solutions of the n-queen puzzle with a simple local heuristic. The travelling salesman problem (TSP) is also solved with a modified IWD algorithm. Moreover, the IWD algorithm is tested with some more multiple knapsack problems (MKP) in which near-optimal or optimal solutions are obtained.
Keywords: swarm intelligence; intelligent water drops; modified IWD; travelling salesman problem; TSP; multiple knapsack problem; MKP; n-queen puzzle; bio-inspired computation; swarm-based optimisation.
International Journal of Bio-Inspired Computation, 2009 Vol.1 No.1/2, pp.71 - 79
Published online: 26 Jan 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article