A Concentration-based Artificial Immune Network for Combinatorial Optimization   [AI] [AIN] [IN] [CO]

by

Coelho, G., Franca, F., D. and Zuben, F., J., V.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Proceedings of the 2011 IEEE Congress on Evolutionary Computation (Conference proceedings), 2011, p. 1247-1254
Keywords:Artificial immune systems, Discrete, combinatorial optimization.
Abstract:
Diversity maintenance [DM] is an important aspect in population-based metaheuristics [PM] for optimization, as it tends to allow a better exploration of the search space, [SS] thus reducing the susceptibility to local optima [LO] in multimodal optimization problems. [MO] [OP] In this context, metaheuristics based on the Artificial Immune System (AIS) framework, [AI] [AIS] [IS] especially those inspired by the Immune Network theory, [IN] are known to be capable of stimulating the generation of diverse sets of solutions for a given problem, even though generally implementing very simple mechanisms to control the dynamics of the network. To increase such diversity maintenance capability even [DM] further, a new immune-inspired algorithm was recently proposed, which adopted a novel concentration-based model of immune network. [IN] This new algorithm, named cob-aiNet (Concentration-based Artificial Immune Network), [AI] [AIN] [IN] was originally developed to solve real-parameter single-objective optimization problems, [OP] and it was later extended (with cob-aiNet[MO]) to deal with real- parameter multi-objective optimization. Given [RP] [MO] that both cob-aiNet and cob- aiNet[MO] obtained competitive results when compared to state-of-the-art algorithms for continuous optimization and also presented significantly improved diversity maintenance mechanisms, [DM] in this work the same concentration-based paradigm was further explored, in an extension of such algorithms to deal with single-objective combinatorial optimization problems. [CO] [OP] This new algorithm, named cob-aiNet[C], was evaluated here in a series of experiments based on four Traveling Salesman Problems [TS] (TSPs), in which it was verified not only the diversity maintenance [DM] capabilities of the algorithm, but also its overall optimization performance.
Notes:
CEC2011 sponsored by the IEEE Computational Intelligence Society, and previously sponsored by the EPS and the IET.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InProceedings{Coelho:2011:ACAINfCO,
  title     = {A Concentration-based Artificial Immune Network for Combinatorial Optimization},
  author    = {Guilherme Coelho and Fabricio {de Franca} and Fernando J. {Von Zuben}},
  pages     = {1247--1254},
  booktitle = {Proceedings of the 2011 IEEE Congress on Evolutionary Computation},
  year      = {2011},
  editor = "Alice E. Smith",
  month     = {5-8 June},
  address   = {New Orleans, USA},
  organization ="IEEE Computational Intelligence Society",
  publisher = "IEEE Press",
  ISBN      = {0-7803-8515-2},
  keywords  = {Artificial immune systems, Discrete and combinatorial optimization.},
  abstract  = {
Diversity maintenance is an important aspect in population-based
metaheuristics for optimization, as it tends to allow a better exploration of
the search space, thus reducing the susceptibility to local optima in
multimodal optimization problems. In this context, metaheuristics based on the
Artificial Immune System (AIS) framework, especially those inspired by the
Immune Network theory, are known to be capable of stimulating the generation
of diverse sets of solutions for a given problem, even though generally
implementing very simple mechanisms to control the dynamics of the network. To
increase such diversity maintenance capability even further, a new
immune-inspired algorithm was recently proposed, which adopted a novel
concentration-based model of immune network. This new algorithm, named
cob-aiNet (Concentration-based Artificial Immune Network), was originally
developed to solve real-parameter single-objective optimization problems, and
it was later extended (with cob-aiNet[MO]) to deal with real- parameter
multi-objective optimization. Given that both cob-aiNet and cob- aiNet[MO]
obtained competitive results when compared to state-of-the-art algorithms for
continuous optimization and also presented significantly improved diversity
maintenance mechanisms, in this work the same concentration-based paradigm was
further explored, in an extension of such algorithms to deal with
single-objective combinatorial optimization problems. This new algorithm,
named cob-aiNet[C], was evaluated here in a series of experiments based on
four Traveling Salesman Problems (TSPs), in which it was verified not only the
diversity maintenance capabilities of the algorithm, but also its overall
optimization performance.
},
  notes =	{CEC2011 sponsored by the IEEE Computational Intelligence Society, and previously sponsored by the EPS and the IET. },
}