Editing Metaheuristic (section)

== Metaheuristic Optimization Frameworks ==

A MOF can be defined as ‘‘a set of software tools that provide a correct and reusable implementation of a set of metaheuristics, and the basic mechanisms to accelerate the implementation of its partner subordinate heuristics (possibly including solution encodings and technique-specific operators), which are necessary to solve a particular problem instance using techniques provided’’.<ref name=":8">{{Cite journal |last1=Parejo |first1=José Antonio |last2=Ruiz-Cortés |first2=Antonio |last3=Lozano |first3=Sebastián |last4=Fernandez |first4=Pablo |date=March 2012 |title=Metaheuristic optimization frameworks: a survey and benchmarking |journal=Soft Computing |language=en |volume=16 |issue=3 |pages=527–561 |doi=10.1007/s00500-011-0754-8 |issn=1432-7643}}</ref>

There are many candidate optimization tools which can be considered as a MOF of varying feature. The following list of 33 MOFs is compared and evaluated in detail in:<ref name=":8" /> Comet, EvA2, evolvica, Evolutionary::Algorithm, GAPlayground, jaga, JCLEC, JGAP, jMetal, n-genes, Open Beagle, Opt4j, ParadisEO/EO, Pisa, Watchmaker, FOM, Hypercube, HotFrame, Templar, EasyLocal, iOpt, OptQuest, JDEAL, Optimization Algorithm Toolkit, HeuristicLab, MAFRA, Localizer, GALIB, DREAM, Discropt, MALLBA, MAGMA, and UOF. There have been a number of publications on the support of parallel implementations, which was missing in this comparative study, particularly from the late 10s onwards.<ref name=":6" /><ref name=":7" /><ref>{{Citation |last1=García-Valdez |first1=Mario |last2=Merelo |first2=J.J. |date=2017-07-15 |title=evospace-js: asynchronous pool-based execution of heterogeneous metaheuristics |work=GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference, Companion |language=en |publisher=ACM |place=New York |pages=1202–1208 |doi=10.1145/3067695.3082473 |isbn=978-1-4503-4939-0}}</ref><ref>{{Cite journal |last1=Lim |first1=Dudy |last2=Ong |first2=Yew-Soon |last3=Jin |first3=Yaochu |last4=Sendhoff |first4=Bernhard |last5=Lee |first5=Bu-Sung |date=May 2007 |title=Efficient Hierarchical Parallel Genetic Algorithms using Grid computing |journal=Future Generation Computer Systems |language=en |volume=23 |issue=4 |pages=658–670 |doi=10.1016/j.future.2006.10.008}}</ref><ref>{{Citation |last1=Nebro |first1=Antonio J. |last2=Barba-González |first2=Cristóbal |last3=Nieto |first3=José García |last4=Cordero |first4=José A. |last5=Montes |first5=José F. Aldana |date=2017-07-15 |title=Design and architecture of the jMetaISP framework |language=en |work=GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference, Companion |publisher=ACM |place=New York |pages=1239–1246 |doi=10.1145/3067695.3082466 |isbn=978-1-4503-4939-0}}</ref>