<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">jcc</journal-id>
      <journal-title-group>
        <journal-title>Journal of Computer and Communications</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2327-5227</issn>
      <issn pub-type="ppub">2327-5219</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/jcc.2026.149004</article-id>
      <article-id pub-id-type="publisher-id">jcc-153927</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Computer Science</subject>
          <subject>Communications</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>A New Metaheuristic Optimizer Inspired by Shopping Behavior</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>El-Dosuky</surname>
            <given-names>Mohamed</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Al-Bagmi</surname>
            <given-names>Athir</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Al-Muhaidib</surname>
            <given-names>Ghaida</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Al-Manna</surname>
            <given-names>Najla</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Faculty of Computer and Info, Mansoura University, Mansoura, Egypt </aff>
      <aff id="aff2"><label>2</label> Arab East Colleges, Riyadh, KSA </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>16</day>
        <month>09</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>09</month>
        <year>2026</year>
      </pub-date>
      <volume>14</volume>
      <issue>09</issue>
      <fpage>37</fpage>
      <lpage>50</lpage>
      <history>
        <date date-type="received">
          <day>26</day>
          <month>08</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>14</day>
          <month>09</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>17</day>
          <month>09</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/jcc.2026.149004">https://doi.org/10.4236/jcc.2026.149004</self-uri>
      <abstract>
        <p>This paper introduces a new metaheuristic inspired by the differing shopping behavior of men and women, called the Shopping Metaheuristic. It models optimization as a collaborative process between two agents: a man, who focuses on intensification (exploitation), and a woman, who prioritizes diversification (exploration). The goal is to enhance the balance between global exploration and local exploitation, improving convergence speed and avoiding local optima. To achieve this, the metaheuristic employs various strategies, including random jumps for exploration, adaptive step sizes, social influence mechanisms, communication between agents, and periodic intensification. These techniques help maintain a balance between broad search and fine-tuning solutions. The paper analyses its convergence behavior and explores a case study in smart agriculture. Finally, its performance is compared with traditional methods like Artificial Bee Colony, Genetic Algorithm, and Particle Swarm Optimization, as well as modern approaches like Spotted Hyena Optimizer and Dragonfly Optimization. The key observation is that both the Shopping Metaheuristic and Spotted Hyena Optimizer achieved the highest accuracy (0.993), outperforming the Dragonfly Optimization and Salp Swarm Algorithm, with the latter showing the lowest accuracy.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Metaheuristic</kwd>
        <kwd>Exploitation</kwd>
        <kwd>Exploration</kwd>
        <kwd>Shopping Behavior</kwd>
        <kwd>Optimization</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>Metaheuristics are high-level optimization strategies that guide heuristics to efficiently explore and exploit search spaces, providing near-optimal solutions for complex problems [<xref ref-type="bibr" rid="B1">1</xref>]. A single metaheuristic cannot excel in all optimization problems because each algorithm’s design is tailored to certain problem types and may fail in others. This aligns with the No Free Lunch (NFL) theorem, which states that no optimization method is universally superior across all problem domains [<xref ref-type="bibr" rid="B2">2</xref>]. Metaheuristics typically balance two key aspects: exploration (searching diverse areas of the solution space) and exploitation (refining promising solutions) [<xref ref-type="bibr" rid="B3">3</xref>]. The proposed metaheuristic, inspired from shopping behavior, aims to better balance exploration and exploitation to speed up convergence and avoid local optima by using strategies such as random jumps, adaptive step sizes, agent communication, social influence, and periodic search intensification. This work is divided into six sections on introduction, literature review, proposed metaheuristic, evaluation, case study, and finally the conclusion with future directions.</p>
    </sec>
    <sec id="sec2">
      <title>2. Literature Review</title>
      <p>As illustrated in <xref ref-type="fig" rid="fig1">Figure 1</xref>, metaheuristics can be classified into six main categories: bio-based, evolutionary-based, physics-based, swarm-based, human-based, and math-based [<xref ref-type="bibr" rid="B4">4</xref>]. All these categories are reviewed in the subsequent sections.</p>
      <fig id="fig1">
        <label>Figure 1</label>
        <graphic xlink:href="https://html.scirp.org/file/1733652-rId13.jpeg?20260917034547" />
      </fig>
      <p><bold>Figure 1.</bold>Taxonomy of recent metaheuristics as in MEALPY [<xref ref-type="bibr" rid="B4">4</xref>].</p>
      <sec id="sec2dot1">
        <title>2.1. Bio-Based Algorithms</title>
        <p>Biogeography-Based Optimization (BBO) models species migration to share features between solutions and maintain diversity, making it useful in power systems, image processing, and engineering [<xref ref-type="bibr" rid="B5">5</xref>]. Virus Colony Search (VCS) simulates viral infection and immune response to balance exploration and exploitation, with applications in scheduling and machine learning [<xref ref-type="bibr" rid="B6">6</xref>]. Wild Horse Optimizer (WHO) imitates herd behavior to guide search and adapt weaker solutions, proving effective in engineering and control problems [<xref ref-type="bibr" rid="B7">7</xref>]. Slime Mould Algorithm (SMA) reproduces slime mold foraging patterns using dynamic exploration-exploitation adjustments and is applied in feature selection, image segmentation, and engineering tasks [<xref ref-type="bibr" rid="B8">8</xref>].</p>
      </sec>
      <sec id="sec2dot2">
        <title>2.2. Evolutionary-Based Algorithms</title>
        <p>Genetic Algorithm (GA) uses selection, crossover, and mutation to evolve solutions and is widely applied in scheduling and machine learning [<xref ref-type="bibr" rid="B9">9</xref>]. Differential Evolution (DE) improves solutions through difference-based mutation and crossover, making it effective for global optimization in machine learning [<xref ref-type="bibr" rid="B10">10</xref>]. Evolution Strategies (ES) rely mainly on mutation and selection with adaptive step sizes, commonly used in reinforcement learning and robotics [<xref ref-type="bibr" rid="B11">11</xref>]. Coral Reef Optimization (CRO) simulates coral reproduction and colonization to evolve solutions, with applications in scheduling and neural networks [<xref ref-type="bibr" rid="B12">12</xref>]. Flower Pollination Algorithm (FPA) models pollination processes to balance local and global search, useful in feature selection, clustering, and engineering optimization [<xref ref-type="bibr" rid="B13">13</xref>].</p>
      </sec>
      <sec id="sec2dot3">
        <title>2.3. Physics-Based Algorithms</title>
        <p>Nuclear Reaction Optimization (NRO) models fission and fusion processes to split or merge solutions for efficient exploration, with applications in scheduling, and machine learning [<xref ref-type="bibr" rid="B14">14</xref>]. Electrostatic Field Optimization (EFO) simulates charged particle interactions based on Coulomb’s law, guiding solutions toward optima in function optimization and power systems [<xref ref-type="bibr" rid="B15">15</xref>]. Equilibrium Optimizer (EO) uses mass-equilibrium dynamics to balance exploration and exploitation, effective in feature selection, image segmentation, and optimization in general [<xref ref-type="bibr" rid="B16">16</xref>]. Henry Gas Solubility Optimization (HGSO) mimics gas-liquid solubility behavior with adaptive movement strategies, applied in engineering, image processing, and scheduling [<xref ref-type="bibr" rid="B17">17</xref>]. Multi-Verse Optimizer (MVO) draws on cosmological concepts like black and white holes to balance diversification and intensification, used in feature selection [<xref ref-type="bibr" rid="B18">18</xref>].</p>
      </sec>
      <sec id="sec2dot4">
        <title>2.4. Swarm-Based Algorithms</title>
        <p>Particle Swarm Optimization (PSO) models bird and fish social behavior, guiding particles by personal and global best positions, and is used in neural network training, scheduling, and robotics [<xref ref-type="bibr" rid="B19">19</xref>]. Ant Lion Optimizer (ALO) simulates ant lion predation to guide solutions toward better positions, applied in engineering, machine learning, and scheduling [<xref ref-type="bibr" rid="B20">20</xref>]. Whale Optimization Algorithm (WOA) imitates humpback whale hunting strategies for global optimization [<xref ref-type="bibr" rid="B21">21</xref>]. Harris Hawks Optimization (HHO) uses cooperative hunting behavior to balance exploration and exploitation, applied in image processing, and classification [<xref ref-type="bibr" rid="B22">22</xref>]. Hunger Games Search (HGS) models competitive survival strategies, balancing exploration and convergence for feature selection, scheduling, and engineering design [<xref ref-type="bibr" rid="B23">23</xref>].</p>
      </sec>
      <sec id="sec2dot5">
        <title>2.5. Human-Based Algorithms</title>
        <p>Chief Executive Officer Algorithm (CHIO) models organizational decision-making, guiding employee-solutions toward optima, used in engineering, scheduling, and optimization [<xref ref-type="bibr" rid="B24">24</xref>]. Teaching-Learning Optimization (TLO) mimics classroom teaching and learning with global and local search phases, applied in engineering, machine learning, and control systems [<xref ref-type="bibr" rid="B25">25</xref>]. Football-Based Optimization (FBIO) simulates football strategies to adapt solution movements, useful in scheduling, robotics, and classification [<xref ref-type="bibr" rid="B26">26</xref>]. Group Search Kicker Algorithm (GSKA) balances individual and cooperative human-like search behavior, used in feature selection and clustering [<xref ref-type="bibr" rid="B27">27</xref>].</p>
      </sec>
      <sec id="sec2dot6">
        <title>2.6. Math-Based Algorithms</title>
        <p>Arithmetic Optimization Algorithm (AOA) uses basic arithmetic operations for effective exploration and exploitation, applied in engineering, scheduling, and machine learning [<xref ref-type="bibr" rid="B28">28</xref>]. Chaos Game Optimization (CGO) employs chaotic maps to avoid local optima, suitable for global optimization [<xref ref-type="bibr" rid="B29">29</xref>]. Hill Climbing (HC) iteratively improves solutions through local adjustments, effective for gradient-based problems despite local optimum risks [<xref ref-type="bibr" rid="B30">30</xref>]. Golden Ball Optimizer (GBO) models football strategies to balance exploration and exploitation, used in engineering and scheduling [<xref ref-type="bibr" rid="B31">31</xref>]. Sine Cosine Algorithm (SCA) updates solution positions using sine and cosine functions, applied in engineering, image processing, and function optimization [<xref ref-type="bibr" rid="B32">32</xref>].</p>
      </sec>
    </sec>
    <sec id="sec3">
      <title>3. Proposed Metaheuristic</title>
      <p><bold>Table 1</bold> highlights the differences between men and women in shopping across five aspects: shopping approach, product preferences, decision-making, online versus in-store behavior, and social influence. The table highlights notable differences in shopping behavior between men and women across several aspects. In terms of shopping approach, men tend to be goal-oriented, aiming for efficiency and speed, while women often adopt a more social and exploratory style, enjoying the process of browsing. Regarding product preferences, men typically prioritize practicality and functionality, often focusing on technology and gadgets, whereas women are more drawn to aesthetics, variety, and products that create an emotional connection. Decision-making also varies: men usually make quicker choices with minimal comparison, while women tend to be more thorough, comparing products and seeking advice before making a purchase. When it comes to the shopping environment, men often favor online shopping due to its convenience and speed, whereas women appreciate the in-store experience, valuing the tactile and social aspects of shopping. Lastly, social influence affects each gender differently; men are generally less swayed by external opinions, whereas women frequently consult reviews, seek opinions from friends or family, and are influenced by social media when making purchasing decisions.</p>
      <p><bold>Table 1.</bold>Comparison of shopping behavior between men and women.</p>
      <table-wrap id="tbl1">
        <label>Table 1</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>Aspect</bold>
              </td>
              <td>
                <bold>Men</bold>
              </td>
              <td>
                <bold>Women</bold>
              </td>
            </tr>
            <tr>
              <td>Shopping Approach</td>
              <td>Goal-oriented, quick, efficient</td>
              <td>Social, exploratory, enjoy browsing</td>
            </tr>
            <tr>
              <td>Product Preferences</td>
              <td>Focus on practicality, technology, and gadgets</td>
              <td>Aesthetics, variety, and emotional connection</td>
            </tr>
            <tr>
              <td>Decision-Making</td>
              <td>Quick decisions with less comparison</td>
              <td>Thorough evaluation, product comparison, and seeking advice</td>
            </tr>
            <tr>
              <td>Online vs. In-Store</td>
              <td>Prefer online shopping for speed and convenience</td>
              <td>Enjoy the in-store shopping experience</td>
            </tr>
            <tr>
              <td>Social Influence</td>
              <td>Less influenced by others</td>
              <td>Seek reviews, opinions, and social media recommendations</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <fig id="fig2">
        <label>Figure 2</label>
        <graphic xlink:href="https://html.scirp.org/file/1733652-rId14.jpeg?20260917034551" />
      </fig>
      <p><bold>Figure 2.</bold>Proposed metaheuristic.</p>
      <p>The proposed metaheuristic, as shown in <xref ref-type="fig" rid="fig2">Figure 2</xref> and <xref ref-type="fig" rid="fig3">Figure 3</xref>, models a population of couples, each consisting of a man and a woman, to solve optimization problems. Initialization defines the problem, objective function, and search space, while assigning each couple a “shopping need” representing the solution they seek. The fitness of each individual is evaluated to measure how well their current position satisfies this need, forming the basis for subsequent search operations.</p>
      <fig id="fig3">
        <label>Figure 3</label>
        <graphic xlink:href="https://html.scirp.org/file/1733652-rId15.jpeg?20260917034551" />
      </fig>
      <p><bold>Figure 3.</bold>Flowchart of the proposed metaheuristic.</p>
      <p>The metaheuristic simulates gender-based shopping behavior to balance exploration and exploitation. Women perform broad, exploratory searches to cover the search space widely, while men focus on local intensification to refine promising solutions. Cooperation between couples allows women to share exploration results with men, and social influence enables some women to consult others’ experiences, adding a collaborative dimension. Local and global updates further guide men toward refinement and women toward new regions, creating a dynamic interaction between diversification and intensification.</p>
      <p>To avoid local minima and improve convergence, the metaheuristic employs several mechanisms: women occasionally perform random jumps, step sizes adapt over iterations, and periodic social influence nudges them toward the global best solutions. Communication between couples ensures promising regions are shared, while men periodically intensify search around their partner’s findings. The algorithm terminates when stopping criteria are met, producing the best solutions found by the swarm as the optimal or near-optimal results.</p>
    </sec>
    <sec id="sec4">
      <title>4. Evaluation</title>
      <p>The proposed metaheuristic is evaluated in optimizing some common Congress on Evolutionary Computation (CEC) benchmark functions [<xref ref-type="bibr" rid="B33">33</xref>]:</p>
      <p><bold>Sphere Function</bold></p>
      <disp-formula id="FD1">
        <label>(1)</label>
        <mml:math>
          <mml:mrow>
            <mml:mi>f</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mstyle mathvariant="bold" mathsize="normal">
                <mml:mi>x</mml:mi>
              </mml:mstyle>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:munderover>
              <mml:mstyle mathsize="140%" displaystyle="true">
                <mml:mo>∑</mml:mo>
              </mml:mstyle>
              <mml:mrow>
                <mml:mi>i</mml:mi>
                <mml:mo>=</mml:mo>
                <mml:mn>1</mml:mn>
              </mml:mrow>
              <mml:mi>d</mml:mi>
            </mml:munderover>
            <mml:mtext>
               
            </mml:mtext>
            <mml:msubsup>
              <mml:mi>x</mml:mi>
              <mml:mi>i</mml:mi>
              <mml:mn>2</mml:mn>
            </mml:msubsup>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p><bold>Ackley Function</bold></p>
      <disp-formula id="FD2">
        <label>(2)</label>
        <mml:math>
          <mml:mrow>
            <mml:mi>f</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mstyle mathvariant="bold" mathsize="normal">
                <mml:mi>x</mml:mi>
              </mml:mstyle>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mo>−</mml:mo>
            <mml:mi>a</mml:mi>
            <mml:mi>exp</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mo>−</mml:mo>
                <mml:mi>b</mml:mi>
                <mml:msqrt>
                  <mml:mrow>
                    <mml:mfrac>
                      <mml:mn>1</mml:mn>
                      <mml:mi>d</mml:mi>
                    </mml:mfrac>
                    <mml:munderover>
                      <mml:mstyle mathsize="140%" displaystyle="true">
                        <mml:mo>∑</mml:mo>
                      </mml:mstyle>
                      <mml:mrow>
                        <mml:mi>i</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                      <mml:mi>d</mml:mi>
                    </mml:munderover>
                    <mml:mtext>
                       
                    </mml:mtext>
                    <mml:msubsup>
                      <mml:mi>x</mml:mi>
                      <mml:mi>i</mml:mi>
                      <mml:mn>2</mml:mn>
                    </mml:msubsup>
                  </mml:mrow>
                </mml:msqrt>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>−</mml:mo>
            <mml:mi>exp</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mfrac>
                  <mml:mn>1</mml:mn>
                  <mml:mi>d</mml:mi>
                </mml:mfrac>
                <mml:munderover>
                  <mml:mstyle mathsize="140%" displaystyle="true">
                    <mml:mo>∑</mml:mo>
                  </mml:mstyle>
                  <mml:mrow>
                    <mml:mi>i</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mi>d</mml:mi>
                </mml:munderover>
                <mml:mi>cos</mml:mi>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:mi>c</mml:mi>
                    <mml:msub>
                      <mml:mi>x</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>+</mml:mo>
            <mml:mi>a</mml:mi>
            <mml:mo>+</mml:mo>
            <mml:mi>e</mml:mi>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>where </p>
      <disp-formula id="FD3">
        <mml:math>
          <mml:mrow>
            <mml:mi>a</mml:mi>
            <mml:mo>=</mml:mo>
            <mml:mn>20</mml:mn>
            <mml:mo>,</mml:mo>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mi>b</mml:mi>
            <mml:mo>=</mml:mo>
            <mml:mn>0.2</mml:mn>
            <mml:mo>,</mml:mo>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mi>c</mml:mi>
            <mml:mo>=</mml:mo>
            <mml:mn>2</mml:mn>
            <mml:mi>π</mml:mi>
            <mml:mo>.</mml:mo>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p><bold>Rastrigin Function</bold></p>
      <disp-formula id="FD4">
        <label>(3)</label>
        <mml:math>
          <mml:mrow>
            <mml:mi>f</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mstyle mathvariant="bold" mathsize="normal">
                <mml:mi>x</mml:mi>
              </mml:mstyle>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mi>A</mml:mi>
            <mml:mi>d</mml:mi>
            <mml:mo>+</mml:mo>
            <mml:munderover>
              <mml:mstyle mathsize="140%" displaystyle="true">
                <mml:mo>∑</mml:mo>
              </mml:mstyle>
              <mml:mrow>
                <mml:mi>i</mml:mi>
                <mml:mo>=</mml:mo>
                <mml:mn>1</mml:mn>
              </mml:mrow>
              <mml:mi>d</mml:mi>
            </mml:munderover>
            <mml:mrow>
              <mml:mo>[</mml:mo>
              <mml:mrow>
                <mml:msubsup>
                  <mml:mi>x</mml:mi>
                  <mml:mi>i</mml:mi>
                  <mml:mn>2</mml:mn>
                </mml:msubsup>
                <mml:mo>−</mml:mo>
                <mml:mi>A</mml:mi>
                <mml:mi>cos</mml:mi>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:mn>2</mml:mn>
                    <mml:mi>π</mml:mi>
                    <mml:msub>
                      <mml:mi>x</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mo>]</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>where </p>
      <disp-formula id="FD5">
        <mml:math>
          <mml:mrow>
            <mml:mi>A</mml:mi>
            <mml:mo>=</mml:mo>
            <mml:mn>10.</mml:mn>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p><bold>Rosenbrock Function</bold></p>
      <disp-formula id="FD6">
        <label>(4)</label>
        <mml:math>
          <mml:mrow>
            <mml:mi>f</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mstyle mathvariant="bold" mathsize="normal">
                <mml:mi>x</mml:mi>
              </mml:mstyle>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:munderover>
              <mml:mstyle mathsize="140%" displaystyle="true">
                <mml:mo>∑</mml:mo>
              </mml:mstyle>
              <mml:mrow>
                <mml:mi>i</mml:mi>
                <mml:mo>=</mml:mo>
                <mml:mn>1</mml:mn>
              </mml:mrow>
              <mml:mrow>
                <mml:mi>d</mml:mi>
                <mml:mo>−</mml:mo>
                <mml:mn>1</mml:mn>
              </mml:mrow>
            </mml:munderover>
            <mml:mrow>
              <mml:mo>[</mml:mo>
              <mml:mrow>
                <mml:mn>100</mml:mn>
                <mml:msup>
                  <mml:mrow>
                    <mml:mrow>
                      <mml:mo>(</mml:mo>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mrow>
                            <mml:mi>i</mml:mi>
                            <mml:mo>+</mml:mo>
                            <mml:mn>1</mml:mn>
                          </mml:mrow>
                        </mml:msub>
                        <mml:mo>−</mml:mo>
                        <mml:msubsup>
                          <mml:mi>x</mml:mi>
                          <mml:mi>i</mml:mi>
                          <mml:mn>2</mml:mn>
                        </mml:msubsup>
                      </mml:mrow>
                      <mml:mo>)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                  <mml:mn>2</mml:mn>
                </mml:msup>
                <mml:mo>+</mml:mo>
                <mml:msup>
                  <mml:mrow>
                    <mml:mrow>
                      <mml:mo>(</mml:mo>
                      <mml:mrow>
                        <mml:mn>1</mml:mn>
                        <mml:mo>−</mml:mo>
                        <mml:msub>
                          <mml:mi>x</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                      <mml:mo>)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                  <mml:mn>2</mml:mn>
                </mml:msup>
              </mml:mrow>
              <mml:mo>]</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p><xref ref-type="fig" rid="fig4">Figure 4</xref> illustrates two visualizations of the Ackley function, a popular benchmark in optimization due to its many local minima and complex landscape. The left side shows a 2D contour plot with concentric colour bands representing function values, where cooler (blue) indicates lower values and warmer (red) indicates higher values. The red cross labelled “Best Path” marks the global minimum near the origin, representing the optimal solution. On the right, a 3D surface plot provides a perspective view of the function, highlighting its bowl-shaped surface surrounded by undulating ridges. The same is provided for Rastrigin function, as shown in <xref ref-type="fig" rid="fig5">Figure 5</xref>, and sphere function as in <xref ref-type="fig" rid="fig6">Figure 6</xref>.</p>
      <fig id="fig4">
        <label>Figure 4</label>
        <graphic xlink:href="https://html.scirp.org/file/1733652-rId28.jpeg?20260917034551" />
      </fig>
      <p><bold>Figure 4.</bold>Ackley function optimization.</p>
      <fig id="fig5">
        <label>Figure 5</label>
        <graphic xlink:href="https://html.scirp.org/file/1733652-rId29.jpeg?20260917034551" />
      </fig>
      <p><bold>Figure 5.</bold>Rastrigin function optimization.</p>
      <fig id="fig6">
        <label>Figure 6</label>
        <graphic xlink:href="https://html.scirp.org/file/1733652-rId30.jpeg?20260917034551" />
      </fig>
      <p><bold>Figure 6.</bold>Sphere function optimization.</p>
    </sec>
    <sec id="sec5">
      <title>5. Case Study</title>
      <p>The Crop Recommendation Dataset from Kaggle is designed to help predict the most suitable crops for cultivation based on various soil and environmental conditions [<xref ref-type="bibr" rid="B34">34</xref>]. As shown in <bold>Table 2</bold>, it contains features such as soil nitrogen, phosphorus, and potassium levels, as well as temperature, humidity, pH, and rainfall. The target variable is the recommended crop type, determined by analyzing these input features. Organized in a tabular format, typically as CSV files. It is widely used in agricultural applications to build predictive models that optimize crop selection.</p>
      <p><bold>Table 2.</bold> Sample records from the crop recommendation dataset. </p>
      <table-wrap id="tbl2">
        <label>Table 2</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>No.</bold>
              </td>
              <td>
                <bold>N</bold>
              </td>
              <td>
                <bold>P</bold>
              </td>
              <td>
                <bold>K</bold>
              </td>
              <td>
                <bold>Temperature</bold>
              </td>
              <td>
                <bold>Humidity</bold>
              </td>
              <td>
                <bold>pH</bold>
              </td>
              <td>
                <bold>Rainfall</bold>
              </td>
              <td>
                <bold>Label</bold>
              </td>
            </tr>
            <tr>
              <td>0</td>
              <td>90</td>
              <td>42</td>
              <td>43</td>
              <td>20.88</td>
              <td>82.00</td>
              <td>6.50</td>
              <td>202.94</td>
              <td>rice</td>
            </tr>
            <tr>
              <td>1</td>
              <td>85</td>
              <td>58</td>
              <td>41</td>
              <td>21.77</td>
              <td>80.32</td>
              <td>7.04</td>
              <td>226.66</td>
              <td>rice</td>
            </tr>
            <tr>
              <td>2</td>
              <td>60</td>
              <td>55</td>
              <td>44</td>
              <td>23.00</td>
              <td>82.32</td>
              <td>7.84</td>
              <td>263.96</td>
              <td>rice</td>
            </tr>
            <tr>
              <td>3</td>
              <td>74</td>
              <td>35</td>
              <td>40</td>
              <td>26.49</td>
              <td>80.16</td>
              <td>6.98</td>
              <td>242.86</td>
              <td>rice</td>
            </tr>
            <tr>
              <td>4</td>
              <td>78</td>
              <td>42</td>
              <td>42</td>
              <td>20.13</td>
              <td>81.60</td>
              <td>7.63</td>
              <td>262.72</td>
              <td>rice</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p><xref ref-type="fig" rid="fig7">Figure 7</xref> provides the confusion matrix of the application of the proposed shopping metaheuristic on the aforementioned dataset. </p>
      <p><bold>Table 3</bold> provides F1-Score for each class, which balance Precision and Recall to provide a single performance metric. The model achieves excellent accuracy (97.84) with very high F1-Scores for most classes. However, lentil has the lowest F1-Score (0.667) due to low Precision and Recall. <bold>Table 4</bold> compares the proposed shopping metaheuristic with three distinct Swarm Intelligence algorithms-the Dragonfly Optimization Algorithm (DOA), the Spotted Hyena Optimizer (SHO), and the Salp Swarm Algorithm (SSA).</p>
      <fig id="fig7">
        <label>Figure 7</label>
        <graphic xlink:href="https://html.scirp.org/file/1733652-rId31.jpeg?20260917034551" />
      </fig>
      <p><bold>Figure 7.</bold>Confusion matrix.</p>
      <p><bold>Table 3.</bold> Classification performance metrics by crop class. </p>
      <table-wrap id="tbl3">
        <label>Table 3</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>Class</bold>
              </td>
              <td>
                <bold>Recall</bold>
              </td>
              <td>
                <bold>Precision</bold>
              </td>
              <td>
                <bold>F1-Score</bold>
              </td>
            </tr>
            <tr>
              <td>apple</td>
              <td>0.919</td>
              <td>1.000</td>
              <td>0.958</td>
            </tr>
            <tr>
              <td>banana</td>
              <td>1.000</td>
              <td>0.946</td>
              <td>0.972</td>
            </tr>
            <tr>
              <td>blackgram</td>
              <td>0.971</td>
              <td>0.971</td>
              <td>0.971</td>
            </tr>
            <tr>
              <td>chickpea</td>
              <td>1.000</td>
              <td>1.000</td>
              <td>1.000</td>
            </tr>
            <tr>
              <td>kidneybeans</td>
              <td>1.000</td>
              <td>0.864</td>
              <td>0.927</td>
            </tr>
            <tr>
              <td>lentil</td>
              <td>0.667</td>
              <td>0.667</td>
              <td>0.667</td>
            </tr>
            <tr>
              <td>mothbeans</td>
              <td>1.000</td>
              <td>1.000</td>
              <td>1.000</td>
            </tr>
            <tr>
              <td>mungbean</td>
              <td>1.000</td>
              <td>1.000</td>
              <td>1.000</td>
            </tr>
            <tr>
              <td>pigeonpeas</td>
              <td>1.000</td>
              <td>1.000</td>
              <td>1.000</td>
            </tr>
            <tr>
              <td>rice</td>
              <td>0.860</td>
              <td>1.000</td>
              <td>0.925</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p><bold>Table 4.</bold> Best classification accuracy of different optimization algorithms. </p>
      <table-wrap id="tbl4">
        <label>Table 4</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>Optimization Algorithm</bold>
              </td>
              <td>
                <bold>Best Accuracy</bold>
              </td>
            </tr>
            <tr>
              <td>Shopping Metaheuristic</td>
              <td>0.9927</td>
            </tr>
            <tr>
              <td>Dragonfly Optimization</td>
              <td>0.9823</td>
            </tr>
            <tr>
              <td>Spotted Hyena Optimizer</td>
              <td>0.9927</td>
            </tr>
            <tr>
              <td>Salp Swarm Algorithm</td>
              <td>0.8564</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p>The key observation is that both the Shopping Metaheuristic and Spotted Hyena Optimizer achieved the highest accuracy (0.993), outperforming the Dragonfly Optimization and Salp Swarm Algorithm, with the latter showing the lowest accuracy.</p>
    </sec>
    <sec id="sec6">
      <title>6. Conclusion and Future Work</title>
      <p>This paper presents the Shopping Metaheuristic, a novel optimization algorithm inspired by the different shopping behavior of men and women, where men focus on exploitation and women on exploration. The algorithm employs strategies such as random jumps, adaptive step sizes, social influence, inter-agent communication, and periodic intensification to balance global search and local refinement, improving convergence and avoiding local optima. The metaheuristic is evaluated on CEC benchmark functions with additional analysis of convergence behavior and a case study in smart agriculture. Performance comparisons show that the Shopping Metaheuristic, along with the Spotted Hyena Optimizer, achieved the highest accuracy (0.993), outperforming Dragonfly Optimization and Salp Swarm Algorithm, the latter demonstrating the lowest accuracy. Based on the findings, three key recommendations are proposed. First, the data imbalance for the “lentil” class should be addressed, either by collecting additional data or by applying techniques such as SMOTE. Second, targeted feature engineering should be conducted to introduce new differentiating features, such as texture or shape analysis, to specifically resolve the confusion between rice and jute. Finally, implementing a hybrid optimization algorithm that combines the global search capabilities of the current metaheuristic with a strong local search method could potentially improve overall accuracy beyond 99%.</p>
    </sec>
    <sec id="sec7">
      <title>Author Contributions</title>
      <p>Mohamed El-Dosuky: Conceptualization, Methodology, Formal Analysis, Validation, Writing Original Draft, Supervision. Athir Al-Bagmi: Software, Investigation, Experimental Evaluation, Visualization, Writing Review &amp; Editing. Ghaida Al-Muhaidib: Algorithm Design, Software, Validation, Benchmark Testing, Visualization, Writing Review &amp; Editing. Najla Al-Manna: Algorithm Design, Software, Literature Review, Validation, Writing Review &amp; Editing. All authors contributed to the interpretation of the results, reviewed the manuscript, and approved the final version for publication.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Alorf, A. (2023) A Survey of Recently Developed Metaheuristics and Their Comparative Analysis. <italic>Engineering Applications of Artificial Intelligence</italic>, 117, Article 105622. https://doi.org/10.1016/j.engappai.2022.105622 <pub-id pub-id-type="doi">10.1016/j.engappai.2022.105622</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.engappai.2022.105622">https://doi.org/10.1016/j.engappai.2022.105622</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Alorf, A.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>A Survey of Recently Developed Metaheuristics and Their Comparative Analysis</article-title>
            <source>Engineering Applications of Artificial Intelligence</source>
            <volume>117</volume>
            <elocation-id>105622</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.engappai.2022.105622</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wolpert, D.H. and Macready, W.G. (1997) No Free Lunch Theorems for Optimization. <italic>IEEE Transactions on Evolutionary Computation</italic>, 1, 67-82. https://doi.org/10.1109/4235.585893 <pub-id pub-id-type="doi">10.1109/4235.585893</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/4235.585893">https://doi.org/10.1109/4235.585893</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wolpert, D.H.</string-name>
              <string-name>Macready, W.G.</string-name>
            </person-group>
            <year>1997</year>
            <article-title>No Free Lunch Theorems for Optimization</article-title>
            <source>IEEE Transactions on Evolutionary Computation</source>
            <volume>1</volume>
            <pub-id pub-id-type="doi">10.1109/4235.585893</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Morales-Castañeda, B., Zaldívar, D., Cuevas, E., Fausto, F. and Rodríguez, A. (2020) A Better Balance in Metaheuristic Algorithms: Does It Exist? <italic>Swarm and Evolutionary Computation</italic>, 54, Article 100671. https://doi.org/10.1016/j.swevo.2020.100671 <pub-id pub-id-type="doi">10.1016/j.swevo.2020.100671</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.swevo.2020.100671">https://doi.org/10.1016/j.swevo.2020.100671</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Cuevas, E.</string-name>
              <string-name>Fausto, F.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>A Better Balance in Metaheuristic Algorithms: Does It Exist? Swarm and Evolutionary Computation, 54, Article 100671</article-title>
            <elocation-id>100671</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.swevo.2020.100671</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Van Thieu, N. and Mirjalili, S. (2023) MEALPY: An Open-Source Library for Latest Meta-Heuristic Algorithms in Python. <italic>Journal of Systems Architecture</italic>, 139, Article 102871. https://doi.org/10.1016/j.sysarc.2023.102871 <pub-id pub-id-type="doi">10.1016/j.sysarc.2023.102871</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.sysarc.2023.102871">https://doi.org/10.1016/j.sysarc.2023.102871</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Thieu, N.</string-name>
              <string-name>Mirjalili, S.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>MEALPY: An Open-Source Library for Latest Meta-Heuristic Algorithms in Python</article-title>
            <source>Journal of Systems Architecture</source>
            <volume>139</volume>
            <elocation-id>102871</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.sysarc.2023.102871</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Simon, D. (2008) Biogeography-Based Optimization. <italic>IEEE Transactions on Evolutionary Computation</italic>, 12, 702-713. https://doi.org/10.1109/tevc.2008.919004 <pub-id pub-id-type="doi">10.1109/tevc.2008.919004</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tevc.2008.919004">https://doi.org/10.1109/tevc.2008.919004</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Simon, D.</string-name>
            </person-group>
            <year>2008</year>
            <article-title>Biogeography-Based Optimization</article-title>
            <source>IEEE Transactions on Evolutionary Computation</source>
            <volume>12</volume>
            <pub-id pub-id-type="doi">10.1109/tevc.2008.919004</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Li, M.D., Zhao, H., Weng, X.W. and Han, T. (2016) A Novel Nature-Inspired Algorithm for Optimization: Virus Colony Search. <italic>Advances in Engineering Software</italic>, 92, 65-88. https://doi.org/10.1016/j.advengsoft.2015.11.004 <pub-id pub-id-type="doi">10.1016/j.advengsoft.2015.11.004</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.advengsoft.2015.11.004">https://doi.org/10.1016/j.advengsoft.2015.11.004</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Li, M.D.</string-name>
              <string-name>Zhao, H.</string-name>
              <string-name>Weng, X.W.</string-name>
              <string-name>Han, T.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>A Novel Nature-Inspired Algorithm for Optimization: Virus Colony Search</article-title>
            <source>Advances in Engineering Software</source>
            <volume>92</volume>
            <pub-id pub-id-type="doi">10.1016/j.advengsoft.2015.11.004</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Naruei, I. and Keynia, F. (2022) Wild Horse Optimizer: A New Meta-Heuristic Algorithm for Solving Engineering Optimization Problems. <italic>Engineering with Computers</italic>, 38, 3025-3056. https://doi.org/10.1007/s00366-021-01438-z <pub-id pub-id-type="doi">10.1007/s00366-021-01438-z</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s00366-021-01438-z">https://doi.org/10.1007/s00366-021-01438-z</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Naruei, I.</string-name>
              <string-name>Keynia, F.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Wild Horse Optimizer: A New Meta-Heuristic Algorithm for Solving Engineering Optimization Problems</article-title>
            <source>Engineering with Computers</source>
            <volume>38</volume>
            <pub-id pub-id-type="doi">10.1007/s00366-021-01438-z</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Li, S., Chen, H., Wang, M., Heidari, A.A. and Mirjalili, S. (2020) Slime Mould Algorithm: A New Method for Stochastic Optimization. <italic>Future Generation Computer Systems</italic>, 111, 300-323. https://doi.org/10.1016/j.future.2020.03.055 <pub-id pub-id-type="doi">10.1016/j.future.2020.03.055</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.future.2020.03.055">https://doi.org/10.1016/j.future.2020.03.055</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Li, S.</string-name>
              <string-name>Chen, H.</string-name>
              <string-name>Wang, M.</string-name>
              <string-name>Heidari, A.A.</string-name>
              <string-name>Mirjalili, S.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Slime Mould Algorithm: A New Method for Stochastic Optimization</article-title>
            <source>Future Generation Computer Systems</source>
            <volume>111</volume>
            <pub-id pub-id-type="doi">10.1016/j.future.2020.03.055</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Mirjalili, S. and Mirjalili, S.M. (2019) Genetic Algorithm. In: <italic>Studies</italic><italic>in</italic><italic>Computational</italic><italic>Inte</italic><italic>lligence</italic>, Springer, 43-55. https://doi.org/10.1007/978-3-319-93025-1_4 <pub-id pub-id-type="doi">10.1007/978-3-319-93025-1_4</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-319-93025-1_4">https://doi.org/10.1007/978-3-319-93025-1_4</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Mirjalili, S.</string-name>
              <string-name>Mirjalili, S.M.</string-name>
              <string-name>Intelligence, S</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Genetic Algorithm</article-title>
            <source>In: Studies in Computational Intelligence</source>
            <volume>43</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-319-93025-1_4</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Price, K.V. (2013) Differential Evolution. In: <italic>Intelligent Systems Reference Library</italic>, Springer, 187-214. https://doi.org/10.1007/978-3-642-30504-7_8 <pub-id pub-id-type="doi">10.1007/978-3-642-30504-7_8</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-642-30504-7_8">https://doi.org/10.1007/978-3-642-30504-7_8</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Price, K.V.</string-name>
              <string-name>Library, S</string-name>
            </person-group>
            <year>2013</year>
            <article-title>Differential Evolution</article-title>
            <source>In: Intelligent Systems Reference Library</source>
            <volume>187</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-642-30504-7_8</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Hansen, N., Arnold, D.V. and Auger, A. (2015) Evolution Strategies. In: <italic>Springer Handbook of</italic><italic>Computational Intelligence</italic>, Springer, 871-898. https://doi.org/10.1007/978-3-662-43505-2_44 <pub-id pub-id-type="doi">10.1007/978-3-662-43505-2_44</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-662-43505-2_44">https://doi.org/10.1007/978-3-662-43505-2_44</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Hansen, N.</string-name>
              <string-name>Arnold, D.V.</string-name>
              <string-name>Auger, A.</string-name>
              <string-name>Intelligence, S</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Evolution Strategies</article-title>
            <source>In: Springer Handbook of Computational Intelligence</source>
            <volume>871</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-662-43505-2_44</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Salcedo-Sanz, S., Del Ser, J., Landa-Torres, I., Gil-López, S. and Portilla-Figueras, J.A. (2014) The Coral Reefs Optimization Algorithm: A Novel Metaheuristic for Efficiently Solving Optimization Problems. <italic>The</italic><italic>Scientific World Journal</italic>, 2014, 1-15. https://doi.org/10.1155/2014/739768 <pub-id pub-id-type="doi">10.1155/2014/739768</pub-id><pub-id pub-id-type="pmid">25147860</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1155/2014/739768">https://doi.org/10.1155/2014/739768</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Salcedo-Sanz, S.</string-name>
              <string-name>Ser, J.</string-name>
              <string-name>Landa-Torres, I.</string-name>
              <string-name>Portilla-Figueras, J.A.</string-name>
            </person-group>
            <year>2014</year>
            <article-title>The Coral Reefs Optimization Algorithm: A Novel Metaheuristic for Efficiently Solving Optimization Problems</article-title>
            <source>The Scientific World Journal</source>
            <volume>2014</volume>
            <pub-id pub-id-type="doi">10.1155/2014/739768</pub-id>
            <pub-id pub-id-type="pmid">25147860</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Abdel-Basset, M. and Shawky, L.A. (2019) Flower Pollination Algorithm: A Comprehensive Review. <italic>Artificial Intelligence Review</italic>, 52, 2533-2557. https://doi.org/10.1007/s10462-018-9624-4 <pub-id pub-id-type="doi">10.1007/s10462-018-9624-4</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10462-018-9624-4">https://doi.org/10.1007/s10462-018-9624-4</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Abdel-Basset, M.</string-name>
              <string-name>Shawky, L.A.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Flower Pollination Algorithm: A Comprehensive Review</article-title>
            <source>Artificial Intelligence Review</source>
            <volume>52</volume>
            <pub-id pub-id-type="doi">10.1007/s10462-018-9624-4</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wei, Z., Huang, C., Wang, X., Han, T. and Li, Y. (2019) Nuclear Reaction Optimization: A Novel and Powerful Physics-Based Algorithm for Global Optimization. <italic>IEEE Access</italic>, 7, 66084-66109. https://doi.org/10.1109/access.2019.2918406 <pub-id pub-id-type="doi">10.1109/access.2019.2918406</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/access.2019.2918406">https://doi.org/10.1109/access.2019.2918406</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wei, Z.</string-name>
              <string-name>Huang, C.</string-name>
              <string-name>Wang, X.</string-name>
              <string-name>Han, T.</string-name>
              <string-name>Li, Y.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Nuclear Reaction Optimization: A Novel and Powerful Physics-Based Algorithm for Global Optimization</article-title>
            <source>IEEE Access</source>
            <volume>7</volume>
            <pub-id pub-id-type="doi">10.1109/access.2019.2918406</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Yurtkuran, A. (2019) An Improved Electromagnetic Field Optimization for the Global Optimization Problems. <italic>Computational Intelligence and Neuroscience</italic>, 2019, 1-20. https://doi.org/10.1155/2019/6759106 <pub-id pub-id-type="doi">10.1155/2019/6759106</pub-id><pub-id pub-id-type="pmid">31263494</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1155/2019/6759106">https://doi.org/10.1155/2019/6759106</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Yurtkuran, A.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>An Improved Electromagnetic Field Optimization for the Global Optimization Problems</article-title>
            <source>Computational Intelligence and Neuroscience</source>
            <volume>2019</volume>
            <pub-id pub-id-type="doi">10.1155/2019/6759106</pub-id>
            <pub-id pub-id-type="pmid">31263494</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Faramarzi, A., Heidarinejad, M., Stephens, B. and Mirjalili, S. (2020) Equilibrium Optimizer: A Novel Optimization Algorithm. <italic>Knowledge</italic>- <italic>Based Systems</italic>, 191, Article 105190. https://doi.org/10.1016/j.knosys.2019.105190 <pub-id pub-id-type="doi">10.1016/j.knosys.2019.105190</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.knosys.2019.105190">https://doi.org/10.1016/j.knosys.2019.105190</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Faramarzi, A.</string-name>
              <string-name>Heidarinejad, M.</string-name>
              <string-name>Stephens, B.</string-name>
              <string-name>Mirjalili, S.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Equilibrium Optimizer: A Novel Optimization Algorithm</article-title>
            <source>Knowledge-Based Systems</source>
            <volume>191</volume>
            <elocation-id>105190</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.knosys.2019.105190</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Hashim, F.A., Houssein, E.H., Mabrouk, M.S., Al-Atabany, W. and Mirjalili, S. (2019) Henry Gas Solubility Optimization: A Novel Physics-Based Algorithm. <italic>Future Generation Computer Systems</italic>, 101, 646-667. https://doi.org/10.1016/j.future.2019.07.015 <pub-id pub-id-type="doi">10.1016/j.future.2019.07.015</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.future.2019.07.015">https://doi.org/10.1016/j.future.2019.07.015</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Hashim, F.A.</string-name>
              <string-name>Houssein, E.H.</string-name>
              <string-name>Mabrouk, M.S.</string-name>
              <string-name>Al-Atabany, W.</string-name>
              <string-name>Mirjalili, S.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Henry Gas Solubility Optimization: A Novel Physics-Based Algorithm</article-title>
            <source>Future Generation Computer Systems</source>
            <volume>101</volume>
            <pub-id pub-id-type="doi">10.1016/j.future.2019.07.015</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Mirjalili, S., Mirjalili, S.M. and Hatamlou, A. (2016) Multi-Verse Optimizer: A Nature-Inspired Algorithm for Global Optimization. <italic>Neural Computing and Applications</italic>, 27, 495-513. https://doi.org/10.1007/s00521-015-1870-7 <pub-id pub-id-type="doi">10.1007/s00521-015-1870-7</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s00521-015-1870-7">https://doi.org/10.1007/s00521-015-1870-7</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Mirjalili, S.</string-name>
              <string-name>Mirjalili, S.M.</string-name>
              <string-name>Hatamlou, A.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>Multi-Verse Optimizer: A Nature-Inspired Algorithm for Global Optimization</article-title>
            <source>Neural Computing and Applications</source>
            <volume>27</volume>
            <pub-id pub-id-type="doi">10.1007/s00521-015-1870-7</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Kennedy, J. and Eberhart, R. (1995) Particle Swarm Optimization. <italic>Proceedings of</italic><italic>ICNN</italic>’95— <italic>International Conference on Neural Networks</italic>, Perth, 27 November-1 December 1995, 1942-1948. https://doi.org/10.1109/icnn.1995.488968 <pub-id pub-id-type="doi">10.1109/icnn.1995.488968</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/icnn.1995.488968">https://doi.org/10.1109/icnn.1995.488968</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Kennedy, J.</string-name>
              <string-name>Eberhart, R.</string-name>
              <string-name>Networks, P</string-name>
            </person-group>
            <year>1995</year>
            <article-title>Particle Swarm Optimization</article-title>
            <source>Proceedings of ICNN’95—International Conference on Neural Networks</source>
            <volume>27</volume>
            <pub-id pub-id-type="doi">10.1109/icnn.1995.488968</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B20">
        <label>20.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Mirjalili, S. (2015) The Ant Lion Optimizer. <italic>Advances in Engineering Software</italic>, 83, 80-98. https://doi.org/10.1016/j.advengsoft.2015.01.010 <pub-id pub-id-type="doi">10.1016/j.advengsoft.2015.01.010</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.advengsoft.2015.01.010">https://doi.org/10.1016/j.advengsoft.2015.01.010</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Mirjalili, S.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>The Ant Lion Optimizer</article-title>
            <source>Advances in Engineering Software</source>
            <volume>83</volume>
            <pub-id pub-id-type="doi">10.1016/j.advengsoft.2015.01.010</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B21">
        <label>21.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Mirjalili, S. and Lewis, A. (2016) The Whale Optimization Algorithm. <italic>Advances in Engineering</italic><italic>Software</italic>, 95, 51-67. https://doi.org/10.1016/j.advengsoft.2016.01.008 <pub-id pub-id-type="doi">10.1016/j.advengsoft.2016.01.008</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.advengsoft.2016.01.008">https://doi.org/10.1016/j.advengsoft.2016.01.008</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Mirjalili, S.</string-name>
              <string-name>Lewis, A.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>The Whale Optimization Algorithm</article-title>
            <source>Advances in Engineering Software</source>
            <volume>95</volume>
            <pub-id pub-id-type="doi">10.1016/j.advengsoft.2016.01.008</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B22">
        <label>22.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Heidari, A.A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M. and Chen, H. (2019) Harris Hawks Optimization: Algorithm and Applications. <italic>Future Generation Computer Systems</italic>, 97, 849-872. https://doi.org/10.1016/j.future.2019.02.028 <pub-id pub-id-type="doi">10.1016/j.future.2019.02.028</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.future.2019.02.028">https://doi.org/10.1016/j.future.2019.02.028</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Heidari, A.A.</string-name>
              <string-name>Mirjalili, S.</string-name>
              <string-name>Faris, H.</string-name>
              <string-name>Aljarah, I.</string-name>
              <string-name>Mafarja, M.</string-name>
              <string-name>Chen, H.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>Harris Hawks Optimization: Algorithm and Applications</article-title>
            <source>Future Generation Computer Systems</source>
            <volume>97</volume>
            <pub-id pub-id-type="doi">10.1016/j.future.2019.02.028</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B23">
        <label>23.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Yang, Y., Chen, H., Heidari, A.A. and Gandomi, A.H. (2021) Hunger Games Search: Visions, Conception, Implementation, Deep Analysis, Perspectives, and towards Performance Shifts. <italic>Expert Systems with Applications</italic>, 177, Article 114864. https://doi.org/10.1016/j.eswa.2021.114864 <pub-id pub-id-type="doi">10.1016/j.eswa.2021.114864</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.eswa.2021.114864">https://doi.org/10.1016/j.eswa.2021.114864</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Yang, Y.</string-name>
              <string-name>Chen, H.</string-name>
              <string-name>Heidari, A.A.</string-name>
              <string-name>Gandomi, A.H.</string-name>
              <string-name>Visions, C</string-name>
              <string-name>Implementation, D</string-name>
              <string-name>Analysis, P</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Hunger Games Search: Visions, Conception, Implementation, Deep Analysis, Perspectives, and towards Performance Shifts</article-title>
            <source>Expert Systems with Applications</source>
            <volume>177</volume>
            <elocation-id>114864</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.eswa.2021.114864</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B24">
        <label>24.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Jia, Y.W., Chen, X.T., Yao, C.B. and Li, X. (2023) CEO Election Optimization Algorithm and Its Application in Constrained Optimization Problem. <italic>Soft</italic><italic>Computing</italic>, 27, 7363-7400. https://doi.org/10.1007/s00500-023-07974-8 <pub-id pub-id-type="doi">10.1007/s00500-023-07974-8</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s00500-023-07974-8">https://doi.org/10.1007/s00500-023-07974-8</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Jia, Y.W.</string-name>
              <string-name>Chen, X.T.</string-name>
              <string-name>Yao, C.B.</string-name>
              <string-name>Li, X.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>CEO Election Optimization Algorithm and Its Application in Constrained Optimization Problem</article-title>
            <source>Soft Computing</source>
            <volume>27</volume>
            <pub-id pub-id-type="doi">10.1007/s00500-023-07974-8</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B25">
        <label>25.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Črepinšek, M., Liu, S.H. and Mernik, L. (2012) A Note on Teaching-Learning-Based Optimization Algorithm. <italic>Information</italic><italic>Sciences</italic>, 212, 79-93. https://doi.org/10.1016/j.ins.2012.05.009 <pub-id pub-id-type="doi">10.1016/j.ins.2012.05.009</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ins.2012.05.009">https://doi.org/10.1016/j.ins.2012.05.009</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Liu, S.H.</string-name>
              <string-name>Mernik, L.</string-name>
            </person-group>
            <year>2012</year>
            <article-title>A Note on Teaching-Learning-Based Optimization Algorithm</article-title>
            <source>Information Sciences</source>
            <volume>212</volume>
            <pub-id pub-id-type="doi">10.1016/j.ins.2012.05.009</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B26">
        <label>26.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Ab. Rashid, M.F.F. (2021) Tiki-Taka Algorithm: A Novel Metaheuristic Inspired by Football Playing Style. <italic>Engineering Computations</italic>, 38, 313-343. https://doi.org/10.1108/ec-03-2020-0137 <pub-id pub-id-type="doi">10.1108/ec-03-2020-0137</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1108/ec-03-2020-0137">https://doi.org/10.1108/ec-03-2020-0137</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Rashid, M.F.F.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Tiki-Taka Algorithm: A Novel Metaheuristic Inspired by Football Playing Style</article-title>
            <source>Engineering Computations</source>
            <volume>38</volume>
            <pub-id pub-id-type="doi">10.1108/ec-03-2020-0137</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B27">
        <label>27.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Di Gaspero, L. and Schaerf, A. (2003) Multi-Neighbourhood Local Search with Application to Course Timetabling. In: <italic>Lecture Notes in Computer Science</italic>, Springer, 262-275. https://doi.org/10.1007/978-3-540-45157-0_17 <pub-id pub-id-type="doi">10.1007/978-3-540-45157-0_17</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-540-45157-0_17">https://doi.org/10.1007/978-3-540-45157-0_17</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Gaspero, L.</string-name>
              <string-name>Schaerf, A.</string-name>
              <string-name>Science, S</string-name>
            </person-group>
            <year>2003</year>
            <article-title>Multi-Neighbourhood Local Search with Application to Course Timetabling</article-title>
            <source>In: Lecture Notes in Computer Science</source>
            <volume>262</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-540-45157-0_17</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B28">
        <label>28.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Abualigah, L., Diabat, A., Mirjalili, S., Abd Elaziz, M. and Gandomi, A.H. (2021) The Arithmetic Optimization Algorithm. <italic>Computer Methods in Applied Mechanics and Engineering</italic>, 376, Article 113609. https://doi.org/10.1016/j.cma.2020.113609 <pub-id pub-id-type="doi">10.1016/j.cma.2020.113609</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cma.2020.113609">https://doi.org/10.1016/j.cma.2020.113609</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Abualigah, L.</string-name>
              <string-name>Diabat, A.</string-name>
              <string-name>Mirjalili, S.</string-name>
              <string-name>Elaziz, M.</string-name>
              <string-name>Gandomi, A.H.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>The Arithmetic Optimization Algorithm</article-title>
            <source>Computer Methods in Applied Mechanics and Engineering</source>
            <volume>376</volume>
            <elocation-id>113609</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.cma.2020.113609</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B29">
        <label>29.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Talatahari, S. and Azizi, M. (2021) Chaos Game Optimization: A Novel Metaheuristic Algorithm. <italic>Artificial</italic><italic>Intelligence</italic><italic>Review</italic>, 54, 917-1004. https://doi.org/10.1007/s10462-020-09867-w <pub-id pub-id-type="doi">10.1007/s10462-020-09867-w</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10462-020-09867-w">https://doi.org/10.1007/s10462-020-09867-w</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Talatahari, S.</string-name>
              <string-name>Azizi, M.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Chaos Game Optimization: A Novel Metaheuristic Algorithm</article-title>
            <source>Artificial Intelligence Review</source>
            <volume>54</volume>
            <pub-id pub-id-type="doi">10.1007/s10462-020-09867-w</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B30">
        <label>30.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Selman, B. and Gomes, C.P. (2006) Hill-Climbing Search. In: <italic>Encyclopedia of Cognitive Science</italic>, Palgrave Macmillan, 333-335.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Selman, B.</string-name>
              <string-name>Gomes, C.P.</string-name>
              <string-name>Science, P</string-name>
            </person-group>
            <year>2006</year>
            <article-title>Hill-Climbing Search</article-title>
            <source>In: Encyclopedia of Cognitive Science</source>
            <volume>333</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B31">
        <label>31.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Osaba, E., Diaz, F. and Onieva, E. (2014) Golden Ball: A Novel Meta-Heuristic to Solve Combinatorial Optimization Problems Based on Soccer Concepts. <italic>Applied In</italic><italic>telligence</italic>, 41, 145-166. https://doi.org/10.1007/s10489-013-0512-y <pub-id pub-id-type="doi">10.1007/s10489-013-0512-y</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10489-013-0512-y">https://doi.org/10.1007/s10489-013-0512-y</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Osaba, E.</string-name>
              <string-name>Diaz, F.</string-name>
              <string-name>Onieva, E.</string-name>
            </person-group>
            <year>2014</year>
            <article-title>Golden Ball: A Novel Meta-Heuristic to Solve Combinatorial Optimization Problems Based on Soccer Concepts</article-title>
            <source>Applied Intelligence</source>
            <volume>41</volume>
            <pub-id pub-id-type="doi">10.1007/s10489-013-0512-y</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B32">
        <label>32.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Mirjalili, S. (2016) SCA: A Sine Cosine Algorithm for Solving Optimization Problems. <italic>Knowledge</italic>- <italic>Based Systems</italic>, 96, 120-133. https://doi.org/10.1016/j.knosys.2015.12.022 <pub-id pub-id-type="doi">10.1016/j.knosys.2015.12.022</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.knosys.2015.12.022">https://doi.org/10.1016/j.knosys.2015.12.022</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Mirjalili, S.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>SCA: A Sine Cosine Algorithm for Solving Optimization Problems</article-title>
            <source>Knowledge-Based Systems</source>
            <volume>96</volume>
            <pub-id pub-id-type="doi">10.1016/j.knosys.2015.12.022</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B33">
        <label>33.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Tang, K. (2007) Benchmark Functions for the CEC’2010 Special Session and Competition on Large-Scale Global Optimization. Nature Inspired Computation and Applications Laboratory, University of Science and Technology of China.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Tang, K.</string-name>
              <string-name>Laboratory, U</string-name>
            </person-group>
            <year>2007</year>
            <article-title>Benchmark Functions for the CEC’2010 Special Session and Competition on Large-Scale Global Optimization</article-title>
            <source>Nature Inspired Computation and Applications Laboratory</source>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B34">
        <label>34.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Kaggle (2020) Crop Recommendation Dataset. https://www.kaggle.com/datasets/atharvaingle/crop-recommendation-dataset</mixed-citation>
          <element-citation publication-type="web">
            <year>2020</year>
            <article-title>Crop Recommendation Dataset</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>