Editing Metaheuristic (section)

== References ==
<!-- {{reflist}} -->
<!-- Please provide complete references to journal / conference papers, tech reports, msc/phd theses, etc. and make sure the reference format is correct. Only include major research contributions on this page. Only add a reference when you use it in a good description in the main article. -->
{{reflist|2|refs=

<ref name=Bianchi2009>{{cite journal|last=Bianchi|first=Leonora|author2=Marco Dorigo |author3=Luca Maria Gambardella |author4=Walter J. Gutjahr |title=A survey on metaheuristics for stochastic combinatorial optimization|journal=Natural Computing|year=2009|volume=8|issue=2|pages=239–287|doi=10.1007/s11047-008-9098-4|s2cid=9141490|url=http://doc.rero.ch/record/319945/files/11047_2008_Article_9098.pdf}}</ref>
<ref name=Bala2015>
{{cite journal
  | title=Stellar-Mass Black Hole Optimization for Biclustering Microarray Gene Expression Data
  |author1=R. Balamurugan |author2=A.M. Natarajan|author3=K. Premalatha| journal=Applied Artificial Intelligence 
  | volume=29
  | number=4
  | pages=353–381
  | year=2015
  |doi=10.1080/08839514.2015.1016391 |s2cid=44624424 | doi-access=free}}</ref>
<ref name="Droste2002">{{cite journal|author1=Stefan Droste |author2=Thomas Jansen |author3=Ingo Wegener | title=Optimization with Randomized Search Heuristics – The (A)NFL Theorem, Realistic Scenarios, and Difficult Functions |journal=Theoretical Computer Science| year=2002| volume=287| number=1| pages=131–144| doi=10.1016/s0304-3975(02)00094-4|citeseerx=10.1.1.35.5850 }}</ref>

<ref name="Igel2003">{{cite journal| author=Igel, Christian, Toussaint, Marc| title=On classes of functions for which No Free Lunch results hold| journal=Information Processing Letters|date=Jun 2003| volume=86| number=6| pages=317–321| doi=10.1016/S0020-0190(03)00222-9|issn=0020-0190| arxiv=cs/0108011| s2cid=147624}}</ref>

<ref name="Auger2010">{{cite journal| author=[[Anne Auger|Auger, Anne]], Teytaud, Olivier| title=Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms|journal=Algorithmica| year=2010| volume=57| issue=1| pages=121–146| doi=10.1007/s00453-008-9244-5|issn=0178-4617| citeseerx=10.1.1.186.6007| s2cid=1989533}}</ref>

<ref name=wolpert95nofreelunch>
{{Cite journal
|last1=Wolpert
|first1=D.H.
|last2=Macready
|first2=W.G.
|s2cid=12890367
|title=No free lunch theorems for search
|journal=Technical Report SFI-TR-95-02-010
|publisher=Santa Fe Institute
|year=1995
}}
</ref>

<ref name=kernighan1970efficient>
{{cite journal
|title=An efficient heuristic procedure for partitioning graphs
|author1=Kernighan, B.W. |author2=Lin, S. |journal=Bell System Technical Journal
|volume=49
|issue=2
|pages=291–307
|year=1970
|doi=10.1002/j.1538-7305.1970.tb01770.x
}}
</ref>

<ref name=talbi09metaheuristics>
{{cite book
|title=Metaheuristics: from design to implementation
|last1=Talbi
|first1=E-G.
|year=2009
|publisher=Wiley
|isbn=978-0-470-27858-1
}}
</ref>

<ref name=glover03handbook>
{{cite book
|title=Handbook of metaheuristics
|last1=Glover
|first1=F.
|last2=Kochenberger
|first2=G.A.
|year=2003
|publisher=Springer, International Series in Operations Research & Management Science
|volume=57
|isbn=978-1-4020-7263-5
}}
</ref>

<ref name=glover77scattersearch>
{{cite journal
|last1=Glover
|first1=Fred
|title=Heuristics for Integer programming Using Surrogate Constraints
|journal=Decision Sciences
|year=1977
|pages=156–166
|volume=8
|issue=1
|doi=10.1111/j.1540-5915.1977.tb01074.x
|citeseerx=10.1.1.302.4071
}}
</ref>

<ref name=glover86future>
{{cite journal
|doi=10.1016/0305-0548(86)90048-1
|last1=Glover
|first1=F.
|title=Future Paths for Integer Programming and Links to Artificial Intelligence
|journal=Computers and Operations Research
|year=1986
|pages=533–549
|volume=13
|issue=5
}}
</ref>

<ref name=blum03metaheuristics>
{{cite journal
|title=Metaheuristics in combinatorial optimization: Overview and conceptual comparison
|last1=Blum
|first1=Christian
|last2=Roli
|first2=Andrea
|year=2003
|publisher=ACM
|journal=ACM Computing Surveys
|volume=35
|pages=268–308
|issue=3
|doi=10.1145/937503.937505
|url=https://www.researchgate.net/publication/221900771
}}
</ref>

<ref name=holland75adaptation>
{{cite book
|title=Adaptation in Natural and Artificial Systems
|last1=Holland
|first1=J.H.
|year=1975
|publisher=University of Michigan Press
|isbn=978-0-262-08213-6
|url-access=registration
|url=https://archive.org/details/adaptationinnatu00holl
}}
</ref>

<ref name=kirkpatrick83optimization>
{{cite journal
|last1=Kirkpatrick
|first1=S.
|last2=Gelatt Jr.
|first2=C.D.
|last3=Vecchi
|first3=M.P.
|title=Optimization by Simulated Annealing
|journal=Science
|volume=220
|year=1983
|pages=671–680
|issue=4598
|pmid=17813860
|doi=10.1126/science.220.4598.671
|bibcode=1983Sci...220..671K
|citeseerx=10.1.1.123.7607
|s2cid=205939
}}
</ref>

<ref name=nelder65simplex>
{{cite journal
|last1=Nelder
|first1=J.A.
|last2=Mead
|first2=R.
|s2cid=2208295
|title=A simplex method for function minimization
|journal=Computer Journal
|year=1965
|pages=308–313
|volume=7
|issue=4
|doi=10.1093/comjnl/7.4.308
}}
</ref>

<ref name=robbins52stochastic>
{{cite journal
|doi=10.1214/aoms/1177729586
|last1=Robbins
|first1=H.
|last2=Monro
|first2=S.
|title=A Stochastic Approximation Method
|journal=Annals of Mathematical Statistics
|year=1951
|pages=400–407
|issue=3
|volume=22
|url=http://dml.cz/bitstream/handle/10338.dmlcz/100283/CzechMathJ_08-1958-1_10.pdf
|doi-access=free
}}
</ref>

<ref name=barricelli54esempi>
{{cite journal
|last1=Barricelli
|first1=N.A.
|title=Esempi numerici di processi di evoluzione
|journal=Methodos
|year=1954
|pages=45–68
}}
</ref>

<ref name=rastrigin63convergence>
{{cite journal
|last=Rastrigin
|first=L.A.
|title=The convergence of the random search method in the extremal control of a many parameter system
|journal=Automation and Remote Control
|year=1963
|volume=24
|pages=1337–1342
|issue=10
}}
</ref>

<ref name=matyas65random>
{{cite journal
|last=Matyas
|first=J.
|title=Random optimization
|journal=Automation and Remote Control
|year=1965
|volume=26
|pages=246–253
|issue=2
|url=http://www.mathnet.ru/eng/at11288
}}
</ref>

<ref name=fogel66artificial>
{{cite book
|title=Artificial Intelligence through Simulated Evolution
|last1=Fogel
|first1=L.
|last2=Owens
|first2=A.J.
|last3=Walsh
|first3=M.J.
|year=1966
|publisher=Wiley
|isbn=978-0-471-26516-0
}}
</ref>

<ref name=hastings70monte>
{{cite journal
|doi=10.1093/biomet/57.1.97
|last1=Hastings
|first1=W.K.
|s2cid=21204149
|title=Monte Carlo Sampling Methods Using Markov Chains and Their Applications
|journal=Biometrika
|year=1970
|pages=97–109
|volume=57
|issue=1
|bibcode=1970Bimka..57...97H
}}
</ref>

<ref name=cavicchio70adaptive>
{{Cite journal
|last1=Cavicchio
|first1=D.J.
|hdl=2027.42/4042 
|title=Adaptive search using simulated evolution
|journal=Technical Report 
|publisher=University of Michigan, Computer and Communication Sciences Department
|year=1970
}}
</ref>

<ref name=mercer78adaptive>
{{cite journal
|last=Mercer
|first=R.E.
|author2=Sampson, J.R.
|title=Adaptive search using a reproductive metaplan
|journal=Kybernetes
|year=1978
|volume=7
|issue=3
|pages=215&ndash;228
|doi=10.1108/eb005486
}}
</ref>

<ref name=goldberg89genetic>
{{cite book
|title=Genetic Algorithms in Search, Optimization and Machine Learning
|last1=Goldberg
|first1=D.E.
|year=1989
|publisher=Kluwer Academic Publishers
|isbn=978-0-201-15767-3
}}
</ref>

<ref name=smith80learning>
{{cite thesis
|type=PhD Thesis
|title=A Learning System Based on Genetic Adaptive Algorithms
|last=Smith
|first=S.F.
|year=1980
|publisher=University of Pittsburgh
|url=https://dl.acm.org/citation.cfm?id=909835
}}
</ref>

<ref name=rechenberg65ES>
{{cite journal
|last=Rechenberg
|first=Ingo
|title=Cybernetic Solution Path of an Experimental Problem
|journal=Royal Aircraft Establishment, Library Translation
|year=1965
}}
</ref>

<ref name=moscato89evolution>{{cite journal|last=Moscato|first=P.|year=1989|title=On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms|journal=Caltech Concurrent Computation Program|issue=report 826|url=https://www.researchgate.net/publication/2354457}}</ref>

}}