A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem
Abstract The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the f...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Harifi, Sasan [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2022 |
|---|
| Schlagwörter: |
Giza Pyramids Construction metaheuristic algorithm |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Soft Computing - Springer-Verlag, 2003, 26(2022), 22 vom: 12. Juli, Seite 12761-12778 |
|---|---|
| Übergeordnetes Werk: |
volume:26 ; year:2022 ; number:22 ; day:12 ; month:07 ; pages:12761-12778 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00500-022-07285-4 |
|---|
| Katalog-ID: |
SPR048255483 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR048255483 | ||
| 003 | DE-627 | ||
| 005 | 20230509112856.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 221001s2022 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00500-022-07285-4 |2 doi | |
| 035 | |a (DE-627)SPR048255483 | ||
| 035 | |a (SPR)s00500-022-07285-4-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Harifi, Sasan |e verfasserin |0 (orcid)0000-0002-6788-8222 |4 aut | |
| 245 | 1 | 2 | |a A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem |
| 264 | 1 | |c 2022 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 | ||
| 520 | |a Abstract The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms. | ||
| 650 | 4 | |a Giza Pyramids Construction metaheuristic algorithm |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a GPC algorithm |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Combinational optimization problem |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Knapsack problem |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Binary GPC algorithm |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Penalty function |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Ancient-inspired metaheuristics |7 (dpeaa)DE-He213 | |
| 773 | 0 | 8 | |i Enthalten in |t Soft Computing |d Springer-Verlag, 2003 |g 26(2022), 22 vom: 12. Juli, Seite 12761-12778 |w (DE-627)SPR006469531 |7 nnns |
| 773 | 1 | 8 | |g volume:26 |g year:2022 |g number:22 |g day:12 |g month:07 |g pages:12761-12778 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s00500-022-07285-4 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 951 | |a AR | ||
| 952 | |d 26 |j 2022 |e 22 |b 12 |c 07 |h 12761-12778 | ||
| author_variant |
s h sh |
|---|---|
| matchkey_str |
harifisasan:2022----:bnracetnprdiayaisosrcineaersiagrtm |
| hierarchy_sort_str |
2022 |
| publishDate |
2022 |
| allfields |
10.1007/s00500-022-07285-4 doi (DE-627)SPR048255483 (SPR)s00500-022-07285-4-e DE-627 ger DE-627 rakwb eng Harifi, Sasan verfasserin (orcid)0000-0002-6788-8222 aut A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 Abstract The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms. Giza Pyramids Construction metaheuristic algorithm (dpeaa)DE-He213 GPC algorithm (dpeaa)DE-He213 Combinational optimization problem (dpeaa)DE-He213 Knapsack problem (dpeaa)DE-He213 Binary GPC algorithm (dpeaa)DE-He213 Penalty function (dpeaa)DE-He213 Ancient-inspired metaheuristics (dpeaa)DE-He213 Enthalten in Soft Computing Springer-Verlag, 2003 26(2022), 22 vom: 12. Juli, Seite 12761-12778 (DE-627)SPR006469531 nnns volume:26 year:2022 number:22 day:12 month:07 pages:12761-12778 https://dx.doi.org/10.1007/s00500-022-07285-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 26 2022 22 12 07 12761-12778 |
| spelling |
10.1007/s00500-022-07285-4 doi (DE-627)SPR048255483 (SPR)s00500-022-07285-4-e DE-627 ger DE-627 rakwb eng Harifi, Sasan verfasserin (orcid)0000-0002-6788-8222 aut A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 Abstract The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms. Giza Pyramids Construction metaheuristic algorithm (dpeaa)DE-He213 GPC algorithm (dpeaa)DE-He213 Combinational optimization problem (dpeaa)DE-He213 Knapsack problem (dpeaa)DE-He213 Binary GPC algorithm (dpeaa)DE-He213 Penalty function (dpeaa)DE-He213 Ancient-inspired metaheuristics (dpeaa)DE-He213 Enthalten in Soft Computing Springer-Verlag, 2003 26(2022), 22 vom: 12. Juli, Seite 12761-12778 (DE-627)SPR006469531 nnns volume:26 year:2022 number:22 day:12 month:07 pages:12761-12778 https://dx.doi.org/10.1007/s00500-022-07285-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 26 2022 22 12 07 12761-12778 |
| allfields_unstemmed |
10.1007/s00500-022-07285-4 doi (DE-627)SPR048255483 (SPR)s00500-022-07285-4-e DE-627 ger DE-627 rakwb eng Harifi, Sasan verfasserin (orcid)0000-0002-6788-8222 aut A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 Abstract The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms. Giza Pyramids Construction metaheuristic algorithm (dpeaa)DE-He213 GPC algorithm (dpeaa)DE-He213 Combinational optimization problem (dpeaa)DE-He213 Knapsack problem (dpeaa)DE-He213 Binary GPC algorithm (dpeaa)DE-He213 Penalty function (dpeaa)DE-He213 Ancient-inspired metaheuristics (dpeaa)DE-He213 Enthalten in Soft Computing Springer-Verlag, 2003 26(2022), 22 vom: 12. Juli, Seite 12761-12778 (DE-627)SPR006469531 nnns volume:26 year:2022 number:22 day:12 month:07 pages:12761-12778 https://dx.doi.org/10.1007/s00500-022-07285-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 26 2022 22 12 07 12761-12778 |
| allfieldsGer |
10.1007/s00500-022-07285-4 doi (DE-627)SPR048255483 (SPR)s00500-022-07285-4-e DE-627 ger DE-627 rakwb eng Harifi, Sasan verfasserin (orcid)0000-0002-6788-8222 aut A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 Abstract The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms. Giza Pyramids Construction metaheuristic algorithm (dpeaa)DE-He213 GPC algorithm (dpeaa)DE-He213 Combinational optimization problem (dpeaa)DE-He213 Knapsack problem (dpeaa)DE-He213 Binary GPC algorithm (dpeaa)DE-He213 Penalty function (dpeaa)DE-He213 Ancient-inspired metaheuristics (dpeaa)DE-He213 Enthalten in Soft Computing Springer-Verlag, 2003 26(2022), 22 vom: 12. Juli, Seite 12761-12778 (DE-627)SPR006469531 nnns volume:26 year:2022 number:22 day:12 month:07 pages:12761-12778 https://dx.doi.org/10.1007/s00500-022-07285-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 26 2022 22 12 07 12761-12778 |
| allfieldsSound |
10.1007/s00500-022-07285-4 doi (DE-627)SPR048255483 (SPR)s00500-022-07285-4-e DE-627 ger DE-627 rakwb eng Harifi, Sasan verfasserin (orcid)0000-0002-6788-8222 aut A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 Abstract The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms. Giza Pyramids Construction metaheuristic algorithm (dpeaa)DE-He213 GPC algorithm (dpeaa)DE-He213 Combinational optimization problem (dpeaa)DE-He213 Knapsack problem (dpeaa)DE-He213 Binary GPC algorithm (dpeaa)DE-He213 Penalty function (dpeaa)DE-He213 Ancient-inspired metaheuristics (dpeaa)DE-He213 Enthalten in Soft Computing Springer-Verlag, 2003 26(2022), 22 vom: 12. Juli, Seite 12761-12778 (DE-627)SPR006469531 nnns volume:26 year:2022 number:22 day:12 month:07 pages:12761-12778 https://dx.doi.org/10.1007/s00500-022-07285-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 26 2022 22 12 07 12761-12778 |
| language |
English |
| source |
Enthalten in Soft Computing 26(2022), 22 vom: 12. Juli, Seite 12761-12778 volume:26 year:2022 number:22 day:12 month:07 pages:12761-12778 |
| sourceStr |
Enthalten in Soft Computing 26(2022), 22 vom: 12. Juli, Seite 12761-12778 volume:26 year:2022 number:22 day:12 month:07 pages:12761-12778 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Giza Pyramids Construction metaheuristic algorithm GPC algorithm Combinational optimization problem Knapsack problem Binary GPC algorithm Penalty function Ancient-inspired metaheuristics |
| isfreeaccess_bool |
false |
| container_title |
Soft Computing |
| authorswithroles_txt_mv |
Harifi, Sasan @@aut@@ |
| publishDateDaySort_date |
2022-07-12T00:00:00Z |
| hierarchy_top_id |
SPR006469531 |
| id |
SPR048255483 |
| 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">SPR048255483</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230509112856.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">221001s2022 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-022-07285-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR048255483</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s00500-022-07285-4-e</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="100" ind1="1" ind2=" "><subfield code="a">Harifi, Sasan</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-6788-8222</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</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="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Giza Pyramids Construction metaheuristic algorithm</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">GPC algorithm</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinational optimization problem</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knapsack problem</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Binary GPC algorithm</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Penalty function</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ancient-inspired metaheuristics</subfield><subfield code="7">(dpeaa)DE-He213</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-Verlag, 2003</subfield><subfield code="g">26(2022), 22 vom: 12. Juli, Seite 12761-12778</subfield><subfield code="w">(DE-627)SPR006469531</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:26</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:22</subfield><subfield code="g">day:12</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:12761-12778</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s00500-022-07285-4</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_SPRINGER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">26</subfield><subfield code="j">2022</subfield><subfield code="e">22</subfield><subfield code="b">12</subfield><subfield code="c">07</subfield><subfield code="h">12761-12778</subfield></datafield></record></collection>
|
| author |
Harifi, Sasan |
| spellingShingle |
Harifi, Sasan misc Giza Pyramids Construction metaheuristic algorithm misc GPC algorithm misc Combinational optimization problem misc Knapsack problem misc Binary GPC algorithm misc Penalty function misc Ancient-inspired metaheuristics A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem |
| authorStr |
Harifi, Sasan |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)SPR006469531 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem Giza Pyramids Construction metaheuristic algorithm (dpeaa)DE-He213 GPC algorithm (dpeaa)DE-He213 Combinational optimization problem (dpeaa)DE-He213 Knapsack problem (dpeaa)DE-He213 Binary GPC algorithm (dpeaa)DE-He213 Penalty function (dpeaa)DE-He213 Ancient-inspired metaheuristics (dpeaa)DE-He213 |
| topic |
misc Giza Pyramids Construction metaheuristic algorithm misc GPC algorithm misc Combinational optimization problem misc Knapsack problem misc Binary GPC algorithm misc Penalty function misc Ancient-inspired metaheuristics |
| topic_unstemmed |
misc Giza Pyramids Construction metaheuristic algorithm misc GPC algorithm misc Combinational optimization problem misc Knapsack problem misc Binary GPC algorithm misc Penalty function misc Ancient-inspired metaheuristics |
| topic_browse |
misc Giza Pyramids Construction metaheuristic algorithm misc GPC algorithm misc Combinational optimization problem misc Knapsack problem misc Binary GPC algorithm misc Penalty function misc Ancient-inspired metaheuristics |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
Soft Computing |
| hierarchy_parent_id |
SPR006469531 |
| hierarchy_top_title |
Soft Computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)SPR006469531 |
| title |
A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem |
| ctrlnum |
(DE-627)SPR048255483 (SPR)s00500-022-07285-4-e |
| title_full |
A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem |
| author_sort |
Harifi, Sasan |
| journal |
Soft Computing |
| journalStr |
Soft Computing |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2022 |
| contenttype_str_mv |
txt |
| container_start_page |
12761 |
| author_browse |
Harifi, Sasan |
| container_volume |
26 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Harifi, Sasan |
| doi_str_mv |
10.1007/s00500-022-07285-4 |
| normlink |
(ORCID)0000-0002-6788-8222 |
| normlink_prefix_str_mv |
(orcid)0000-0002-6788-8222 |
| title_sort |
binary ancient-inspired giza pyramids construction metaheuristic algorithm for solving 0-1 knapsack problem |
| title_auth |
A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem |
| abstract |
Abstract The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 |
| abstractGer |
Abstract The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 |
| abstract_unstemmed |
Abstract The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER |
| container_issue |
22 |
| title_short |
A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem |
| url |
https://dx.doi.org/10.1007/s00500-022-07285-4 |
| remote_bool |
true |
| ppnlink |
SPR006469531 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00500-022-07285-4 |
| up_date |
2024-07-03T18:02:16.201Z |
| _version_ |
1803581900669845504 |
| 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">SPR048255483</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230509112856.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">221001s2022 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-022-07285-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR048255483</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s00500-022-07285-4-e</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="100" ind1="1" ind2=" "><subfield code="a">Harifi, Sasan</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-6788-8222</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</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="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Giza Pyramids Construction metaheuristic algorithm</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">GPC algorithm</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinational optimization problem</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knapsack problem</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Binary GPC algorithm</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Penalty function</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ancient-inspired metaheuristics</subfield><subfield code="7">(dpeaa)DE-He213</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-Verlag, 2003</subfield><subfield code="g">26(2022), 22 vom: 12. Juli, Seite 12761-12778</subfield><subfield code="w">(DE-627)SPR006469531</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:26</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:22</subfield><subfield code="g">day:12</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:12761-12778</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s00500-022-07285-4</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_SPRINGER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">26</subfield><subfield code="j">2022</subfield><subfield code="e">22</subfield><subfield code="b">12</subfield><subfield code="c">07</subfield><subfield code="h">12761-12778</subfield></datafield></record></collection>
|
| score |
7.398551 |