A two-stage memory powered Great Deluge algorithm for global optimization
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605468753 | ||
| 003 | CHVBK | ||
| 005 | 20210128100318.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150901xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1423-5 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1423-5 | ||
| 245 | 0 | 2 | |a A two-stage memory powered Great Deluge algorithm for global optimization |h [Elektronische Daten] |c [Adnan Acan, Ahmet Ünveren] |
| 520 | 3 | |a A two-stage memory architecture and search operators exploiting the accumulated experience in memory are maintained within the framework of a Great DeLuge algorithm for real-valued global optimization. The level-based acceptance criterion of the Great DeLuge algorithm is applied for each best solution extracted in a particular iteration. The use of memory-based search supported by effective move operators results in a powerful optimization algorithm. The success of the presented approach is illustrated using three sets of well-known benchmark functions including problems of varying sizes and difficulties. Performance of the presented approach is evaluated and in comparison to well-known algorithms and their published results. Except for a few large-scale optimization problems, experimental evaluations demonstrated that the presented approach performs at least as good as its competitors. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Metaheuristics |2 nationallicence | |
| 690 | 7 | |a Great Deluge algorithm |2 nationallicence | |
| 690 | 7 | |a Memory-based search |2 nationallicence | |
| 690 | 7 | |a Global optimization |2 nationallicence | |
| 700 | 1 | |a Acan |D Adnan |u Computer Engineering Department, Eastern Mediterranean University, Gazimagusa, Turkey |4 aut | |
| 700 | 1 | |a Ünveren |D Ahmet |u Computer Engineering Department, Eastern Mediterranean University, Gazimagusa, Turkey |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/9(2015-09-01), 2565-2585 |x 1432-7643 |q 19:9<2565 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1423-5 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-014-1423-5 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Acan |D Adnan |u Computer Engineering Department, Eastern Mediterranean University, Gazimagusa, Turkey |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Ünveren |D Ahmet |u Computer Engineering Department, Eastern Mediterranean University, Gazimagusa, Turkey |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/9(2015-09-01), 2565-2585 |x 1432-7643 |q 19:9<2565 |1 2015 |2 19 |o 500 | ||