A hybrid version of invasive weed optimization with quadratic approximation
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605469237 | ||
| 003 | CHVBK | ||
| 005 | 20210128100321.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20151201xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-015-1896-x |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-015-1896-x | ||
| 245 | 0 | 2 | |a A hybrid version of invasive weed optimization with quadratic approximation |h [Elektronische Daten] |c [Y. Naidu, A. Ojha] |
| 520 | 3 | |a Invasive weed optimization (IWO) is a recent meta-heuristic optimization technique, based on the life cycle of plants. It has been applied in many engineering applications as well as in real world problems. In this paper, a hybrid version of IWO with the quadratic approximation (QA) operator, referred as QAIWO, has been investigated to improve the convergence rate of IWO while obtaining optimal solution. Additionally, we alleviate the limitation of QA (which is nothing but difficulty in escaping from a local optimum) by performing QA a predetermined number of times and then considering the average of all such solutions due to each iteration rather than a single solution. This technique makes our algorithm more efficient compared to the existing algorithms in the area. Twenty two benchmark problems and five real-life problems are adopted from literature to validate our proposed hybrid method QAIWO. The results of QAIWO are compared with the results obtained by the standard IWO and the well-known nature-inspired genetic algorithm (GA). These comparisons exhibit that QAIWO is more convenient to solve complex problems than using IWO and/or GA. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2015 | ||
| 690 | 7 | |a Invasive weed optimization |2 nationallicence | |
| 690 | 7 | |a Quadratic approximation |2 nationallicence | |
| 690 | 7 | |a Meta-heuristic optimization technique |2 nationallicence | |
| 690 | 7 | |a Performance index |2 nationallicence | |
| 700 | 1 | |a Naidu |D Y. |u Indian Institute of Technology, Bhubaneswar, India |4 aut | |
| 700 | 1 | |a Ojha |D A. |u Indian Institute of Technology, Bhubaneswar, India |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/12(2015-12-01), 3581-3598 |x 1432-7643 |q 19:12<3581 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-015-1896-x |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-015-1896-x |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Naidu |D Y. |u Indian Institute of Technology, Bhubaneswar, India |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Ojha |D A. |u Indian Institute of Technology, Bhubaneswar, India |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/12(2015-12-01), 3581-3598 |x 1432-7643 |q 19:12<3581 |1 2015 |2 19 |o 500 | ||