Gold rush optimizer. a new population-based metaheuristic algorithm

Today’s world is characterised by competitive environments, optimal resource utilization, and cost reduction, which has resulted in an increasing role for metaheuristic algorithms in solving complex modern problems. As a result, this paper introduces the gold rush optimizer (GRO), a population-based...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research and decisions Jg. 33; H. 1; S. 113 - 150
1. Verfasser: Zolfi, Kamran
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Wrocław University of Science and Technology 2023
ISSN:2081-8858, 2391-6060
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Today’s world is characterised by competitive environments, optimal resource utilization, and cost reduction, which has resulted in an increasing role for metaheuristic algorithms in solving complex modern problems. As a result, this paper introduces the gold rush optimizer (GRO), a population-based metaheuristic algorithm that simulates how gold-seekers prospected for gold during the Gold Rush Era using three key concepts of gold prospecting: migration, collaboration, and panning. The GRO algorithm is compared to twelve well-known metaheuristic algorithms on 29 benchmark test cases to assess the proposed approach’s performance. For scientific evaluation, the Friedman and Wilcoxon signed-rank tests are used. In addition to these test cases, the GRO algorithm is evaluated using three real-world engineering problems. The results indicated that the proposed algorithm was more capable than other algorithms in proposing qualitative and competitive solutions.
AbstractList Today's world is characterised by competitive environments, optimal resource utilization, and cost reduction, which has resulted in an increasing role for metaheuristic algorithms in solving complex modern problems. As a result, this paper introduces the gold rush optimizer (GRO), a population-based metaheuristic algorithm that simulates how gold-seekers prospected for gold during the Gold Rush Era using three key concepts of gold prospecting: migration, collaboration, and panning. The GRO algorithm is compared to twelve well-known metaheuristic algorithms on 29 benchmark test cases to assess the pro- posed approach's performance. For scientific evaluation, the Friedman and Wilcoxon signed-rank tests are used. In addition to these test cases, the GRO algorithm is evaluated using three real-world engineering problems. The results indicated that the proposed algorithm was more capable than other algorithms in proposing qualitative and competitive solutions. (original abstract)
Today’s world is characterised by competitive environments, optimal resource utilization, and cost reduction, which has resulted in an increasing role for metaheuristic algorithms in solving complex modern problems. As a result, this paper introduces the gold rush optimizer (GRO), a population-based metaheuristic algorithm that simulates how gold-seekers prospected for gold during the Gold Rush Era using three key concepts of gold prospecting: migration, collaboration, and panning. The GRO algorithm is compared to twelve well-known metaheuristic algorithms on 29 benchmark test cases to assess the proposed approach’s performance. For scientific evaluation, the Friedman and Wilcoxon signed-rank tests are used. In addition to these test cases, the GRO algorithm is evaluated using three real-world engineering problems. The results indicated that the proposed algorithm was more capable than other algorithms in proposing qualitative and competitive solutions.
Author Zolfi, Kamran
Author_xml – sequence: 1
  givenname: Kamran
  surname: Zolfi
  fullname: Zolfi, Kamran
BookMark eNptkM1Lw0AQxRepYK29-BfkLKTOZrOb3aMUrYWCFz0vsx9pV5Js2KSI_vWG-nEQTzMM83689y7JrIudJ-SawopVVMFtTK5gQEGekXnBFM0FCJhNO0iaS8nlBVkOQzBQCFVRDnRO1pvYuCwdh0MW-zG04cOnVYZZ59-yPvbHBscQu9zg4F3W-hEP_pjCMAabYbOPKYyH9oqc19gMfvk9F-Tl4f55_Zjvnjbb9d0ut4yxMRc1Fsit5QzLwnEDBo3xCLYWYJnkKBVFT4Wd3HJUtQPnmDVcqqq0iju2INsvrov4qvsUWkzvOmLQp0NMe41pctZ4bYAZpDVwwW0pS2HQUV4XDoxgCis7seCLZVMchuRrbcN4yjomDI2moE-d6t9OJ8nNH8mPhX-ePwEksnq-
CitedBy_id crossref_primary_10_1038_s41598_025_85709_5
crossref_primary_10_1007_s10586_024_04685_z
crossref_primary_10_1109_ACCESS_2024_3428540
crossref_primary_10_1016_j_eswa_2025_127714
crossref_primary_10_1038_s41598_025_96559_6
crossref_primary_10_1038_s41598_025_88080_7
crossref_primary_10_1007_s10586_024_04586_1
crossref_primary_10_1016_j_ijepes_2025_111135
crossref_primary_10_3390_biomimetics10010031
crossref_primary_10_1007_s11042_024_19317_2
crossref_primary_10_7717_peerj_cs_2722
crossref_primary_10_1007_s41939_024_00375_w
crossref_primary_10_1007_s00521_024_09902_9
crossref_primary_10_1155_int_7679830
crossref_primary_10_1063_5_0190206
crossref_primary_10_1109_ACCESS_2024_3397402
crossref_primary_10_1038_s41598_025_98816_0
crossref_primary_10_1038_s41598_025_13539_6
crossref_primary_10_1088_1402_4896_adbfd6
crossref_primary_10_1038_s41598_024_84931_x
crossref_primary_10_1109_ACCESS_2024_3449998
crossref_primary_10_1007_s11831_023_10030_1
crossref_primary_10_1109_ACCESS_2024_3445269
crossref_primary_10_1109_TIM_2024_3470234
crossref_primary_10_3390_math13010123
crossref_primary_10_7717_peerj_cs_1526
crossref_primary_10_1016_j_aei_2024_102783
crossref_primary_10_1002_dac_70059
crossref_primary_10_1007_s10462_024_10729_y
crossref_primary_10_1007_s41314_025_00075_4
crossref_primary_10_1038_s41598_025_00076_5
crossref_primary_10_1177_01423312241273781
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.37190/ord230108
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 2391-6060
EndPage 150
ExternalDocumentID oai_doaj_org_article_b03ba1f0565c4846bad15f2d0b639a7c
10_37190_ord230108
GroupedDBID AAYXX
ADBBV
ADMLS
AHQJS
AKVCP
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
EBO
EBU
EOJEC
GROUPED_DOAJ
KQ8
OBODZ
RNS
TH9
Y2W
~8M
ID FETCH-LOGICAL-c333t-6fa2a5cc53a42d5b0babbea0cf60c385a891ae16c0815a9fd0dd3cb58974c95d3
IEDL.DBID DOA
ISICitedReferencesCount 79
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000972434400008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2081-8858
IngestDate Fri Oct 03 12:51:11 EDT 2025
Tue Nov 18 21:45:03 EST 2025
Sat Nov 29 06:11:56 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c333t-6fa2a5cc53a42d5b0babbea0cf60c385a891ae16c0815a9fd0dd3cb58974c95d3
OpenAccessLink https://doaj.org/article/b03ba1f0565c4846bad15f2d0b639a7c
PageCount 38
ParticipantIDs doaj_primary_oai_doaj_org_article_b03ba1f0565c4846bad15f2d0b639a7c
crossref_citationtrail_10_37190_ord230108
crossref_primary_10_37190_ord230108
PublicationCentury 2000
PublicationDate 2023-00-00
2023-01-01
PublicationDateYYYYMMDD 2023-01-01
PublicationDate_xml – year: 2023
  text: 2023-00-00
PublicationDecade 2020
PublicationTitle Operations research and decisions
PublicationYear 2023
Publisher Wrocław University of Science and Technology
Publisher_xml – name: Wrocław University of Science and Technology
SSID ssib026971501
ssj0001141500
Score 2.531736
Snippet Today’s world is characterised by competitive environments, optimal resource utilization, and cost reduction, which has resulted in an increasing role for...
Today's world is characterised by competitive environments, optimal resource utilization, and cost reduction, which has resulted in an increasing role for...
SourceID doaj
crossref
SourceType Open Website
Enrichment Source
Index Database
StartPage 113
Title Gold rush optimizer. a new population-based metaheuristic algorithm
URI https://doaj.org/article/b03ba1f0565c4846bad15f2d0b639a7c
Volume 33
WOSCitedRecordID wos000972434400008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2391-6060
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001141500
  issn: 2081-8858
  databaseCode: DOA
  dateStart: 20100101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQAD4inKS5ZgYQjEdhzbY1vxWFoqBFK3yK_QSn2gNmXg13NOSuiAxMIanSLnzvF33yn5PoSucmg5GDcizDV8lGjHIymVjGwudGAchtDKbEL0enIwUP01q6_wTVglD1wl7tbEzGiSA05zmwBYGu0Iz6mLDWCrFjacvrFQa2QKdhJNlYBOh_xMWwgAVfk_CgUMhOVwWWmVMgGIeAs8D1pxEjwm19BpTcS_RJv7XbSzahNxq1reHtrw03203a01VhcHqPMwGzv8vFwM8RO895PRp5_f4BaGYwv3a1uuqA0w5XDXF3rol5UsM26N32bzUTGcHKLX-7uXzmO0skSILGOsiNJcU82t5Uwn1HETG22M17HN09gyybVURHuSWnhKrlXuYueYNVwCbbCKO3aEGtPZ1B8jnHgLzUUufcJFAiRNailoSr0SylFLWBNdf6cisyu98GBbMc6AN5Rpy-q0NdFlHfteqWT8GtUOGa0jgrJ1eQHqna3qnf1V75P_uMkp2gq28dUo5Qw1ivnSn6NN-1GMFvOLcit9AZnwyh4
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Gold+rush+optimizer.+a+new+population-based+metaheuristic+algorithm&rft.jtitle=Operations+research+and+decisions&rft.au=Zolfi%2C+Kamran&rft.date=2023&rft.issn=2081-8858&rft.eissn=2391-6060&rft.volume=33&rft.issue=1&rft_id=info:doi/10.37190%2Ford230108&rft.externalDBID=n%2Fa&rft.externalDocID=10_37190_ord230108
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2081-8858&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2081-8858&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2081-8858&client=summon