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.

No abstract

No abstract

No abstract

The time adaptive self-organizing map (TASOM) network is a modified self-organizing map (SOM) network with adaptive learning rates and neighborhood sizes as its learning parameters. Every neuron in the TASOM has its own learning rate and neighborhood size. For each new input vector, the neighborhood size and learning rate of the winning neuron and the learning rates of its neighboring neurons are updated. A scaling vector is also employed in the TASOM algorithm for compensation against scaling transformations. Analysis of the updating rules of the algorithm reveals that the learning parameters may increase or decrease for adaptation to a changing environment, such that the minimum increase or decrease is achieved according to a specific measure. Several versions of the TASOM-based networks are proposed in this paper for different applications, including bilevel thresholding of grey level images, tracking of moving objects and their boundaries, and adaptive clustering. Simulation results show satisfactory performance of the proposed methods in the implemented applications.