Chaotic charged system search with a feasible-based method for constraint optimization problems (Q459870)
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: Chaotic charged system search with a feasible-based method for constraint optimization problems |
scientific article; zbMATH DE number 6354270
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chaotic charged system search with a feasible-based method for constraint optimization problems |
scientific article; zbMATH DE number 6354270 |
Statements
Chaotic charged system search with a feasible-based method for constraint optimization problems (English)
0 references
13 October 2014
0 references
Summary: Recently developed chaotic charged system search was combined to feasible-based method to solve constraint engineering optimization problems. Using chaotic maps into the CSS increases the global search mobility for a better global optimization. In the present method, an improved feasible-based method is utilized to handle the constraints. Some constraint design examples are tested using the new chaotic-based methods, and the results are compared to recognize the most efficient and powerful algorithm.
0 references
0 references
0 references
0 references
0 references
0.7907992601394653
0 references
0.7865761518478394
0 references
0.7743816375732422
0 references
0.741226077079773
0 references
0.7344461679458618
0 references