An improved cuckoo search algorithm for integer programming problems (Q2224258)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An improved cuckoo search algorithm for integer programming problems |
scientific article; zbMATH DE number 7305523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved cuckoo search algorithm for integer programming problems |
scientific article; zbMATH DE number 7305523 |
Statements
An improved cuckoo search algorithm for integer programming problems (English)
0 references
3 February 2021
0 references
Summary: This paper presents a novel cuckoo search algorithm called elite opposition -- cuckoo search algorithm (ECS) for solving integer programming problems. The opposite solution of the elite individual in the population is generated by an opposition-based strategy in the proposed algorithm and form an opposite search space by constructing the opposite population that locates inside the dynamic search boundaries, then, the search space of the algorithm is guided to approximate the space in which the global optimum is included by simultaneously evaluating the current population and the opposite one. The results show that ECS algorithm has faster convergence speed, higher computational precision and is more effective for solving integer programming problems.
0 references
elite opposition
0 references
cuckoo search
0 references
integer programming problems
0 references
0.7854738831520081
0 references
0.747327446937561
0 references
0.7401811480522156
0 references
0.7398427724838257
0 references
0.7396423816680908
0 references