-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.bbl
271 lines (227 loc) · 12.5 KB
/
main.bbl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
\setlength{\labelsep}{0pt}\begin{thebibliography}{}
\providecommand{\abntrefinfo}[3]{}
\providecommand{\abntbstabout}[1]{}
\abntbstabout{1.29 }
\bibitem[Andr{\'e} e Stubs~Parpinelli 2015]{andre2015multiple}
\abntrefinfo{Andr{\'e} e Stubs~Parpinelli}{ANDR{\'E}; STUBS~PARPINELLI}{2015}
{ANDR{\'E}, L.; STUBS~PARPINELLI, R. The multiple knapsack problem approached
by a binary differential evolution algorithm with adaptive parameters.
\emph{ Polibits}, Instituto Polit{\'e}cnico Nacional, Centro de Innovaci{\'o}n
y Desarrollo Tecnol{\'o}gico en C{\'o}mputo, n.~51, p. 47--54, 2015.}
\bibitem[Bellman e Dreyfus 2015]{bellman2015applied}
\abntrefinfo{Bellman e Dreyfus}{BELLMAN; DREYFUS}{2015}
{BELLMAN, R.~E.; DREYFUS, S.~E. \emph{ Applied dynamic programming}. :
Princeton university press, 2015. 200--206~p.}
\bibitem[Booker, Goldberg e Holland 1989]{ga}
\abntrefinfo{Booker, Goldberg e Holland}{BOOKER; GOLDBERG; HOLLAND}{1989}
{BOOKER, L.~B.; GOLDBERG, D.~E.; HOLLAND, J.~H. Classifier systems and genetic
algorithms.
\emph{ Artificial intelligence}, Elsevier, v.~40, n.~1, p. 235--282, 1989.}
\bibitem[Boussa{\"\i}d, Lepagnot e Siarry 2013]{boussaid2013survey}
\abntrefinfo{Boussa{\"\i}d, Lepagnot e Siarry}{BOUSSA{\"I}D; LEPAGNOT;
SIARRY}{2013}
{BOUSSA{\"I}D, I.; LEPAGNOT, J.; SIARRY, P. A survey on optimization
metaheuristics.
\emph{ Information Sciences}, Elsevier, v. 237, p. 82--117, 2013.}
\bibitem[Branke 1999]{moving_peak_1999}
\abntrefinfo{Branke}{BRANKE}{1999}
{BRANKE, J. Memory enhanced evolutionary algorithms for changing optimization
problems. In: CITESEER. \emph{ In Congress on Evolutionary Computation
CEC99}. 1999.}
\bibitem[Branke 2012]{branke2012evolutionary}
\abntrefinfo{Branke}{BRANKE}{2012}
{BRANKE, J. \emph{ Evolutionary optimization in dynamic environments}. :
Springer Science \& Business Media, 2012.}
\bibitem[Branke e Schmeck 2003]{offlineError}
\abntrefinfo{Branke e Schmeck}{BRANKE; SCHMECK}{2003}
{BRANKE, J.; SCHMECK, H. Designing evolutionary algorithms for dynamic
optimization problems.
\emph{ Advances in evolutionary computing}, Springer, p. 239--262, 2003.}
\bibitem[Carlisle 2002]{carlisle2002applying}
\abntrefinfo{Carlisle}{CARLISLE}{2002}
{CARLISLE, A.~J. \emph{ Applying the particle swarm optimizer to non-stationary
environments}. : Auburn University, 2002.}
\bibitem[Carmelo~Filho 2008]{carmelo2008novel}
\abntrefinfo{Carmelo~Filho}{CARMELO~FILHO}{2008}
{CARMELO~FILHO, J. et al. A novel search algorithm based on fish school
behavior. In: IEEE. \emph{ Systems, Man and Cybernetics, 2008. SMC 2008.
IEEE International Conference on}. 2008. p. 2646--2651.}
\bibitem[Carvalho e Jos{\'e} Albanez Bastos-Filho 2009]{ferreira2009clan}
\abntrefinfo{Carvalho e Jos{\'e} Albanez Bastos-Filho}{CARVALHO; JOS{\'E}
ALBANEZ BASTOS-FILHO}{2009}
{CARVALHO, D. Ferreira~de; JOS{\'E} ALBANEZ BASTOS-FILHO, C. Clan particle
swarm optimization.
\emph{ International Journal of Intelligent Computing and Cybernetics}, Emerald
Group Publishing Limited, v.~2, n.~2, p. 197--227, 2009.}
\bibitem[Castro 2007]{de2007fundamentals}
\abntrefinfo{Castro}{CASTRO}{2007}
{CASTRO, L.~N. de. Fundamentals of natural computing: an overview.
\emph{ Physics of Life Reviews}, Elsevier, v.~4, n.~1, p. 1--36, 2007.}
\bibitem[Cavalcanti-J{\'u}nior 2011]{cavalcanti2011hybrid}
\abntrefinfo{Cavalcanti-J{\'u}nior}{CAVALCANTI-J{\'U}NIOR}{2011}
{CAVALCANTI-J{\'U}NIOR, G.~M. et al. A hybrid algorithm based on fish school
search and particle swarm optimization for dynamic problems. In: \emph{
Advances in Swarm Intelligence}. : Springer, 2011. p. 543--552.}
\bibitem[Corriveau 2012]{genotypic}
\abntrefinfo{Corriveau}{CORRIVEAU}{2012}
{CORRIVEAU, G. et al. Review and study of genotypic diversity measures for
real-coded representations.
\emph{ Evolutionary Computation, IEEE Transactions on}, IEEE, v.~16, n.~5, p.
695--710, 2012.}
\bibitem[Corriveau 2013]{phenotypic}
\abntrefinfo{Corriveau}{CORRIVEAU}{2013}
{CORRIVEAU, G. et al. Review of phenotypic diversity formulations for
diagnostic tool.
\emph{ Applied Soft Computing}, Elsevier, v.~13, n.~1, p. 9--26, 2013.}
\bibitem[{\v{C}}repin{\v{s}}ek, Liu e Mernik 2013]{vcrepinvsek2013exploration}
\abntrefinfo{{\v{C}}repin{\v{s}}ek, Liu e Mernik}{{\v{C}}REPIN{\v{S}}EK; LIU;
MERNIK}{2013}
{{\v{C}}REPIN{\v{S}}EK, M.; LIU, S.-H.; MERNIK, M. Exploration and exploitation
in evolutionary algorithms: a survey.
\emph{ ACM Computing Surveys (CSUR)}, ACM, v.~45, n.~3, p.~35, 2013.}
\bibitem[Cruz, Gonz{\'a}lez e Pelta 2011]{cruz2011optimization}
\abntrefinfo{Cruz, Gonz{\'a}lez e Pelta}{CRUZ; GONZ{\'A}LEZ; PELTA}{2011}
{CRUZ, C.; GONZ{\'A}LEZ, J.~R.; PELTA, D.~A. Optimization in dynamic
environments: a survey on problems, methods and measures.
\emph{ Soft Computing}, Springer, v.~15, n.~7, p. 1427--1448, 2011.}
\bibitem[De~Jong 1975]{crowding}
\abntrefinfo{De~Jong}{DE~JONG}{1975}
{DE~JONG, K.~A. Analysis of the behavior of a class of genetic adaptive
systems.
1975.}
\bibitem[Eberhart, Kennedy et al. 1995]{pso}
\abntrefinfo{Eberhart, Kennedy et al.}{EBERHART; KENNEDY et al.}{1995}
{EBERHART, R.~C.; KENNEDY, J. et al. A new optimizer using particle swarm
theory. In: NEW YORK, NY. \emph{ Proceedings of the sixth international
symposium on micro machine and human science}. 1995. v.~1, p. 39--43.}
\bibitem[Farahani, Nasiri e Meybodi 2011]{farahani2011multiswarm}
\abntrefinfo{Farahani, Nasiri e Meybodi}{FARAHANI; NASIRI; MEYBODI}{2011}
{FARAHANI, S.~M.; NASIRI, B.; MEYBODI, M.~R. A multiswarm based firefly
algorithm in dynamic environments. In: CITESEER. \emph{ Third Int. Conf. on
Signal Processing Systems (ICSPS2011)}. 2011. v.~3, p. 68--72.}
\bibitem[Garnier, Gautrais e Theraulaz 2007]{garnier2007biological}
\abntrefinfo{Garnier, Gautrais e Theraulaz}{GARNIER; GAUTRAIS; THERAULAZ}{2007}
{GARNIER, S.; GAUTRAIS, J.; THERAULAZ, G. The biological principles of swarm
intelligence.
\emph{ Swarm Intelligence}, Springer, v.~1, n.~1, p. 3--31, 2007.}
\bibitem[Goldberg e Richardson 1987]{sharing}
\abntrefinfo{Goldberg e Richardson}{GOLDBERG; RICHARDSON}{1987}
{GOLDBERG, D.~E.; RICHARDSON, J. Genetic algorithms with sharing for multimodal
function optimization. In: HILLSDALE, NJ: LAWRENCE ERLBAUM. \emph{ Genetic
algorithms and their applications: Proceedings of the Second International
Conference on Genetic Algorithms}. 1987. p. 41--49.}
\bibitem[Holland 1975]{holland1975adaptation}
\abntrefinfo{Holland}{HOLLAND}{1975}
{HOLLAND, J.~H. \emph{ Adaptation in natural and artificial systems: an
introductory analysis with applications to biology, control, and artificial
intelligence.} : U Michigan Press, 1975.}
\bibitem[Kundu 2013]{kundu2013crowding}
\abntrefinfo{Kundu}{KUNDU}{2013}
{KUNDU, S. et al. Crowding-based local differential evolution with
speciation-based memory archive for dynamic multimodal optimization. In:
ACM. \emph{ Proceedings of the 15th annual conference on Genetic and
evolutionary computation}. 2013. p. 33--40.}
\bibitem[Li, Yang e Kang 2006]{li2006new}
\abntrefinfo{Li, Yang e Kang}{LI; YANG; KANG}{2006}
{LI, C.; YANG, M.; KANG, L. A new approach to solving dynamic traveling
salesman problems. In: \emph{ Simulated Evolution and Learning}. : Springer,
2006. p. 236--243.}
\bibitem[Li 2005]{li2005efficient}
\abntrefinfo{Li}{LI}{2005}
{LI, X. Efficient differential evolution using speciation for multimodal
function optimization. In: ACM. \emph{ Proceedings of the 7th annual
conference on Genetic and evolutionary computation}. 2005. p. 873--880.}
\bibitem[Mahfoud 1995]{deterministic_crowding}
\abntrefinfo{Mahfoud}{MAHFOUD}{1995}
{MAHFOUD, S.~W. Niching methods for genetic algorithms.
\emph{ Urbana}, Citeseer, v.~51, n. 95001, p. 62--94, 1995.}
\bibitem[Mengshoel e Goldberg 1999]{probabilisti_crowding}
\abntrefinfo{Mengshoel e Goldberg}{MENGSHOEL; GOLDBERG}{1999}
{MENGSHOEL, O.~J.; GOLDBERG, D.~E. Probabilistic crowding: Deterministic
crowding with probabilistic replacement. In: \emph{ Proc. of the Genetic and
Evolutionary Computation Conference (GECCO-99)}. 1999. p. 409.}
\bibitem[Morrison 2003]{morrison2003performance}
\abntrefinfo{Morrison}{MORRISON}{2003}
{MORRISON, R.~W. Performance measurement in dynamic environments. In: \emph{
GECCO workshop on evolutionary algorithms for dynamic optimization problems}.
: Citeseer, 2003. p. 5--8.}
\bibitem[Morrison e De~Jong 1999]{morrison1999test}
\abntrefinfo{Morrison e De~Jong}{MORRISON; DE~JONG}{1999}
{MORRISON, R.~W.; DE~JONG, K.~A. A test problem generator for non-stationary
environments. In: IEEE. \emph{ Evolutionary Computation, 1999. CEC 99.
Proceedings of the 1999 Congress on}. 1999. v.~3.}
\bibitem[Moser 2007]{moser2007review}
\abntrefinfo{Moser}{MOSER}{2007}
{MOSER, C.~I. Review all currently known publications on approaches which solve
the moving peaks problem.
Citeseer, 2007.}
\bibitem[Nguyen, Yang e Branke 2012]{evolution_dynamic}
\abntrefinfo{Nguyen, Yang e Branke}{NGUYEN; YANG; BRANKE}{2012}
{NGUYEN, T.~T.; YANG, S.; BRANKE, J. Evolutionary dynamic optimization: A
survey of the state of the art.
\emph{ Swarm and Evolutionary Computation}, Elsevier, v.~6, p. 1--24, 2012.}
\bibitem[Oliveira, Silva e Aloise 2004]{de2004otimizaccao}
\abntrefinfo{Oliveira, Silva e Aloise}{OLIVEIRA; SILVA; ALOISE}{2004}
{OLIVEIRA, M. C.~S. de; SILVA, T.~L.; ALOISE, D.~J. Otimiza{\c{c}}{\~a}o por
nuvem de part{\'\i}culas: diferen{\c{c}}a entre aplica{\c{c}}{\~o}es a
problemas cont{\'\i}nuos e discretos.
\emph{ XXXVI SBPO. S{\~a}o Jo{\~a}o Del-Rei--MG}, 2004.}
\bibitem[Parpinelli e Lopes 2011]{parpinelli2011new}
\abntrefinfo{Parpinelli e Lopes}{PARPINELLI; LOPES}{2011}
{PARPINELLI, R.~S.; LOPES, H.~S. New inspirations in swarm intelligence: a
survey.
\emph{ International Journal of Bio-Inspired Computation}, Inderscience
Publishers Ltd, v.~3, n.~1, p. 1--16, 2011.}
\bibitem[Parrott e Li 2006]{parrott2006locating}
\abntrefinfo{Parrott e Li}{PARROTT; LI}{2006}
{PARROTT, D.; LI, X. Locating and tracking multiple dynamic optima by a
particle swarm model using speciation.
\emph{ Evolutionary Computation, IEEE Transactions on}, IEEE, v.~10, n.~4, p.
440--458, 2006.}
\bibitem[Passino 2002]{passino2002biomimicry}
\abntrefinfo{Passino}{PASSINO}{2002}
{PASSINO, K.~M. Biomimicry of bacterial foraging for distributed optimization
and control.
\emph{ Control Systems, IEEE}, IEEE, v.~22, n.~3, p. 52--67, 2002.}
\bibitem[P{\'e}trowski 1996]{clearing}
\abntrefinfo{P{\'e}trowski}{P{\'E}TROWSKI}{1996}
{P{\'E}TROWSKI, A. A clearing procedure as a niching method for genetic
algorithms. In: IEEE. \emph{ Evolutionary Computation, 1996., Proceedings of
IEEE International Conference on}. 1996. p. 798--803.}
\bibitem[Price, Storn e Lampinen 2006]{de}
\abntrefinfo{Price, Storn e Lampinen}{PRICE; STORN; LAMPINEN}{2006}
{PRICE, K.; STORN, R.~M.; LAMPINEN, J.~A. \emph{ Differential evolution: a
practical approach to global optimization}. : Springer Science \& Business
Media, 2006.}
\bibitem[Rand e Riolo 2005]{rand2005measurements}
\abntrefinfo{Rand e Riolo}{RAND; RIOLO}{2005}
{RAND, W.; RIOLO, R. Measurements for understanding the behavior of the genetic
algorithm in dynamic environments: A case study using the shaky ladder
hyperplane-defined functions. In: ACM. \emph{ Proceedings of the 7th annual
workshop on Genetic and evolutionary computation}. 2005. p. 32--38.}
\bibitem[Rozenberg, Bck e Kok 2011]{rozenberg2011handbook}
\abntrefinfo{Rozenberg, Bck e Kok}{ROZENBERG; BCK; KOK}{2011}
{ROZENBERG, G.; BCK, T.; KOK, J.~N. \emph{ Handbook of natural computing}. :
Springer Publishing Company, Incorporated, 2011.}
\bibitem[Thomsen 2004]{thomsen2004multimodal}
\abntrefinfo{Thomsen}{THOMSEN}{2004}
{THOMSEN, R. Multimodal optimization using crowding-based differential
evolution. In: IEEE. \emph{ Evolutionary Computation, 2004. CEC2004.
Congress on}. 2004. v.~2, p. 1382--1389.}
\bibitem[Yang e Li 2010]{yang2010clustering}
\abntrefinfo{Yang e Li}{YANG; LI}{2010}
{YANG, S.; LI, C. A clustering particle swarm optimizer for locating and
tracking multiple optima in dynamic environments.
\emph{ Evolutionary Computation, IEEE Transactions on}, IEEE, v.~14, n.~6, p.
959--974, 2010.}
\bibitem[Yang 2008]{firefly}
\abntrefinfo{Yang}{YANG}{2008}
{YANG, X.-S. Firefly algorithm.
\emph{ Nature-inspired metaheuristic algorithms}, v.~20, p. 79--90, 2008.}
\bibitem[Yang e Hossein~Gandomi 2012]{bat}
\abntrefinfo{Yang e Hossein~Gandomi}{YANG; HOSSEIN~GANDOMI}{2012}
{YANG, X.-S.; HOSSEIN~GANDOMI, A. Bat algorithm: a novel approach for global
engineering optimization.
\emph{ Engineering Computations}, Emerald Group Publishing Limited, v.~29,
n.~5, p. 464--483, 2012.}
\end{thebibliography}