1. Repository of OAI
  2. ΑΠΟΘΕΤΗΡΙΟ "ΟΛΥΜΠΙΑΣ"
  3. Σχολή Θετικών Επιστημών
  4. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής
  5. Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)
Ελληνικά   English  
Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/10761
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLaskari, E. C.en
dc.contributor.authorParsopoulos, K. E.en
dc.contributor.authorVrahatis, M. N.en
dc.date.accessioned2015-11-24T17:00:24Z-
dc.date.available2015-11-24T17:00:24Z-
dc.identifier.issn1017-1398-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10761-
dc.rightsDefault Licence-
dc.subjectglobal optimizationen
dc.subjectdynamic search trajectoriesen
dc.subjectdifferential evolutionen
dc.subjecthybrid methodsen
dc.subjectnumerical algorithmsen
dc.subjectdifferential evolutionen
dc.subjectminimizationen
dc.titleEvolutionary operators in global optimization with dynamic search trajectoriesen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate2003-
heal.abstractOne of the most commonly encountered approaches for the solution of unconstrained global optimization problems is the application of multi-start algorithms. These algorithms usually combine already computed minimizers and previously selected initial points, to generate new starting points, at which, local search methods are applied to detect new minimizers. Multi-start algorithms are usually terminated once a stochastic criterion is satisfied. In this paper, the operators of the Differential Evolution algorithm are employed to generate the starting points of a global optimization method with dynamic search trajectories. Results for various well-known and widely used test functions are reported, supporting the claim that the proposed approach improves drastically the performance of the algorithm, in terms of the total number of function evaluations required to reach a global minimizer.en
heal.journalNameNumerical Algorithmsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Show simple item record
Files in This Item:
File Description SizeFormat 
parsopoulos-2003-Evolutionary operators in global optimization with dynamic.pdf118.76 kBAdobe PDFView/Open    Request a copy
Show simple item record  


This item is licensed under a Creative Commons License Creative Commons