A Catfish Effect Inspired Harmony Search Algorithm for Optimization
This paper describes a Catfish Effect inspired harmony search algorithm. In the algorithm, two equal size harmony memories (HM) are used to cover all the variable range, and the new harmony is generated from each history one or from the whole possible solution set, following some probability rule. A...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
|---|
| Format: |
E-Artikel |
|---|
| Erschienen: |
De Gruyter ; 2013 |
|---|
| Schlagwörter: |
|---|
| Umfang: |
10 |
|---|
| Reproduktion: |
Walter de Gruyter Online Zeitschriften |
|---|---|
| Übergeordnetes Werk: |
Enthalten in: International journal of nonlinear sciences and numerical simulation - Berlin : de Gruyter, 2000, 14(2013), 6 vom: 18. Sept., Seite 413-422 |
| Übergeordnetes Werk: |
volume:14 ; year:2013 ; number:6 ; day:18 ; month:09 ; pages:413-422 ; extent:10 |
| Links: |
|---|
| DOI / URN: |
10.1515/ijnsns-2012-0161 |
|---|
| Katalog-ID: |
NLEJ246996099 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ246996099 | ||
| 003 | DE-627 | ||
| 005 | 20220820025252.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 220814s2013 xx |||||o 00| ||und c | ||
| 024 | 7 | |a 10.1515/ijnsns-2012-0161 |2 doi | |
| 028 | 5 | 2 | |a artikel_Grundlieferung.pp |
| 035 | |a (DE-627)NLEJ246996099 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 245 | 1 | 0 | |a A Catfish Effect Inspired Harmony Search Algorithm for Optimization |
| 264 | 1 | |b De Gruyter |c 2013 | |
| 300 | |a 10 | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a This paper describes a Catfish Effect inspired harmony search algorithm. In the algorithm, two equal size harmony memories (HM) are used to cover all the variable range, and the new harmony is generated from each history one or from the whole possible solution set, following some probability rule. After the new harmony is obtained, the worst harmony in one HM will be evaluated by the new and the best harmony in the other HM, respectively. Which means that a better harmony has the effect that causing the weak HM to better themselves. These procedures proceed on until the near-optimal solution vector is obtained. Numerical comparisons of the new algorithm with several existing harmony search algorithms are presented based on some standard benchmark optimization problems from CEC2005. The results show that the new algorithm is quite promising. | ||
| 533 | |f Walter de Gruyter Online Zeitschriften | ||
| 650 | 4 | |a harmony search algorithm | |
| 650 | 4 | |a optimization problem | |
| 650 | 4 | |a harmony memory | |
| 650 | 4 | |a Catfish Effect | |
| 700 | 1 | |a Zhang, Lipu |4 oth | |
| 700 | 1 | |a Xu, Yinghong |4 oth | |
| 700 | 1 | |a Xu, Guanghui |4 oth | |
| 700 | 1 | |a Gong, Shicai |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t International journal of nonlinear sciences and numerical simulation |d Berlin : de Gruyter, 2000 |g 14(2013), 6 vom: 18. Sept., Seite 413-422 |w (DE-627)NLEJ248235796 |w (DE-600)2602467-6 |x 2191-0294 |7 nnns |
| 773 | 1 | 8 | |g volume:14 |g year:2013 |g number:6 |g day:18 |g month:09 |g pages:413-422 |g extent:10 |
| 856 | 4 | 0 | |u https://doi.org/10.1515/ijnsns-2012-0161 |z Deutschlandweit zugänglich |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a ZDB-1-DGR | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 14 |j 2013 |e 6 |b 18 |c 09 |h 413-422 |g 10 | ||
| matchkey_str |
article:21910294:2013----::ctihfetnprdamnsacagrt |
|---|---|
| hierarchy_sort_str |
2013 |
| publishDate |
2013 |
| allfields |
10.1515/ijnsns-2012-0161 doi artikel_Grundlieferung.pp (DE-627)NLEJ246996099 DE-627 ger DE-627 rakwb A Catfish Effect Inspired Harmony Search Algorithm for Optimization De Gruyter 2013 10 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This paper describes a Catfish Effect inspired harmony search algorithm. In the algorithm, two equal size harmony memories (HM) are used to cover all the variable range, and the new harmony is generated from each history one or from the whole possible solution set, following some probability rule. After the new harmony is obtained, the worst harmony in one HM will be evaluated by the new and the best harmony in the other HM, respectively. Which means that a better harmony has the effect that causing the weak HM to better themselves. These procedures proceed on until the near-optimal solution vector is obtained. Numerical comparisons of the new algorithm with several existing harmony search algorithms are presented based on some standard benchmark optimization problems from CEC2005. The results show that the new algorithm is quite promising. Walter de Gruyter Online Zeitschriften harmony search algorithm optimization problem harmony memory Catfish Effect Zhang, Lipu oth Xu, Yinghong oth Xu, Guanghui oth Gong, Shicai oth Enthalten in International journal of nonlinear sciences and numerical simulation Berlin : de Gruyter, 2000 14(2013), 6 vom: 18. Sept., Seite 413-422 (DE-627)NLEJ248235796 (DE-600)2602467-6 2191-0294 nnns volume:14 year:2013 number:6 day:18 month:09 pages:413-422 extent:10 https://doi.org/10.1515/ijnsns-2012-0161 Deutschlandweit zugänglich GBV_USEFLAG_U ZDB-1-DGR GBV_NL_ARTICLE AR 14 2013 6 18 09 413-422 10 |
| spelling |
10.1515/ijnsns-2012-0161 doi artikel_Grundlieferung.pp (DE-627)NLEJ246996099 DE-627 ger DE-627 rakwb A Catfish Effect Inspired Harmony Search Algorithm for Optimization De Gruyter 2013 10 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This paper describes a Catfish Effect inspired harmony search algorithm. In the algorithm, two equal size harmony memories (HM) are used to cover all the variable range, and the new harmony is generated from each history one or from the whole possible solution set, following some probability rule. After the new harmony is obtained, the worst harmony in one HM will be evaluated by the new and the best harmony in the other HM, respectively. Which means that a better harmony has the effect that causing the weak HM to better themselves. These procedures proceed on until the near-optimal solution vector is obtained. Numerical comparisons of the new algorithm with several existing harmony search algorithms are presented based on some standard benchmark optimization problems from CEC2005. The results show that the new algorithm is quite promising. Walter de Gruyter Online Zeitschriften harmony search algorithm optimization problem harmony memory Catfish Effect Zhang, Lipu oth Xu, Yinghong oth Xu, Guanghui oth Gong, Shicai oth Enthalten in International journal of nonlinear sciences and numerical simulation Berlin : de Gruyter, 2000 14(2013), 6 vom: 18. Sept., Seite 413-422 (DE-627)NLEJ248235796 (DE-600)2602467-6 2191-0294 nnns volume:14 year:2013 number:6 day:18 month:09 pages:413-422 extent:10 https://doi.org/10.1515/ijnsns-2012-0161 Deutschlandweit zugänglich GBV_USEFLAG_U ZDB-1-DGR GBV_NL_ARTICLE AR 14 2013 6 18 09 413-422 10 |
| allfields_unstemmed |
10.1515/ijnsns-2012-0161 doi artikel_Grundlieferung.pp (DE-627)NLEJ246996099 DE-627 ger DE-627 rakwb A Catfish Effect Inspired Harmony Search Algorithm for Optimization De Gruyter 2013 10 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This paper describes a Catfish Effect inspired harmony search algorithm. In the algorithm, two equal size harmony memories (HM) are used to cover all the variable range, and the new harmony is generated from each history one or from the whole possible solution set, following some probability rule. After the new harmony is obtained, the worst harmony in one HM will be evaluated by the new and the best harmony in the other HM, respectively. Which means that a better harmony has the effect that causing the weak HM to better themselves. These procedures proceed on until the near-optimal solution vector is obtained. Numerical comparisons of the new algorithm with several existing harmony search algorithms are presented based on some standard benchmark optimization problems from CEC2005. The results show that the new algorithm is quite promising. Walter de Gruyter Online Zeitschriften harmony search algorithm optimization problem harmony memory Catfish Effect Zhang, Lipu oth Xu, Yinghong oth Xu, Guanghui oth Gong, Shicai oth Enthalten in International journal of nonlinear sciences and numerical simulation Berlin : de Gruyter, 2000 14(2013), 6 vom: 18. Sept., Seite 413-422 (DE-627)NLEJ248235796 (DE-600)2602467-6 2191-0294 nnns volume:14 year:2013 number:6 day:18 month:09 pages:413-422 extent:10 https://doi.org/10.1515/ijnsns-2012-0161 Deutschlandweit zugänglich GBV_USEFLAG_U ZDB-1-DGR GBV_NL_ARTICLE AR 14 2013 6 18 09 413-422 10 |
| allfieldsGer |
10.1515/ijnsns-2012-0161 doi artikel_Grundlieferung.pp (DE-627)NLEJ246996099 DE-627 ger DE-627 rakwb A Catfish Effect Inspired Harmony Search Algorithm for Optimization De Gruyter 2013 10 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This paper describes a Catfish Effect inspired harmony search algorithm. In the algorithm, two equal size harmony memories (HM) are used to cover all the variable range, and the new harmony is generated from each history one or from the whole possible solution set, following some probability rule. After the new harmony is obtained, the worst harmony in one HM will be evaluated by the new and the best harmony in the other HM, respectively. Which means that a better harmony has the effect that causing the weak HM to better themselves. These procedures proceed on until the near-optimal solution vector is obtained. Numerical comparisons of the new algorithm with several existing harmony search algorithms are presented based on some standard benchmark optimization problems from CEC2005. The results show that the new algorithm is quite promising. Walter de Gruyter Online Zeitschriften harmony search algorithm optimization problem harmony memory Catfish Effect Zhang, Lipu oth Xu, Yinghong oth Xu, Guanghui oth Gong, Shicai oth Enthalten in International journal of nonlinear sciences and numerical simulation Berlin : de Gruyter, 2000 14(2013), 6 vom: 18. Sept., Seite 413-422 (DE-627)NLEJ248235796 (DE-600)2602467-6 2191-0294 nnns volume:14 year:2013 number:6 day:18 month:09 pages:413-422 extent:10 https://doi.org/10.1515/ijnsns-2012-0161 Deutschlandweit zugänglich GBV_USEFLAG_U ZDB-1-DGR GBV_NL_ARTICLE AR 14 2013 6 18 09 413-422 10 |
| allfieldsSound |
10.1515/ijnsns-2012-0161 doi artikel_Grundlieferung.pp (DE-627)NLEJ246996099 DE-627 ger DE-627 rakwb A Catfish Effect Inspired Harmony Search Algorithm for Optimization De Gruyter 2013 10 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier This paper describes a Catfish Effect inspired harmony search algorithm. In the algorithm, two equal size harmony memories (HM) are used to cover all the variable range, and the new harmony is generated from each history one or from the whole possible solution set, following some probability rule. After the new harmony is obtained, the worst harmony in one HM will be evaluated by the new and the best harmony in the other HM, respectively. Which means that a better harmony has the effect that causing the weak HM to better themselves. These procedures proceed on until the near-optimal solution vector is obtained. Numerical comparisons of the new algorithm with several existing harmony search algorithms are presented based on some standard benchmark optimization problems from CEC2005. The results show that the new algorithm is quite promising. Walter de Gruyter Online Zeitschriften harmony search algorithm optimization problem harmony memory Catfish Effect Zhang, Lipu oth Xu, Yinghong oth Xu, Guanghui oth Gong, Shicai oth Enthalten in International journal of nonlinear sciences and numerical simulation Berlin : de Gruyter, 2000 14(2013), 6 vom: 18. Sept., Seite 413-422 (DE-627)NLEJ248235796 (DE-600)2602467-6 2191-0294 nnns volume:14 year:2013 number:6 day:18 month:09 pages:413-422 extent:10 https://doi.org/10.1515/ijnsns-2012-0161 Deutschlandweit zugänglich GBV_USEFLAG_U ZDB-1-DGR GBV_NL_ARTICLE AR 14 2013 6 18 09 413-422 10 |
| source |
Enthalten in International journal of nonlinear sciences and numerical simulation 14(2013), 6 vom: 18. Sept., Seite 413-422 volume:14 year:2013 number:6 day:18 month:09 pages:413-422 extent:10 |
| sourceStr |
Enthalten in International journal of nonlinear sciences and numerical simulation 14(2013), 6 vom: 18. Sept., Seite 413-422 volume:14 year:2013 number:6 day:18 month:09 pages:413-422 extent:10 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
harmony search algorithm optimization problem harmony memory Catfish Effect |
| isfreeaccess_bool |
false |
| container_title |
International journal of nonlinear sciences and numerical simulation |
| authorswithroles_txt_mv |
Zhang, Lipu @@oth@@ Xu, Yinghong @@oth@@ Xu, Guanghui @@oth@@ Gong, Shicai @@oth@@ |
| publishDateDaySort_date |
2013-09-18T00:00:00Z |
| hierarchy_top_id |
NLEJ248235796 |
| id |
NLEJ246996099 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ246996099</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220820025252.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">220814s2013 xx |||||o 00| ||und c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/ijnsns-2012-0161</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">artikel_Grundlieferung.pp</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ246996099</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Catfish Effect Inspired Harmony Search Algorithm for Optimization</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="b">De Gruyter</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper describes a Catfish Effect inspired harmony search algorithm. In the algorithm, two equal size harmony memories (HM) are used to cover all the variable range, and the new harmony is generated from each history one or from the whole possible solution set, following some probability rule. After the new harmony is obtained, the worst harmony in one HM will be evaluated by the new and the best harmony in the other HM, respectively. Which means that a better harmony has the effect that causing the weak HM to better themselves. These procedures proceed on until the near-optimal solution vector is obtained. Numerical comparisons of the new algorithm with several existing harmony search algorithms are presented based on some standard benchmark optimization problems from CEC2005. The results show that the new algorithm is quite promising.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Walter de Gruyter Online Zeitschriften</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">harmony search algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">optimization problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">harmony memory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Catfish Effect</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Lipu</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xu, Yinghong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xu, Guanghui</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gong, Shicai</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of nonlinear sciences and numerical simulation</subfield><subfield code="d">Berlin : de Gruyter, 2000</subfield><subfield code="g">14(2013), 6 vom: 18. Sept., Seite 413-422</subfield><subfield code="w">(DE-627)NLEJ248235796</subfield><subfield code="w">(DE-600)2602467-6</subfield><subfield code="x">2191-0294</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:14</subfield><subfield code="g">year:2013</subfield><subfield code="g">number:6</subfield><subfield code="g">day:18</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:413-422</subfield><subfield code="g">extent:10</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/ijnsns-2012-0161</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-DGR</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">14</subfield><subfield code="j">2013</subfield><subfield code="e">6</subfield><subfield code="b">18</subfield><subfield code="c">09</subfield><subfield code="h">413-422</subfield><subfield code="g">10</subfield></datafield></record></collection>
|
| series2 |
Walter de Gruyter Online Zeitschriften |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ248235796 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| collection |
NL |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
2191-0294 |
| topic_title |
A Catfish Effect Inspired Harmony Search Algorithm for Optimization harmony search algorithm optimization problem harmony memory Catfish Effect |
| publisher |
De Gruyter |
| publisherStr |
De Gruyter |
| topic |
misc harmony search algorithm misc optimization problem misc harmony memory misc Catfish Effect |
| spellingShingle |
misc harmony search algorithm misc optimization problem misc harmony memory misc Catfish Effect A Catfish Effect Inspired Harmony Search Algorithm for Optimization |
| topic_unstemmed |
misc harmony search algorithm misc optimization problem misc harmony memory misc Catfish Effect |
| topic_browse |
misc harmony search algorithm misc optimization problem misc harmony memory misc Catfish Effect |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| author2_variant |
l z lz y x yx g x gx s g sg |
| hierarchy_parent_title |
International journal of nonlinear sciences and numerical simulation |
| hierarchy_parent_id |
NLEJ248235796 |
| hierarchy_top_title |
International journal of nonlinear sciences and numerical simulation |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ248235796 (DE-600)2602467-6 |
| title |
A Catfish Effect Inspired Harmony Search Algorithm for Optimization |
| ctrlnum |
(DE-627)NLEJ246996099 |
| title_full |
A Catfish Effect Inspired Harmony Search Algorithm for Optimization |
| journal |
International journal of nonlinear sciences and numerical simulation |
| journalStr |
International journal of nonlinear sciences and numerical simulation |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2013 |
| contenttype_str_mv |
txt |
| container_start_page |
413 |
| container_volume |
14 |
| physical |
10 |
| format_se |
Elektronische Aufsätze |
| doi_str_mv |
10.1515/ijnsns-2012-0161 |
| title_sort |
a catfish effect inspired harmony search algorithm for optimization |
| title_auth |
A Catfish Effect Inspired Harmony Search Algorithm for Optimization |
| abstract |
This paper describes a Catfish Effect inspired harmony search algorithm. In the algorithm, two equal size harmony memories (HM) are used to cover all the variable range, and the new harmony is generated from each history one or from the whole possible solution set, following some probability rule. After the new harmony is obtained, the worst harmony in one HM will be evaluated by the new and the best harmony in the other HM, respectively. Which means that a better harmony has the effect that causing the weak HM to better themselves. These procedures proceed on until the near-optimal solution vector is obtained. Numerical comparisons of the new algorithm with several existing harmony search algorithms are presented based on some standard benchmark optimization problems from CEC2005. The results show that the new algorithm is quite promising. |
| abstractGer |
This paper describes a Catfish Effect inspired harmony search algorithm. In the algorithm, two equal size harmony memories (HM) are used to cover all the variable range, and the new harmony is generated from each history one or from the whole possible solution set, following some probability rule. After the new harmony is obtained, the worst harmony in one HM will be evaluated by the new and the best harmony in the other HM, respectively. Which means that a better harmony has the effect that causing the weak HM to better themselves. These procedures proceed on until the near-optimal solution vector is obtained. Numerical comparisons of the new algorithm with several existing harmony search algorithms are presented based on some standard benchmark optimization problems from CEC2005. The results show that the new algorithm is quite promising. |
| abstract_unstemmed |
This paper describes a Catfish Effect inspired harmony search algorithm. In the algorithm, two equal size harmony memories (HM) are used to cover all the variable range, and the new harmony is generated from each history one or from the whole possible solution set, following some probability rule. After the new harmony is obtained, the worst harmony in one HM will be evaluated by the new and the best harmony in the other HM, respectively. Which means that a better harmony has the effect that causing the weak HM to better themselves. These procedures proceed on until the near-optimal solution vector is obtained. Numerical comparisons of the new algorithm with several existing harmony search algorithms are presented based on some standard benchmark optimization problems from CEC2005. The results show that the new algorithm is quite promising. |
| collection_details |
GBV_USEFLAG_U ZDB-1-DGR GBV_NL_ARTICLE |
| container_issue |
6 |
| title_short |
A Catfish Effect Inspired Harmony Search Algorithm for Optimization |
| url |
https://doi.org/10.1515/ijnsns-2012-0161 |
| remote_bool |
true |
| author2 |
Zhang, Lipu Xu, Yinghong Xu, Guanghui Gong, Shicai |
| author2Str |
Zhang, Lipu Xu, Yinghong Xu, Guanghui Gong, Shicai |
| ppnlink |
NLEJ248235796 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth oth |
| doi_str |
10.1515/ijnsns-2012-0161 |
| up_date |
2024-07-06T09:44:43.522Z |
| _version_ |
1803822388765261824 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ246996099</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220820025252.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">220814s2013 xx |||||o 00| ||und c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/ijnsns-2012-0161</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">artikel_Grundlieferung.pp</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ246996099</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Catfish Effect Inspired Harmony Search Algorithm for Optimization</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="b">De Gruyter</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper describes a Catfish Effect inspired harmony search algorithm. In the algorithm, two equal size harmony memories (HM) are used to cover all the variable range, and the new harmony is generated from each history one or from the whole possible solution set, following some probability rule. After the new harmony is obtained, the worst harmony in one HM will be evaluated by the new and the best harmony in the other HM, respectively. Which means that a better harmony has the effect that causing the weak HM to better themselves. These procedures proceed on until the near-optimal solution vector is obtained. Numerical comparisons of the new algorithm with several existing harmony search algorithms are presented based on some standard benchmark optimization problems from CEC2005. The results show that the new algorithm is quite promising.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Walter de Gruyter Online Zeitschriften</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">harmony search algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">optimization problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">harmony memory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Catfish Effect</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Lipu</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xu, Yinghong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xu, Guanghui</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gong, Shicai</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of nonlinear sciences and numerical simulation</subfield><subfield code="d">Berlin : de Gruyter, 2000</subfield><subfield code="g">14(2013), 6 vom: 18. Sept., Seite 413-422</subfield><subfield code="w">(DE-627)NLEJ248235796</subfield><subfield code="w">(DE-600)2602467-6</subfield><subfield code="x">2191-0294</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:14</subfield><subfield code="g">year:2013</subfield><subfield code="g">number:6</subfield><subfield code="g">day:18</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:413-422</subfield><subfield code="g">extent:10</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/ijnsns-2012-0161</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-DGR</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">14</subfield><subfield code="j">2013</subfield><subfield code="e">6</subfield><subfield code="b">18</subfield><subfield code="c">09</subfield><subfield code="h">413-422</subfield><subfield code="g">10</subfield></datafield></record></collection>
|
| score |
7.4013834 |