Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10825Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Parsopoulos, K. E. | en |
| dc.contributor.author | Vrahatis, M. N. | en |
| dc.date.accessioned | 2015-11-24T17:00:50Z | - |
| dc.date.available | 2015-11-24T17:00:50Z | - |
| dc.identifier.issn | 1089-778X | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10825 | - |
| dc.rights | Default Licence | - |
| dc.subject | deflection technique | en |
| dc.subject | detecting all minimizers | en |
| dc.subject | dynamical systems | en |
| dc.subject | nash equilibria | en |
| dc.subject | particle swarm optimization (pso) | en |
| dc.subject | periodic orbits | en |
| dc.subject | stretching technique | en |
| dc.subject | filled function-method | en |
| dc.subject | periodic-orbits | en |
| dc.subject | local minima | en |
| dc.subject | nonlinear mappings | en |
| dc.subject | convergence | en |
| dc.subject | stability | en |
| dc.subject | systems | en |
| dc.subject | algorithm | en |
| dc.subject | variables | en |
| dc.subject | selection | en |
| dc.title | On the computation of all global minimizers through particle swarm optimization | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1109/tevc.2004.826076 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2004 | - |
| heal.abstract | This paper presents approaches for effectively computing all global minimizers of an objective function. The approaches include transformations of the objective function through the recently proposed deflection and stretching techniques, as well as a repulsion source at each detected minimizer. The aforementioned techniques are incorporated in the context of the particle swarm optimization (PSO) method, resulting in an efficient algorithm which has the ability to avoid previously detected solutions and, thus, detect all global minimizers of a function. Experimental results on benchmark problems originating from the fields of global optimization, dynamical systems, and game theory, are reported, and conclusions are derived. | en |
| heal.journalName | Ieee Transactions on Evolutionary Computation | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| parsopoulos-2004-On the computation of all global minimizers through particle swarm optimization.pdf | 795.49 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
