CODEQ: an effective metaheuristic for continuous global optimisation (Q537996)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5898987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | CODEQ: an effective metaheuristic for continuous global optimisation |
scientific article; zbMATH DE number 5898987 |
Statements
CODEQ: an effective metaheuristic for continuous global optimisation (English)
0 references
23 May 2011
0 references
Summary: CODEQ is a new, parameter-free meta-heuristic algorithm that is hybrid of concepts from chaotic search, opposition-based learning, differential evolution (DE) and quantum mechanics. The performance of the proposed approach is investigated and compared with other well-known population-based optimisation approaches when applied to solve 19 benchmark functions. The conducted experiments show that CODEQ presents excellent results with almost no parameter tuning. Moreover, the performance of CODEQ when applied to high-dimensional problems is investigated with excellent results. Finally, the application of CODEQ to constrained and real-world engineering problems is investigated with encouraging results.
0 references
metaheuristics
0 references
differential evolution
0 references
chaotic search
0 references
quantum mechanics
0 references
opposition-based learning
0 references
OBL
0 references
stochastic search
0 references
continuous global optimisation
0 references
0.8325061798095703
0 references
0.7380160689353943
0 references
0.7346915006637573
0 references
0.7234688401222229
0 references
