FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W206150585> ?p ?o ?g. }

• W206150585 abstract "MemeticAlgorithmsformolecularconformationandotheroptimizationproblemsPablo MoscatoDepartamento de Engenharia de Sistemas,Faculdade de Engenharia Eletrica, Universidade Estadual de Campinas,C.P. 6101, Campinas, SP, CEP 13081-970, BRAZILe-mail:moscato@densis.fee.unicamp.brWWW:http://www.densis.fee.unicamp.br/~moscatoJune 29, 1998With the name of `Memetic Algorithms' we recognize a class of metaheuristics which constitutesanemergingparadigm foroptimization.Formore thanadecadenowithasb eenapplied withsuccesstoalargevarietyofcombinatorial andnonlinearproblems.Inthelastfourears,andmostly in the last two, several techniquesintro duced in molecular optimization problems can b echaracterizedinthisway.Wetrytojusttro duceherethenewtechniqueswhileseekemphasize the relation with previous and current work in Memetic Algorithms and Scatter Search.MemeticAlgorithms (MAs)isap opulation-basedapproachtooptimization [28].Itcanb eapplied b oth to nonlinear and discrete (combinatorial) optimization problems.They are orders ofmagnitude faster than Genetic Algorithms in some problem domains. We call it a `metaheuristic'sinceit is a general purp osestrategy that guides other basic heuristicsor truncatedexact meth-o ds.Other metaheuristics, like Simulated Annealing (SA) or Guided Lo cal Search (GLS) (whichguidesome underlyingHill-climbing pro cedure),areappliedtoasingleoptimizer andthustheycannotb ecategorizedas`p opulation-based'.BasicTabu Search(TS)techniquesalso usea single optimizer, but more evolved metaheuristics like Scatter Search (SS), also use pro ceduresbased in multiple-p oint optimization. Genetic Algorithms (GAs), also try to evolve solutions incon gurationspacebyusinga p opulation of individuals whichrepresentalternative solutionsof theproblems.Go o d reviewsstressingthesimilarities and di erencesof theseapproachescanb e found in [10] [11] and [28] (the latter, written in 1990-92, anticipates the relevance of MAs inprotein landscap es).A main di erenceb etweenGAs and MAs is that thelatter approach triesto use all p ossibleknowledge available to solve the problem.Some SS pro cedurescan b eb eclassi ed as MAsto o,though none of theapproaches prop erly includesthe other.In essence,MAsconstitutean exer-ciseofhumblenessandcommon sense;if severalalternativealgorithms fortheproblem alreadyexist, it should b ea wise idea to use them together.This is of particular interestfor the practi-tioner, who has b een relying on a well-known co de which enables to give lo cally optimal solutionsbutrequiressome extra global optimization (adding sto chasticity to thesearch).Thus MAsaresometimes calledHybrid Genetic Algorithms, orLamarkian Evolutionary Algorithmsor evenknowledge-augmented GAs.Otherdenominations includeGenetic Lo cal SearchorParallelGenetic Algorithms.They are easy to b e recognized from the so-called standard GAs since inMAsthenewcon gurations(children)arecreatedfrom highly evolvedparentsfrom previousgenerations.The indep endent evolution of parents is done using knowledge ab out the problem. Innon-linear settings this generally achieved using gradient information. In combinatorial optimiza-tion problems they generally use some lo cal search or constructive algorithm but truncated exactpro cedures(like truncated branch-and-b ound or branch-and-cut techniques) can also b e used.Inall cases the existence of theorems and prop erties related to the structureof the optimum con g-uration greatly help to reduce the whole search pro cess.1" @default.
• W206150585 created "2016-06-24" @default.
• W206150585 creator A5041229487 @default.
• W206150585 date "2007-01-01" @default.
• W206150585 modified "2023-09-25" @default.
• W206150585 title "Memetic Algorithms for molecular conformation and other optimization problems" @default.
• W206150585 cites W1503112454 @default.
• W206150585 cites W1512240291 @default.
• W206150585 cites W1619396669 @default.
• W206150585 cites W1662589380 @default.
• W206150585 cites W1966604167 @default.
• W206150585 cites W1970957330 @default.
• W206150585 cites W1974156953 @default.
• W206150585 cites W1974485962 @default.
• W206150585 cites W1976592136 @default.
• W206150585 cites W1976759304 @default.
• W206150585 cites W1980660073 @default.
• W206150585 cites W1997926446 @default.
• W206150585 cites W2003015089 @default.
• W206150585 cites W2008242747 @default.
• W206150585 cites W2012168018 @default.
• W206150585 cites W2016230561 @default.
• W206150585 cites W2016289448 @default.
• W206150585 cites W2025277814 @default.
• W206150585 cites W2043466881 @default.
• W206150585 cites W2070620289 @default.
• W206150585 cites W2072759559 @default.
• W206150585 cites W2074970710 @default.
• W206150585 cites W2080510047 @default.
• W206150585 cites W2083610040 @default.
• W206150585 cites W2084266282 @default.
• W206150585 cites W2085955164 @default.
• W206150585 cites W2089425975 @default.
• W206150585 cites W2092188627 @default.
• W206150585 cites W2100903564 @default.
• W206150585 cites W2121954997 @default.
• W206150585 cites W2125083705 @default.
• W206150585 cites W2133940682 @default.
• W206150585 cites W2172217021 @default.
• W206150585 cites W3145138150 @default.
• W206150585 hasPublicationYear "2007" @default.
• W206150585 type Work @default.
• W206150585 sameAs 206150585 @default.
• W206150585 citedByCount "0" @default.
• W206150585 crossrefType "journal-article" @default.
• W206150585 hasAuthorship W206150585A5041229487 @default.
• W206150585 hasConcept C109718341 @default.
• W206150585 hasConcept C11413529 @default.
• W206150585 hasConcept C126255220 @default.
• W206150585 hasConcept C126980161 @default.
• W206150585 hasConcept C135320971 @default.
• W206150585 hasConcept C135450995 @default.
• W206150585 hasConcept C33923547 @default.
• W206150585 hasConcept C35129592 @default.
• W206150585 hasConcept C41008148 @default.
• W206150585 hasConcept C52692508 @default.
• W206150585 hasConcept C8880873 @default.
• W206150585 hasConceptScore W206150585C109718341 @default.
• W206150585 hasConceptScore W206150585C11413529 @default.
• W206150585 hasConceptScore W206150585C126255220 @default.
• W206150585 hasConceptScore W206150585C126980161 @default.
• W206150585 hasConceptScore W206150585C135320971 @default.
• W206150585 hasConceptScore W206150585C135450995 @default.
• W206150585 hasConceptScore W206150585C33923547 @default.
• W206150585 hasConceptScore W206150585C35129592 @default.
• W206150585 hasConceptScore W206150585C41008148 @default.
• W206150585 hasConceptScore W206150585C52692508 @default.
• W206150585 hasConceptScore W206150585C8880873 @default.
• W206150585 hasLocation W2061505851 @default.
• W206150585 hasOpenAccess W206150585 @default.
• W206150585 hasPrimaryLocation W2061505851 @default.
• W206150585 hasRelatedWork W1519538594 @default.
• W206150585 hasRelatedWork W1525097444 @default.
• W206150585 hasRelatedWork W1539664248 @default.
• W206150585 hasRelatedWork W1548761612 @default.
• W206150585 hasRelatedWork W1556882791 @default.
• W206150585 hasRelatedWork W1984603815 @default.
• W206150585 hasRelatedWork W2010458424 @default.
• W206150585 hasRelatedWork W2015215897 @default.
• W206150585 hasRelatedWork W2019437468 @default.
• W206150585 hasRelatedWork W2025632800 @default.
• W206150585 hasRelatedWork W2030168527 @default.
• W206150585 hasRelatedWork W2037251744 @default.
• W206150585 hasRelatedWork W2088235871 @default.
• W206150585 hasRelatedWork W2142958079 @default.
• W206150585 hasRelatedWork W2168615236 @default.
• W206150585 hasRelatedWork W2187466564 @default.
• W206150585 hasRelatedWork W2219782798 @default.
• W206150585 hasRelatedWork W2489219000 @default.
• W206150585 hasRelatedWork W2560567611 @default.
• W206150585 hasRelatedWork W73393089 @default.
• W206150585 isParatext "false" @default.
• W206150585 isRetracted "false" @default.
• W206150585 magId "206150585" @default.
• W206150585 workType "article" @default.