TY  - JOUR
T1  - Bactria Foraging Optimization Algorithm with Hybrid Immigrants for Dynamic Shortest Path Routing Problem in Mobile Ad hoc Network
AU - Mangaiarkarasi, S. AU - Karnan, M. 
JO  - Asian Journal of Information Technology
VL  - 13
IS  - 4
SP  - 207
EP  - 214
PY  - 2014
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2014.207.214
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2014.207.214
KW  - MANET
KW  -BFOA
KW  -immigrants schemes
KW  -dynamic optimization problem
KW  -merits
AB  - In internet computing, swarm intelligence has shown growing 
  interest in study dynamic optimization problems. Many approaches are developed 
  for SI to enhance the diversity of the population and improve the performance 
  of the algorithm for DOPs. Out of these approaches, immigrants schemes are found 
  useful for SIs in DOPs. In this study, random, elitism based and hybrid based 
  immigrants schemes are applied to Bacteria Foraging Optimization Algorithm (BFOA) 
  for the Dynamic Shortest Path Routing Problem (DSPRP). The simulation results 
  show that random immigrants are useful for BFOA in quick changing environments, 
  whereas elitism-based immigrants are useful for BFOA in gradually ever changing 
  environments. The BFOA algorithm with a hybrid based immigrants scheme combines 
  the merits of the random and elitism immigrants schemes. Moreover, the simulation 
  results show that the proposed algorithms outperform in almost all dynamic test 
  cases and immigrant based BFOA schemes enhance the performance efficiently in 
  DSPRP.
ER  -