need code for IWD algorithm in java for my project. so plz help me

iwd algorithm in java

Intelligent Water Drops algorithm, or the IWD algorithm,[1] is a swarm-based nature-inspired optimization algorithm. This algorithm contains a few essential elements of natural water drops and actions and reactions that occur between river's bed and the water drops that flow within. The IWD algorithm may fall into the category of Swarm intelligence and Metaheuristic. Intrinsically, the IWD algorithm can be used for Combinatorial optimization. However, it may be adapted for continuous optimization too. The IWD was first introduced for the traveling salesman problem in 2007.[2] Since then, multitude of researchers have focused on improving the algorithm for different problems.

Introduction[edit]
Almost every IWD algorithm is composed of two parts: a graph that plays the role of distributed memory on which soils of different edges are preserved, and the moving part of the IWD algorithm, which is a few number of Intelligent water drops. These Intelligent Water Drops (IWDs) both compete and cooperate to find better solutions and by changing soils of the graph, the paths to better solutions become more reachable. It is mentioned that the IWD-based algorithms need at least two IWDs to work.

Pseudo-code[edit]
The IWD algorithm has two types of parameters: Static and Dynamic parameters. Static parameters are constant during the process of the IWD algorithm. Dynamic parameters are reinitialized after each iteration of the IWD algorithm. The pseudo-code of an IWD-based algorithm may be specified in eight steps:

1) Static parameter initialization
a) Problem representation in the form of a graph
b) Setting values for static parameters
2) Dynamic parameter initialization: soil and velocity of IWDs
3) Distribution of IWDs on the problem’s graph
4) Solution construction by IWDs along with soil and velocity updating
a) Local soil updating on the graph
b) Soil and velocity updating on the IWDs
5) Local search over each IWD’s solution (optional)
6) Global soil updating
7) Total-best solution updating
8) Go to step 2 unless termination condition is satisfied
Applications[edit]
Some of the researches performed with the IWD-based algorithms for different applications are given below:

Multidimensional Knapsack problem (MKP) [3]
Air Robot Path Planning [4]
Vehicle routing problem[5]
MANET Routing algorithm [6]
Economic Load Dispatch [7]
Travelling salesman problem (TSP) [8]
texture feature selection [9]
Automatic multilevel thresholding using a modified Otsu’s criterion [10]
Continuous optimization [11]
Job shop scheduling [12]
Steiner tree problem [13]
Maximum Clique problem [14]
Optimal data aggregation tree in wireless sensor networks [15]
Test data generation based on test path discovery [16]
Code coverage [17]
Optimization of manufacturing process models [18]
Optimizing routing protocol [19]
Rough set feature selection [20]

Description
This project deals with the Intelligent Water Drops algorithm or the IWD algorithm. The IWD algorithm is a population & nature-inspired combinatorial optimization algorithm. It tries to imitate the behavior that natural water drops conduct in river beds where they create complex paths that seem optimistic considering the environment, obstacles, and the surrounding terrain.
One way to use the IWD algorithm is to map our optimization problem into a graph over which Intelligent Water Drops (IWDs) travel from node to node to gradually create complete solutions. During this trip, the soli of the graph deposited on the links of the graph are changed and little by little the optimal paths will hold less soil in comparison to other possible paths.
It is also possible to solve continuous optimization problems by the IWD algorithm. One attempt is the IWD-CO (IWD for Continuous Optimization)
In this project, the focus is to gradually present implemented IWD-based algorithms.