A novel optimization algorithm inspired by the creative thinking process
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 60546975X | ||
| 003 | CHVBK | ||
| 005 | 20210128100324.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20151001xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1459-6 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1459-6 | ||
| 245 | 0 | 2 | |a A novel optimization algorithm inspired by the creative thinking process |h [Elektronische Daten] |c [Xiang Feng, Ru Zou, Huiqun Yu] |
| 520 | 3 | |a Creative thinking, which plays an essential role in the progress of human society, has an outstanding problem-solving ability. This paper presents a novel creativity-oriented optimization model (COOM) and algorithm (COOA) inspired by the creative thinking process. At first, COOM is constructed by simplifying the procedure of creative thinking while retaining its main characteristics. And then, COOA is presented for continuous optimization problems. It is a realization of COOM. As a new nature-inspired algorithm, COOA is different from other similar algorithms in terms of the basic principle, mathematical formalization and properties. Features of the COOM and the corresponding algorithm include a powerful processing ability for the complex problems, namely high-dimensional, highly nonlinear and random problems. The proposed approach also has the advantages in terms of the higher intelligence, effectiveness, parallelism and lower computation complexity. The properties of COOA, including convergence and parallelism, are discussed in detail. The numerous simulations on the CEC-2013 real-parameter optimization benchmark functions' problems have shown the effectiveness and parallelism of the proposed approach. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Creativity-oriented optimization algorithm |2 nationallicence | |
| 690 | 7 | |a Nature-inspired algorithm |2 nationallicence | |
| 690 | 7 | |a Creative thinking |2 nationallicence | |
| 690 | 7 | |a Numerical function optimization |2 nationallicence | |
| 700 | 1 | |a Feng |D Xiang |u Department of Computer Science and Engineering, China University of Science and Technology, Meilong Road 130, 200237, Shanghai, People's Republic of China |4 aut | |
| 700 | 1 | |a Zou |D Ru |u Department of Computer Science and Engineering, China University of Science and Technology, Meilong Road 130, 200237, Shanghai, People's Republic of China |4 aut | |
| 700 | 1 | |a Yu |D Huiqun |u Department of Computer Science and Engineering, China University of Science and Technology, Meilong Road 130, 200237, Shanghai, People's Republic of China |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/10(2015-10-01), 2955-2972 |x 1432-7643 |q 19:10<2955 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1459-6 |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-1459-6 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Feng |D Xiang |u Department of Computer Science and Engineering, China University of Science and Technology, Meilong Road 130, 200237, Shanghai, People's Republic of China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Zou |D Ru |u Department of Computer Science and Engineering, China University of Science and Technology, Meilong Road 130, 200237, Shanghai, People's Republic of China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Yu |D Huiqun |u Department of Computer Science and Engineering, China University of Science and Technology, Meilong Road 130, 200237, Shanghai, People's Republic of China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/10(2015-10-01), 2955-2972 |x 1432-7643 |q 19:10<2955 |1 2015 |2 19 |o 500 | ||