Restricted-Access

 

 
       

 

MMGAs> Fitness sharing: Adaptive Niche Hierarchical Genetic Algorithm (ANHGA)

                                                                                                                                                                                                                                                                

 

Last update: 06/2011

 

 

     Parameters

 

 

Niche radius (σshare)

Replacement (β). According to the authors, β=0.75.

 

 

     Description

 

Fitness sharing method is applied but with a modified sharing function. In addition, it uses an adaptive mutation and a substitution system based on quality as well as proximity to other solutions, by gathering parent and children populations.

 

To do the selection, the original fitness sharing methods (without being continuously updated) will be used, but instead of using the sharing function to penalize the quality, the Ci(t) density function will be used as follows:

 

Once individuals are selected for reproduction the crossover and mutation operator starts, with the latter operator adaptive in accordance with the density of each individual. Thus, the higher the density function of individual i, the higher its probability should be to mutate in order to increase the diversifying power of the operator, but limiting its value to the range (0, 0.5) in order to ensure an appropriate convergence.

Lastly, the substitution is performed by combining parents and children populations, calculating the value of the adequate quality of each individual, and sorting the joint population from the highest to the lowest depending on this value, and selecting the best Ns. Replacement parameter β allows us to give more importance (weight) to quality or to density in the substitution.

The joint action of sharing and substitution firstly permits classifying the historical information of the search (parents) into niches, and secondly, transmitting it together with the new information created in the reproduction (children) to the subsequent iterations, regulating the transmission by quality and proximity.

 

This process is shown in the following flowchart:

 

 

 

 
 

     Executable

 

The following three files have to be in the same folder. Do not change the name of the file. Double-click the .exe file to run it.

 

 
  JSSP

Executable

exe

Data File

Open .txt file of the instance you want to run (for JSSP), copy and paste its contents inside this file.

D_Entrada

Parameters File

Open the file and change the parameters

D_Algoritmo

 

The following five files of solutions are generated:

D_Sal_Mejores-txt (includes the best solutions).

D_Sal_Optimos (includes the value of the objective function, i.e., Cmax).

D_Sal_NumOptimos (includes the number of different solutions where the optima value specified in the data file has been reached). This file is empty if this value is not reached.

D_Sal_Distancias (includes the distances between solutions where the optima value specified in the data file has been reached). This file is empty if either this value is not reached or only one solution is achieved.

D_Sal_Soluciones (includes the schedule of the solutions where the optima value specified in the data file has been reached). This file is empty if this value is not reached.

 

 

     References

 

Dunwei, G. Fengping, P. and Shifan, X. (2002). Adaptive niche hierarchy genetic algorithm. In Proc. of IEEE TENCON  39-42.

 

 

   

Universidad de Valladolid. Webmaster Marta Posada