% This file was created with JabRef 2.6.
% Encoding: ISO8859_1

@ARTICLE{Trojanowski2009,
  author = {Krzysztof Trojanowski and Slawomir T. Wierzchon},
  title = {Immune-based algorithms for dynamic optimization},
  journal = {Information Sciences},
  year = {2009},
  volume = {179},
  pages = {1495-1515},
  number = {10},
  note = {Including Special Issue on Artificial Imune Systems},
  abstract = {The main problem with biologically inspired algorithms (like evolutionary
	algorithms or particle swarm optimization) when applied to dynamic
	optimization is to force their readiness for continuous search for
	new optima occurring in changing locations. Immune-based algorithm,
	being an instance of an algorithm that adapt by innovation seem to
	be a perfect candidate for continuous exploration of a search space.
	In this paper we describe various implementations of the immune principles
	and we compare these instantiations on complex environments.},
  doi = {10.1016/j.ins.2008.11.014},
  issn = {0020-0255},
  keywords = {Clonal selection, Dynamic optimization, Heuristic optimization},
  url = {http://www.sciencedirect.com/science/article/B6V0C-4V0MTC3-1/2/a4983e87c4869c794f830d5bf53fe246}
}

@ARTICLE{Yang2010,
  author = {Shengxiang Yang and Cheng, Hui and Wang, Fang},
  title = {Genetic Algorithms With Immigrants and Memory Schemes for Dynamic
	Shortest Path Routing Problems in Mobile Ad Hoc Networks},
  journal = {Systems, Man, and Cybernetics, Part C: Applications and Reviews,
	IEEE Transactions on},
  year = {2010},
  volume = {40},
  pages = {52-63},
  number = {99},
  abstract = {In recent years, the static shortest path (SP) problem has been well
	addressed using intelligent optimization techniques, e.g., artificial
	neural networks, genetic algorithms (GAs), particle swarm optimization,
	etc. However, with the advancement in wireless communications, more
	and more mobile wireless networks appear, e.g., mobile networks [mobile
	ad hoc networks (MANETs)], wireless sensor networks, etc. One of
	the most important characteristics in mobile wireless networks is
	the topology dynamics, i.e., the network topology changes over time
	due to energy conservation or node mobility. Therefore, the SP routing
	problem in MANETs turns out to be a dynamic optimization problem.
	In this paper, we propose to use GAs with immigrants and memory schemes
	to solve the dynamic SP routing problem in MANETs. We consider MANETs
	as target systems because they represent new-generation wireless
	networks. The experimental results show that these immigrants and
	memory-based GAs can quickly adapt to environmental changes (i.e.,
	the network topology changes) and produce high-quality solutions
	after each change.},
  doi = {10.1109/TSMCC.2009.2023676},
  issn = {1094-6977},
  keywords = {ad hoc networks, artificial neural networks, dynamic optimization
	problem, dynamic shortest path routing problem, Genetic algorithms,
	intelligent optimization technique, mobile ad hoc networks, mobile
	radio, mobile wireless networks, Particle swarm optimization, SP
	routing problem, telecommunication network routing, telecommunication
	network topologyMANET, topology dynamics, wireless communication,
	wireless sensor networks},
  url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=05159436}
}