Chaotic fitness-dependent optimizer for planning and engineering design
Abstract Fitness-dependent optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to particle swarm optimization, but it works differently. The algorithm is very powerful and has better results com...
Ausführliche Beschreibung
Autor*in: |
Mohammed, Hardi M. [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2021 |
---|
Schlagwörter: |
Chaotic fitness-dependent optimizer |
---|
Anmerkung: |
© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 |
---|
Übergeordnetes Werk: |
Enthalten in: Soft computing - Springer Berlin Heidelberg, 1997, 25(2021), 22 vom: 17. Aug., Seite 14281-14295 |
---|---|
Übergeordnetes Werk: |
volume:25 ; year:2021 ; number:22 ; day:17 ; month:08 ; pages:14281-14295 |
Links: |
---|
DOI / URN: |
10.1007/s00500-021-06135-z |
---|
Katalog-ID: |
OLC2077243856 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | OLC2077243856 | ||
003 | DE-627 | ||
005 | 20230505142223.0 | ||
007 | tu | ||
008 | 221220s2021 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1007/s00500-021-06135-z |2 doi | |
035 | |a (DE-627)OLC2077243856 | ||
035 | |a (DE-He213)s00500-021-06135-z-p | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |q VZ |
082 | 0 | 4 | |a 004 |q VZ |
084 | |a 11 |2 ssgn | ||
100 | 1 | |a Mohammed, Hardi M. |e verfasserin |0 (orcid)0000-0002-9766-9100 |4 aut | |
245 | 1 | 0 | |a Chaotic fitness-dependent optimizer for planning and engineering design |
264 | 1 | |c 2021 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
338 | |a Band |b nc |2 rdacarrier | ||
500 | |a © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 | ||
520 | |a Abstract Fitness-dependent optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to particle swarm optimization, but it works differently. The algorithm is very powerful and has better results compared to other common metaheuristic algorithms. This paper aims at improving the performance of FDO; thus, the chaotic theory is used inside FDO to propose chaotic FDO (CFDO). Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima. New technic is used to conduct population in specific limitation since FDO technic has a problem to amend population. The proposed CFDO is evaluated by using 10 benchmark functions from CEC2019. Finally, the results show that the ability of CFDO is improved. Singer map has a great impact on improving CFDO, while the Tent map is the worst. Results show that CFDO is superior to GA, FDO, and CSO. Both CEC2013 and CEC2005 are used to evaluate CFDO. Finally, the proposed CFDO is applied to classical engineering problems, such as pressure vessel design and the result shows that CFDO can handle the problem better than WOA, GWO, FDO, and CGWO. Besides, CFDO is applied to solve the task assignment problem and then compared to the original FDO. The results prove that CFDO has better capability to solve the problem. | ||
650 | 4 | |a Fitness-dependent optimizer | |
650 | 4 | |a Chaotic maps | |
650 | 4 | |a Chaotic fitness-dependent optimizer | |
650 | 4 | |a Benchmark functions | |
650 | 4 | |a Pressure vessel design problem | |
650 | 4 | |a Task assignment problem | |
700 | 1 | |a Rashid, Tarik A. |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Soft computing |d Springer Berlin Heidelberg, 1997 |g 25(2021), 22 vom: 17. Aug., Seite 14281-14295 |w (DE-627)231970536 |w (DE-600)1387526-7 |w (DE-576)060238259 |x 1432-7643 |7 nnns |
773 | 1 | 8 | |g volume:25 |g year:2021 |g number:22 |g day:17 |g month:08 |g pages:14281-14295 |
856 | 4 | 1 | |u https://doi.org/10.1007/s00500-021-06135-z |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-MAT | ||
912 | |a GBV_ILN_267 | ||
912 | |a GBV_ILN_2018 | ||
912 | |a GBV_ILN_4277 | ||
951 | |a AR | ||
952 | |d 25 |j 2021 |e 22 |b 17 |c 08 |h 14281-14295 |
author_variant |
h m m hm hmm t a r ta tar |
---|---|
matchkey_str |
article:14327643:2021----::hoifteseednotmzropanna |
hierarchy_sort_str |
2021 |
publishDate |
2021 |
allfields |
10.1007/s00500-021-06135-z doi (DE-627)OLC2077243856 (DE-He213)s00500-021-06135-z-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Mohammed, Hardi M. verfasserin (orcid)0000-0002-9766-9100 aut Chaotic fitness-dependent optimizer for planning and engineering design 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 Abstract Fitness-dependent optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to particle swarm optimization, but it works differently. The algorithm is very powerful and has better results compared to other common metaheuristic algorithms. This paper aims at improving the performance of FDO; thus, the chaotic theory is used inside FDO to propose chaotic FDO (CFDO). Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima. New technic is used to conduct population in specific limitation since FDO technic has a problem to amend population. The proposed CFDO is evaluated by using 10 benchmark functions from CEC2019. Finally, the results show that the ability of CFDO is improved. Singer map has a great impact on improving CFDO, while the Tent map is the worst. Results show that CFDO is superior to GA, FDO, and CSO. Both CEC2013 and CEC2005 are used to evaluate CFDO. Finally, the proposed CFDO is applied to classical engineering problems, such as pressure vessel design and the result shows that CFDO can handle the problem better than WOA, GWO, FDO, and CGWO. Besides, CFDO is applied to solve the task assignment problem and then compared to the original FDO. The results prove that CFDO has better capability to solve the problem. Fitness-dependent optimizer Chaotic maps Chaotic fitness-dependent optimizer Benchmark functions Pressure vessel design problem Task assignment problem Rashid, Tarik A. aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 25(2021), 22 vom: 17. Aug., Seite 14281-14295 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:25 year:2021 number:22 day:17 month:08 pages:14281-14295 https://doi.org/10.1007/s00500-021-06135-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 25 2021 22 17 08 14281-14295 |
spelling |
10.1007/s00500-021-06135-z doi (DE-627)OLC2077243856 (DE-He213)s00500-021-06135-z-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Mohammed, Hardi M. verfasserin (orcid)0000-0002-9766-9100 aut Chaotic fitness-dependent optimizer for planning and engineering design 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 Abstract Fitness-dependent optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to particle swarm optimization, but it works differently. The algorithm is very powerful and has better results compared to other common metaheuristic algorithms. This paper aims at improving the performance of FDO; thus, the chaotic theory is used inside FDO to propose chaotic FDO (CFDO). Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima. New technic is used to conduct population in specific limitation since FDO technic has a problem to amend population. The proposed CFDO is evaluated by using 10 benchmark functions from CEC2019. Finally, the results show that the ability of CFDO is improved. Singer map has a great impact on improving CFDO, while the Tent map is the worst. Results show that CFDO is superior to GA, FDO, and CSO. Both CEC2013 and CEC2005 are used to evaluate CFDO. Finally, the proposed CFDO is applied to classical engineering problems, such as pressure vessel design and the result shows that CFDO can handle the problem better than WOA, GWO, FDO, and CGWO. Besides, CFDO is applied to solve the task assignment problem and then compared to the original FDO. The results prove that CFDO has better capability to solve the problem. Fitness-dependent optimizer Chaotic maps Chaotic fitness-dependent optimizer Benchmark functions Pressure vessel design problem Task assignment problem Rashid, Tarik A. aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 25(2021), 22 vom: 17. Aug., Seite 14281-14295 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:25 year:2021 number:22 day:17 month:08 pages:14281-14295 https://doi.org/10.1007/s00500-021-06135-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 25 2021 22 17 08 14281-14295 |
allfields_unstemmed |
10.1007/s00500-021-06135-z doi (DE-627)OLC2077243856 (DE-He213)s00500-021-06135-z-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Mohammed, Hardi M. verfasserin (orcid)0000-0002-9766-9100 aut Chaotic fitness-dependent optimizer for planning and engineering design 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 Abstract Fitness-dependent optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to particle swarm optimization, but it works differently. The algorithm is very powerful and has better results compared to other common metaheuristic algorithms. This paper aims at improving the performance of FDO; thus, the chaotic theory is used inside FDO to propose chaotic FDO (CFDO). Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima. New technic is used to conduct population in specific limitation since FDO technic has a problem to amend population. The proposed CFDO is evaluated by using 10 benchmark functions from CEC2019. Finally, the results show that the ability of CFDO is improved. Singer map has a great impact on improving CFDO, while the Tent map is the worst. Results show that CFDO is superior to GA, FDO, and CSO. Both CEC2013 and CEC2005 are used to evaluate CFDO. Finally, the proposed CFDO is applied to classical engineering problems, such as pressure vessel design and the result shows that CFDO can handle the problem better than WOA, GWO, FDO, and CGWO. Besides, CFDO is applied to solve the task assignment problem and then compared to the original FDO. The results prove that CFDO has better capability to solve the problem. Fitness-dependent optimizer Chaotic maps Chaotic fitness-dependent optimizer Benchmark functions Pressure vessel design problem Task assignment problem Rashid, Tarik A. aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 25(2021), 22 vom: 17. Aug., Seite 14281-14295 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:25 year:2021 number:22 day:17 month:08 pages:14281-14295 https://doi.org/10.1007/s00500-021-06135-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 25 2021 22 17 08 14281-14295 |
allfieldsGer |
10.1007/s00500-021-06135-z doi (DE-627)OLC2077243856 (DE-He213)s00500-021-06135-z-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Mohammed, Hardi M. verfasserin (orcid)0000-0002-9766-9100 aut Chaotic fitness-dependent optimizer for planning and engineering design 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 Abstract Fitness-dependent optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to particle swarm optimization, but it works differently. The algorithm is very powerful and has better results compared to other common metaheuristic algorithms. This paper aims at improving the performance of FDO; thus, the chaotic theory is used inside FDO to propose chaotic FDO (CFDO). Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima. New technic is used to conduct population in specific limitation since FDO technic has a problem to amend population. The proposed CFDO is evaluated by using 10 benchmark functions from CEC2019. Finally, the results show that the ability of CFDO is improved. Singer map has a great impact on improving CFDO, while the Tent map is the worst. Results show that CFDO is superior to GA, FDO, and CSO. Both CEC2013 and CEC2005 are used to evaluate CFDO. Finally, the proposed CFDO is applied to classical engineering problems, such as pressure vessel design and the result shows that CFDO can handle the problem better than WOA, GWO, FDO, and CGWO. Besides, CFDO is applied to solve the task assignment problem and then compared to the original FDO. The results prove that CFDO has better capability to solve the problem. Fitness-dependent optimizer Chaotic maps Chaotic fitness-dependent optimizer Benchmark functions Pressure vessel design problem Task assignment problem Rashid, Tarik A. aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 25(2021), 22 vom: 17. Aug., Seite 14281-14295 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:25 year:2021 number:22 day:17 month:08 pages:14281-14295 https://doi.org/10.1007/s00500-021-06135-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 25 2021 22 17 08 14281-14295 |
allfieldsSound |
10.1007/s00500-021-06135-z doi (DE-627)OLC2077243856 (DE-He213)s00500-021-06135-z-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Mohammed, Hardi M. verfasserin (orcid)0000-0002-9766-9100 aut Chaotic fitness-dependent optimizer for planning and engineering design 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 Abstract Fitness-dependent optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to particle swarm optimization, but it works differently. The algorithm is very powerful and has better results compared to other common metaheuristic algorithms. This paper aims at improving the performance of FDO; thus, the chaotic theory is used inside FDO to propose chaotic FDO (CFDO). Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima. New technic is used to conduct population in specific limitation since FDO technic has a problem to amend population. The proposed CFDO is evaluated by using 10 benchmark functions from CEC2019. Finally, the results show that the ability of CFDO is improved. Singer map has a great impact on improving CFDO, while the Tent map is the worst. Results show that CFDO is superior to GA, FDO, and CSO. Both CEC2013 and CEC2005 are used to evaluate CFDO. Finally, the proposed CFDO is applied to classical engineering problems, such as pressure vessel design and the result shows that CFDO can handle the problem better than WOA, GWO, FDO, and CGWO. Besides, CFDO is applied to solve the task assignment problem and then compared to the original FDO. The results prove that CFDO has better capability to solve the problem. Fitness-dependent optimizer Chaotic maps Chaotic fitness-dependent optimizer Benchmark functions Pressure vessel design problem Task assignment problem Rashid, Tarik A. aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 25(2021), 22 vom: 17. Aug., Seite 14281-14295 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:25 year:2021 number:22 day:17 month:08 pages:14281-14295 https://doi.org/10.1007/s00500-021-06135-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 25 2021 22 17 08 14281-14295 |
language |
English |
source |
Enthalten in Soft computing 25(2021), 22 vom: 17. Aug., Seite 14281-14295 volume:25 year:2021 number:22 day:17 month:08 pages:14281-14295 |
sourceStr |
Enthalten in Soft computing 25(2021), 22 vom: 17. Aug., Seite 14281-14295 volume:25 year:2021 number:22 day:17 month:08 pages:14281-14295 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Fitness-dependent optimizer Chaotic maps Chaotic fitness-dependent optimizer Benchmark functions Pressure vessel design problem Task assignment problem |
dewey-raw |
004 |
isfreeaccess_bool |
false |
container_title |
Soft computing |
authorswithroles_txt_mv |
Mohammed, Hardi M. @@aut@@ Rashid, Tarik A. @@aut@@ |
publishDateDaySort_date |
2021-08-17T00:00:00Z |
hierarchy_top_id |
231970536 |
dewey-sort |
14 |
id |
OLC2077243856 |
language_de |
englisch |
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">OLC2077243856</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505142223.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-021-06135-z</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2077243856</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00500-021-06135-z-p</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="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mohammed, Hardi M.</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-9766-9100</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Chaotic fitness-dependent optimizer for planning and engineering design</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</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">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Fitness-dependent optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to particle swarm optimization, but it works differently. The algorithm is very powerful and has better results compared to other common metaheuristic algorithms. This paper aims at improving the performance of FDO; thus, the chaotic theory is used inside FDO to propose chaotic FDO (CFDO). Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima. New technic is used to conduct population in specific limitation since FDO technic has a problem to amend population. The proposed CFDO is evaluated by using 10 benchmark functions from CEC2019. Finally, the results show that the ability of CFDO is improved. Singer map has a great impact on improving CFDO, while the Tent map is the worst. Results show that CFDO is superior to GA, FDO, and CSO. Both CEC2013 and CEC2005 are used to evaluate CFDO. Finally, the proposed CFDO is applied to classical engineering problems, such as pressure vessel design and the result shows that CFDO can handle the problem better than WOA, GWO, FDO, and CGWO. Besides, CFDO is applied to solve the task assignment problem and then compared to the original FDO. The results prove that CFDO has better capability to solve the problem.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fitness-dependent optimizer</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Chaotic maps</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Chaotic fitness-dependent optimizer</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Benchmark functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pressure vessel design problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Task assignment problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rashid, Tarik A.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft computing</subfield><subfield code="d">Springer Berlin Heidelberg, 1997</subfield><subfield code="g">25(2021), 22 vom: 17. Aug., Seite 14281-14295</subfield><subfield code="w">(DE-627)231970536</subfield><subfield code="w">(DE-600)1387526-7</subfield><subfield code="w">(DE-576)060238259</subfield><subfield code="x">1432-7643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:22</subfield><subfield code="g">day:17</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:14281-14295</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00500-021-06135-z</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2021</subfield><subfield code="e">22</subfield><subfield code="b">17</subfield><subfield code="c">08</subfield><subfield code="h">14281-14295</subfield></datafield></record></collection>
|
author |
Mohammed, Hardi M. |
spellingShingle |
Mohammed, Hardi M. ddc 004 ssgn 11 misc Fitness-dependent optimizer misc Chaotic maps misc Chaotic fitness-dependent optimizer misc Benchmark functions misc Pressure vessel design problem misc Task assignment problem Chaotic fitness-dependent optimizer for planning and engineering design |
authorStr |
Mohammed, Hardi M. |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)231970536 |
format |
Article |
dewey-ones |
004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
1432-7643 |
topic_title |
004 VZ 11 ssgn Chaotic fitness-dependent optimizer for planning and engineering design Fitness-dependent optimizer Chaotic maps Chaotic fitness-dependent optimizer Benchmark functions Pressure vessel design problem Task assignment problem |
topic |
ddc 004 ssgn 11 misc Fitness-dependent optimizer misc Chaotic maps misc Chaotic fitness-dependent optimizer misc Benchmark functions misc Pressure vessel design problem misc Task assignment problem |
topic_unstemmed |
ddc 004 ssgn 11 misc Fitness-dependent optimizer misc Chaotic maps misc Chaotic fitness-dependent optimizer misc Benchmark functions misc Pressure vessel design problem misc Task assignment problem |
topic_browse |
ddc 004 ssgn 11 misc Fitness-dependent optimizer misc Chaotic maps misc Chaotic fitness-dependent optimizer misc Benchmark functions misc Pressure vessel design problem misc Task assignment problem |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
hierarchy_parent_title |
Soft computing |
hierarchy_parent_id |
231970536 |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Soft computing |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 |
title |
Chaotic fitness-dependent optimizer for planning and engineering design |
ctrlnum |
(DE-627)OLC2077243856 (DE-He213)s00500-021-06135-z-p |
title_full |
Chaotic fitness-dependent optimizer for planning and engineering design |
author_sort |
Mohammed, Hardi M. |
journal |
Soft computing |
journalStr |
Soft computing |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2021 |
contenttype_str_mv |
txt |
container_start_page |
14281 |
author_browse |
Mohammed, Hardi M. Rashid, Tarik A. |
container_volume |
25 |
class |
004 VZ 11 ssgn |
format_se |
Aufsätze |
author-letter |
Mohammed, Hardi M. |
doi_str_mv |
10.1007/s00500-021-06135-z |
normlink |
(ORCID)0000-0002-9766-9100 |
normlink_prefix_str_mv |
(orcid)0000-0002-9766-9100 |
dewey-full |
004 |
title_sort |
chaotic fitness-dependent optimizer for planning and engineering design |
title_auth |
Chaotic fitness-dependent optimizer for planning and engineering design |
abstract |
Abstract Fitness-dependent optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to particle swarm optimization, but it works differently. The algorithm is very powerful and has better results compared to other common metaheuristic algorithms. This paper aims at improving the performance of FDO; thus, the chaotic theory is used inside FDO to propose chaotic FDO (CFDO). Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima. New technic is used to conduct population in specific limitation since FDO technic has a problem to amend population. The proposed CFDO is evaluated by using 10 benchmark functions from CEC2019. Finally, the results show that the ability of CFDO is improved. Singer map has a great impact on improving CFDO, while the Tent map is the worst. Results show that CFDO is superior to GA, FDO, and CSO. Both CEC2013 and CEC2005 are used to evaluate CFDO. Finally, the proposed CFDO is applied to classical engineering problems, such as pressure vessel design and the result shows that CFDO can handle the problem better than WOA, GWO, FDO, and CGWO. Besides, CFDO is applied to solve the task assignment problem and then compared to the original FDO. The results prove that CFDO has better capability to solve the problem. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 |
abstractGer |
Abstract Fitness-dependent optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to particle swarm optimization, but it works differently. The algorithm is very powerful and has better results compared to other common metaheuristic algorithms. This paper aims at improving the performance of FDO; thus, the chaotic theory is used inside FDO to propose chaotic FDO (CFDO). Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima. New technic is used to conduct population in specific limitation since FDO technic has a problem to amend population. The proposed CFDO is evaluated by using 10 benchmark functions from CEC2019. Finally, the results show that the ability of CFDO is improved. Singer map has a great impact on improving CFDO, while the Tent map is the worst. Results show that CFDO is superior to GA, FDO, and CSO. Both CEC2013 and CEC2005 are used to evaluate CFDO. Finally, the proposed CFDO is applied to classical engineering problems, such as pressure vessel design and the result shows that CFDO can handle the problem better than WOA, GWO, FDO, and CGWO. Besides, CFDO is applied to solve the task assignment problem and then compared to the original FDO. The results prove that CFDO has better capability to solve the problem. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 |
abstract_unstemmed |
Abstract Fitness-dependent optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to particle swarm optimization, but it works differently. The algorithm is very powerful and has better results compared to other common metaheuristic algorithms. This paper aims at improving the performance of FDO; thus, the chaotic theory is used inside FDO to propose chaotic FDO (CFDO). Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima. New technic is used to conduct population in specific limitation since FDO technic has a problem to amend population. The proposed CFDO is evaluated by using 10 benchmark functions from CEC2019. Finally, the results show that the ability of CFDO is improved. Singer map has a great impact on improving CFDO, while the Tent map is the worst. Results show that CFDO is superior to GA, FDO, and CSO. Both CEC2013 and CEC2005 are used to evaluate CFDO. Finally, the proposed CFDO is applied to classical engineering problems, such as pressure vessel design and the result shows that CFDO can handle the problem better than WOA, GWO, FDO, and CGWO. Besides, CFDO is applied to solve the task assignment problem and then compared to the original FDO. The results prove that CFDO has better capability to solve the problem. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 |
container_issue |
22 |
title_short |
Chaotic fitness-dependent optimizer for planning and engineering design |
url |
https://doi.org/10.1007/s00500-021-06135-z |
remote_bool |
false |
author2 |
Rashid, Tarik A. |
author2Str |
Rashid, Tarik A. |
ppnlink |
231970536 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s00500-021-06135-z |
up_date |
2024-07-03T14:32:24.189Z |
_version_ |
1803568696983027712 |
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">OLC2077243856</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505142223.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-021-06135-z</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2077243856</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00500-021-06135-z-p</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="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mohammed, Hardi M.</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-9766-9100</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Chaotic fitness-dependent optimizer for planning and engineering design</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</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">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Fitness-dependent optimizer (FDO) is a recent metaheuristic algorithm that mimics the reproduction behavior of the bee swarm in finding better hives. This algorithm is similar to particle swarm optimization, but it works differently. The algorithm is very powerful and has better results compared to other common metaheuristic algorithms. This paper aims at improving the performance of FDO; thus, the chaotic theory is used inside FDO to propose chaotic FDO (CFDO). Ten chaotic maps are used in the CFDO to consider which of them are performing well to avoid local optima and finding global optima. New technic is used to conduct population in specific limitation since FDO technic has a problem to amend population. The proposed CFDO is evaluated by using 10 benchmark functions from CEC2019. Finally, the results show that the ability of CFDO is improved. Singer map has a great impact on improving CFDO, while the Tent map is the worst. Results show that CFDO is superior to GA, FDO, and CSO. Both CEC2013 and CEC2005 are used to evaluate CFDO. Finally, the proposed CFDO is applied to classical engineering problems, such as pressure vessel design and the result shows that CFDO can handle the problem better than WOA, GWO, FDO, and CGWO. Besides, CFDO is applied to solve the task assignment problem and then compared to the original FDO. The results prove that CFDO has better capability to solve the problem.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fitness-dependent optimizer</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Chaotic maps</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Chaotic fitness-dependent optimizer</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Benchmark functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pressure vessel design problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Task assignment problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rashid, Tarik A.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft computing</subfield><subfield code="d">Springer Berlin Heidelberg, 1997</subfield><subfield code="g">25(2021), 22 vom: 17. Aug., Seite 14281-14295</subfield><subfield code="w">(DE-627)231970536</subfield><subfield code="w">(DE-600)1387526-7</subfield><subfield code="w">(DE-576)060238259</subfield><subfield code="x">1432-7643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:22</subfield><subfield code="g">day:17</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:14281-14295</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00500-021-06135-z</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2021</subfield><subfield code="e">22</subfield><subfield code="b">17</subfield><subfield code="c">08</subfield><subfield code="h">14281-14295</subfield></datafield></record></collection>
|
score |
7.4005623 |