<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink">
<front><article-meta>
<title-group><article-title>Applications of Metaheuristic Algorithms in Nutritional Optimization and Personalized Diet Planning: A Review</article-title></title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Karimi</surname><given-names>Habibeh</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<contrib contrib-type="author"><name><surname>Kumar Das</surname><given-names>Sapan</given-names></name><xref ref-type="aff" rid="aff2"/></contrib>
<contrib contrib-type="author"><name><surname>Khalilian</surname><given-names>Bardia</given-names></name><xref ref-type="aff" rid="aff3"/></contrib>
<aff id="aff1">Department of Research Center, Shiroud Municipality, Mazandaran, Iran.</aff>
<aff id="aff2">Department of Mathematics, National Institute of Technology Jamshedpur, 831014 Jharkhand, India.</aff>
<aff id="aff3">Department of Management and International Business (MIB), University of Auckland, 1142 Auckland, New Zealand.</aff>
</contrib-group>
<abstract><p>Nutritional optimization links food selection and meal scheduling to nutrient adequacy, affordability, preferences and environmental objectives. This narrative review examines where metaheuristic search can assist these decisions and where linear or mixed-integer programming offers a more informative baseline. It distinguishes the optimization of a dietary model from evidence that a recommended diet improves health. Genetic and multi-objective evolutionary methods are discussed alongside particle swarm and differential evolution as possible search architectures, with attention to encoding, feasibility repair and expensive preference models. Published diet-modeling work supports the importance of acceptability constraints, and a multi-level NSGA-II menu-planning study illustrates the joint treatment of meals, days and weekly menus. The review develops an evaluation framework covering constraint satisfaction, solution quality, computational budget, dietary diversity and independent validation. It does not estimate pooled algorithm effects or establish a universal optimizer ranking. Traceability limitations in the numerical compilations restrict quantitative synthesis. Priorities include transparent food databases, matched mathematical-programming comparisons, clinically appropriate constraints and prospective assessment of adoption and outcomes.</p></abstract>
<kwd-group kwd-group-type="author"><kwd>Diet optimization</kwd><kwd>Menu planning</kwd><kwd>Nutritional constraints</kwd><kwd>Metaheuristics</kwd><kwd>Multi-objective optimization</kwd><kwd>Decision support</kwd></kwd-group>
</article-meta></front>
<body>
<sec id="sec-1"><label>1</label><title>Introduction</title>
<p>Diet planning is an optimization problem only after its decision variables, nutritional requirements and measures of acceptability have been specified. A low-cost combination of foods can satisfy nutrient targets while remaining difficult to prepare, culturally unsuitable or unacceptable to the intended person. Diet-modeling reviews therefore treat nutrient, cost, environmental and acceptability constraints as distinct modeling requirements <xref ref-type="bibr" rid="ref-1">[1]</xref>, <xref ref-type="bibr" rid="ref-2">[2]</xref>. This review examines the role of metaheuristics in nutritional optimization and personalized menu planning through that formulation-first perspective.</p>
<p>Linear programming provides an established starting point when food quantities, nutrient totals and cost are linear. Discrete food inclusion, portion alternatives, meal timing, repetition restrictions and nonlinear preference models can require integer or nonlinear formulations. Metaheuristics supply search procedures for such formulations, but their usefulness must be assessed against the strongest applicable exact or specialized methods rather than inferred from biological inspiration <xref ref-type="bibr" rid="ref-3">[3]</xref>.</p>
<p>The No Free Lunch results concern averages over specified collections of objective functions <xref ref-type="bibr" rid="ref-4">[4]</xref>. They do not require continual invention of new metaphor-based algorithms and do not preclude useful performance differences on structured diet problems. For menu planning, the relevant questions are whether the representation preserves meal structure, whether feasibility is maintained, and whether search improves a decision-relevant objective within a defined budget.</p>
<p>The central comparison in this review is between the mathematical structure of a dietary decision and the mechanisms offered by an optimizer. Genetic algorithms can manipulate food and meal assignments; particle swarm optimization and differential evolution operate naturally on real-valued quantities or parameters <xref ref-type="bibr" rid="ref-5">[5]</xref>, <xref ref-type="bibr" rid="ref-6">[6]</xref>. A multi-objective approach can retain trade-offs among cost, dietary change and other objectives, provided that hard nutritional requirements remain explicit.</p>
<p>The contribution is a critical organization of formulation choices, search mechanisms and validation requirements for diet planning. Sections 2 and 3 establish the modeling context and the narrative review boundary. Section 4 discusses search architectures, Section 5 connects them to meal and menu decisions, and Sections 6 and 7 examine evaluation and future research. The conclusions concern methodological choices rather than field-wide algorithm frequencies or pooled clinical effects.</p>
<p>Personalization requires more than replacing a demographic average with an individual record. The model must identify which requirements are established nutritional constraints, which preferences are elicited, and which response estimates come from predictive models. The optimization layer cannot confer clinical validity on an unvalidated response model. Recommendations intended for a medical condition require independently justified, condition-specific constraints and appropriate professional assessment.</p>
</sec>
<sec id="sec-2"><label>2</label><title>Background and Context</title>
<p>The modeling background connects dietary quantities and schedules to feasibility, objectives and the distinction between a computational optimum and a usable menu.</p>
<sec id="sec-3"><label>2.1</label><title>Definitions and Fundamental Concepts</title>
<p>A metaheuristic is a high-level search strategy that guides lower-level solution transformations <xref ref-type="bibr" rid="ref-3">[3]</xref>. Population-based methods maintain several candidates, while trajectory-based methods modify one candidate over time. Neither family automatically guarantees a globally optimal result within a finite budget. Dietary constraints should be checked on the decoded menu, including quantities, units and all applicable daily or weekly bounds. A candidate menu can be encoded by food identity, portion quantity and assigned meal or day. The same numerical vector may represent a feasible diet under one food database and an infeasible diet under another. Constraint repair and penalization therefore belong to the method definition. A low penalized objective is insufficient when a remaining violation concerns a required nutrient bound or an exclusion such as an allergy.</p>
</sec>
<sec id="sec-4"><label>2.2</label><title>Historical Evolution</title>
<p>The development of evolutionary and swarm methods provides a repertoire of search mechanisms rather than a hierarchy of diet-planning effectiveness. Particle swarm optimization uses individual and neighborhood search information <xref ref-type="bibr" rid="ref-5">[5]</xref>; differential evolution builds trial vectors from population differences <xref ref-type="bibr" rid="ref-6">[6]</xref>; ant-system methods construct combinatorial solutions through learned pheromone information <xref ref-type="bibr" rid="ref-7">[7]</xref>. Their dietary application requires domain-specific decoding and constraint handling.</p>
<p>Multi-objective evolutionary methods such as NSGA-II maintain non-dominated candidate solutions <xref ref-type="bibr" rid="ref-8">[8]</xref>. These are approximations to a trade-off set, not certificates that the entire Pareto frontier has been recovered. Feasibility, coverage of the trade-off surface and the stability of selected menus under reasonable preference changes matter more than the name or metaphor of the search method.</p>
<fig id="fig1"><label>Figure 1</label><caption><p>General search components.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:2:66,457.6,537.1,661.9"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>The schematic organizes search, repair, selection and adaptation; it does not establish a convergence guarantee or a validated dietary workflow (<xref ref-type="fig" rid="fig1">Fig. 1</xref>).</p>
</sec>
</sec>
<sec id="sec-5"><label>3</label><title>Review Scope and Evidence Boundary</title>
<p>This article is a narrative methodological review of nutritional optimization and personalized menu planning. The literature is used to connect established dietary formulations to search and validation choices. No reproducible search log, deduplicated inclusion list or study-level extraction database is available for the numerical search compilation in <xref ref-type="table" rid="tab1">Table 1</xref>. Its reported counts are therefore not used to define a systematic-review population or to estimate algorithm prevalence.</p>
<table-wrap id="tab1"><label>Table 1</label><caption><p>Unverified search-count compilation.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:2:66,160.7,537.1,284.9"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>The analytic synthesis is based on identifiable source connections rather than the counts in <xref ref-type="table" rid="tab1">Table 1</xref>. In particular, van Dooren examines nutritional, economic, environmental and acceptability constraints <xref ref-type="bibr" rid="ref-1">[1]</xref>, Donkor and colleagues review linear-programming formulations <xref ref-type="bibr" rid="ref-2">[2]</xref>, and Koroušić Seljak <xref ref-type="bibr" rid="ref-9">[9]</xref> describes multi-level evolutionary menu planning. Their differing questions and evaluation settings preclude a pooled comparison of optimizer performance.</p>
</sec>
<sec id="sec-6"><label>4</label><title>Survey of Metaheuristic Algorithms</title>
<p>The following algorithm families are considered through their representations and constraint mechanisms. No claim is made that their relative popularity or performance has been measured across a complete diet-</p>
<fig id="fig2"><label>Figure 2</label><caption><p>Unverified calibration plot.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:3:65.9,436.2,537.1,710.4"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>The underlying predictions, outcomes and bin counts are unspecified, so the plot supplies no evidence of calibration quality for a dietary prediction or recommendation system (<xref ref-type="fig" rid="fig2">Fig. 2</xref>).</p>
<sec id="sec-7"><label>4.1</label><title>Evolutionary Algorithms</title>
<p>Evolutionary algorithms use selection and variation to update a population of candidate menus or parameter vectors. Genetic operators can exchange meals or food assignments, but unrestricted crossover may violate daily nutrient bounds or repetition limits. Differential evolution operates on continuous vectors <xref ref-type="bibr" rid="ref-6">[6]</xref>, while CMA-ES adapts the covariance of a sampling distribution <xref ref-type="bibr" rid="ref-10">[10]</xref>. Their original mechanisms do not automatically solve mixed food-selection and portion-scheduling constraints.</p>
<p>Adaptive differential evolution changes search-control parameters during optimization; SHADE is a documented example <xref ref-type="bibr" rid="ref-11">[11]</xref>. Adaptation can reduce reliance on a fixed parameter choice but is not parameter-free and does not ensure superiority on dietary tasks. Hybrid local refinement may improve a candidate menu, and it must be compared with a matched search budget and a clearly specified feasibility rule.</p>
</sec>
<sec id="sec-8"><label>4.2</label><title>Swarm Intelligence</title>
<p>Particle swarm optimization updates a candidate using individual and social search information <xref ref-type="bibr" rid="ref-5">[5]</xref>. For diet planning, a particle can describe portion quantities or model parameters, whereas discrete food inclusion requires a specified discrete transformation. Ant-system methods build combinatorial candidates <xref ref-type="bibr" rid="ref-7">[7]</xref>; a meal sequence or food-assignment graph is a possible representation, but nutritional totals must still be checked separately.</p>
<p>Search simplicity is an implementation property, not evidence of nutritional suitability. Particle velocities, trial-vector differences and pheromone updates all require bounds, decoding conventions and stopping criteria. Changing these elements can have a larger practical effect than changing the algorithm label. Reported dietary benefits require evidence on the resulting feasible menus and their actual use.</p>
</sec>
<sec id="sec-9"><label>4.3</label><title>Physics- and Bio-Inspired Methods</title>
<p>Trajectory-based search can modify one meal or portion at a time, while population-based methods can retain several dietary alternatives. The essential distinction is the mechanism for proposing, evaluating and accepting feasible candidates. A new biological metaphor supplies no additional evidence unless it corresponds to a distinct operator or a testable architectural change <xref ref-type="bibr" rid="ref-12">[12]</xref>.</p>
<p>Hybridization can combine global search with mathematical programming or local repair. For example, discrete meal assignments can be proposed by a metaheuristic and quantities adjusted by a suitable programming subproblem. The subproblem must be stated precisely, and the cost of repair, tuning and final feasibility checks must be included in the comparison. A hybrid advantage is a question to test, not a default</p>
<fig id="fig3"><label>Figure 3</label><caption><p>Unverified publication-count graphic.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:4:65.9,423.4,537.1,621.6"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>Its vertical axis reports publications, not the introduction dates of named algorithms; no historical or dietary publication trend is inferred from it (<xref ref-type="fig" rid="fig3">Fig. 3</xref>).</p>
</sec>
</sec>
<sec id="sec-10"><label>5</label><title>Applications</title>
<p>Dietary applications differ in the decision they optimize: food quantities, multi-day menus, individual preference adaptation or the balance of nutritional and environmental objectives. This distinction determines what a useful search procedure must preserve.</p>
<sec id="sec-11"><label>5.1</label><title>Primary Application Areas</title>
<p>Nutrient-constrained food composition remains an important mathematical-programming baseline <xref ref-type="bibr" rid="ref-1">[1]</xref>, <xref ref-type="bibr" rid="ref-2">[2]</xref>. A diet model should identify food quantities and units, nutrient lower and upper bounds, budget restrictions and any excluded foods. When all relevant relationships are linear, a generic metaheuristic comparison should include a linear-programming solution and report the optimality gap where available. Integer menu choices should instead be compared with an appropriate mixed-integer or constraint-based baseline.</p>
<p>Koroušić Seljak provides a concrete evolutionary menu-planning architecture <xref ref-type="bibr" rid="ref-9">[9]</xref>. The method applies NSGA-II at meal, daily and weekly levels, with food identity and quantity represented within nested menu structures. Its significance for this review is the explicit coordination of constraints at different nutritional time scales. It is not evidence that the same architecture is clinically effective for every population or that it outperforms all modern exact solvers.</p>
<p>Personalized and sustainable diet design adds preference and environmental objectives without changing the need for nutritional feasibility. The reviewed diet-modeling literature identifies acceptability as a substantive modeling challenge <xref ref-type="bibr" rid="ref-1">[1]</xref>. Predicted preferences, observed adherence and clinical outcomes are different quantities. Validation should therefore separate satisfaction of the mathematical model from acceptance by the user and subsequent health effects.</p>
<table-wrap id="tab2"><label>Table 2</label><caption><p>Unvalidated qualitative ratings retained from the numerical compilation.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,594.7,537.1,721.1"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<fig id="fig4"><label>Figure 4</label><caption><p>Unverified rank graphic.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,396.3,537.1,603.7"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>The functions, observations and ranking rule are unspecified, and the displayed values are not a valid complete within-function ranking of eight algorithms. It is excluded from the analytic synthesis (<xref ref-type="fig" rid="fig4">Fig. 4</xref>).</p>
</sec>
</sec>
<sec id="sec-12"><label>6</label><title>Challenges and Limitations</title>
<p>The principal limitations concern the formulation, the evidence for numerical comparisons and the relationship between a feasible menu and a useful dietary intervention. The unverified tables and quantitative graphics cannot establish algorithm superiority, publication trends or clinical effectiveness.</p>
<sec id="sec-13"><label>6.1</label><title>Parameter Tuning</title>
<p>Parameter settings should be selected using a tuning budget separate from final evaluation. Population size, stopping rules and repair frequency can change both computational cost and feasible-menu quality. Adaptive mechanisms such as CMA-ES and SHADE modify particular search components <xref ref-type="bibr" rid="ref-10">[10]</xref>, <xref ref-type="bibr" rid="ref-11">[11]</xref>; they still require implementation choices, initial settings and an evaluation budget.</p>
</sec>
<sec id="sec-14"><label>6.2</label><title>Benchmark Fairness and Reproducibility</title>
<p>Fair comparisons require the same food database, nutritional constraints, user profile, objective definitions and computational resources. Exact or bounded solutions should be used where feasible. Stochastic methods require independent runs, but repeated seeds on the same menu instance do not create independent dietary populations. Comparative claims should report feasibility rates and decision-relevant gaps alongside run variability <xref ref-type="bibr" rid="ref-13">[13]</xref>.</p>
</sec>
<sec id="sec-15"><label>6.3</label><title>Theoretical Analysis and Scalability</title>
<p>Theoretical convergence and practical usability are separate questions. A search process may have an asymptotic property under ideal conditions while returning infeasible or unacceptable menus within the operational time limit. Scaling analysis must include candidate evaluation, food-data access, repair and any predictive model used in the objective. The optimization model also inherits errors and omissions in its food composition and preference data.</p>
<p>When algorithms are evaluated on the same independent menu instances, paired tests preserve the matching. Wilcoxon signed-rank comparisons and a suitable multiple-comparison procedure can be considered, while rank-sum testing addresses independent samples. Friedman and Nemenyi methods require a complete matched algorithm-by-instance design and valid ranks <xref ref-type="bibr" rid="ref-13">[13]</xref>, <xref ref-type="bibr" rid="ref-14">[14]</xref>. Confidence intervals and effect sizes should be reported for the defined independent unit rather than treating correlated runs as unrelated studies.</p>
<fig id="fig5"><label>Figure 5</label><caption><p>Unverified theory–practice curves.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:6:66,374.9,537.1,593"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>No mathematical prediction, experiment or dietary endpoint is specified, so the curves do not validate a theorem or an optimization method (<xref ref-type="fig" rid="fig5">Fig. 5</xref>).</p>
</sec>
</sec>
<sec id="sec-16"><label>7</label><title>Future Research Directions</title>
<p>A useful research agenda begins with diet-specific benchmarks and transparent formulations. The main questions are feasibility, acceptability, uncertainty in food data and the practical value of additional optimization complexity.</p>
<p>Surrogate models can approximate expensive preference or response calculations, but optimizer evaluations should be periodically checked against the underlying model or observations. When machine learning predicts an individual response, predictive performance must be evaluated on information unavailable during model selection. Optimizing that prediction is a subsequent decision step and does not repair a biased predictor. Multi-objective search should present feasible alternatives whose cost, nutritional adequacy, environmental footprint and departure from current habits can be interpreted by the intended decision-maker. Changes in these objectives or in elicited preferences should be examined for their effect on the chosen menu. A stable numerical ranking alone does not demonstrate that users accept the resulting choices.</p>
<p>Future comparative studies should release food-data versions, constraint definitions, menu instances, algorithm configurations, independent seeds and the scripts used to calculate results. Reporting should distinguish simulated user profiles from observed participants and distinguish computational feasibility from adoption and health outcomes. Prospective deployment requires appropriate nutritional expertise and study design.</p>
<p>This review has a bounded narrative evidence base. It does not provide an exhaustive systematic search, a reproducible bibliometric survey or a new benchmark experiment. The numerical search counts, ordinal ratings and quantitative figures remain outside the validated conclusions until their source records and generating procedures are established.</p>
</sec>
<sec id="sec-17"><label>8</label><title>Conclusion</title>
<p>Metaheuristics can contribute to nutritional optimization when the dietary decision contains discrete, nonlinear or expensive components that justify the search architecture. The strongest methodological principle is to formulate and validate the decision before selecting an optimizer. Linear and mixed-integer programming remain essential baselines, while evolutionary menu planning illustrates how constraints at meal, daily and weekly levels can be coordinated.</p>
<p>The available source connections support careful treatment of nutritional feasibility, acceptability and trade-offs rather than a universal algorithm ranking. Computational comparisons should account for tuning and evaluation budgets, maintain matched instances and verify every final menu against its constraints. Clinical effectiveness and sustained adoption require evidence beyond optimization scores.</p>
<p>Progress depends on transparent dietary models and validation that follows the path from data to menu, from menu to use, and from use to outcomes. A reproducible, domain-specific comparison has greater scientific value than an unsupported claim of optimizer superiority.</p>
</sec>
<sec id="sec-18"><title>Funding</title>
<p>This research received no external funding.</p>
</sec>
<sec id="sec-19"><title>Data Availability</title>
<p>Sufficient data is available upon request.</p>
</sec>
<sec id="sec-20"><title>Conflict of Interest</title>
<p>No potential conflict of interest was reported by the authors.</p>
</sec>
<sec id="sec-21"><title>Consent for Publication</title>
<p>All authors have provided their consent for the publication of this manuscript.</p>
</sec>
<sec id="sec-22"><title>Ethics Approval and Consent to Participate</title>
<p>This article does not involve studies with human participants or animals conducted by any authors.</p>
</sec>
</body>
<back><ref-list><title>References</title>
<ref id="ref-1"><label>1</label><mixed-citation>Van Dooren, C. (2018). A review of the use of linear programming to optimize diets, nutritiously, economically and environmentally. Frontiers in nutrition, 5, 48. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fnut.2018.00048">https://doi.org/10.3389/fnut.2018.00048</ext-link></mixed-citation></ref>
<ref id="ref-2"><label>2</label><mixed-citation>Donkor, L., Essien, E., &amp; Affrifah, N. S. (2023). A systematic review of linear programming techniques as applied to diet optimisation and opportunities for improvement. Journal of optimization, 2023(1), 1271115. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1155/2023/1271115">https://doi.org/10.1155/2023/1271115</ext-link></mixed-citation></ref>
<ref id="ref-3"><label>3</label><mixed-citation>Blum, C., &amp; Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM computing surveys (CSUR), 35(3), 268–308. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/937503.937505">https://doi.org/10.1145/937503.937505</ext-link></mixed-citation></ref>
<ref id="ref-4"><label>4</label><mixed-citation>Wolpert, D. H., &amp; Macready, W. G. (1997). No free lunch theorems for optimization. IEEE transactions on evolutionary computation, 1(1), 67–82. <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></ref>
<ref id="ref-5"><label>5</label><mixed-citation>Kennedy, J., &amp; Eberhart, R. (1995). Particle swarm optimization. Proceedings of ICNN’95-international conference on neural networks (Vol. 4, pp. 1942–1948). IEEE. <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></ref>
<ref id="ref-6"><label>6</label><mixed-citation>Storn, R., &amp; Price, K. (1997). Differential evolution--a simple and efficient heuristic for global optimization over continuous spaces. Journal of global optimization, 11(4), 341–359. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1023/A:1008202821328">https://doi.org/10.1023/A:1008202821328</ext-link></mixed-citation></ref>
<ref id="ref-7"><label>7</label><mixed-citation>Dorigo, M., Maniezzo, V., &amp; Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. IEEE transactions on systems, man, and cybernetics, part b (cybernetics), 26(1), 29–41. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/3477.484436">https://doi.org/10.1109/3477.484436</ext-link></mixed-citation></ref>
<ref id="ref-8"><label>8</label><mixed-citation>Deb, K., Pratap, A., Agarwal, S., &amp; Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE transactions on evolutionary computation, 6(2), 182–197. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/4235.996017">https://doi.org/10.1109/4235.996017</ext-link></mixed-citation></ref>
<ref id="ref-9"><label>9</label><mixed-citation>Seljak, B. K. (2006). Dietary menu planning using an evolutionary method. 2006 international conference on intelligent engineering systems (pp. 108–113). IEEE. <ext-link ext-link-type="uri" xlink:href="https://ev.fe.uni-lj.si/5-2007/Korousic.pdf">https://ev.fe.uni-lj.si/5-2007/Korousic.pdf</ext-link></mixed-citation></ref>
<ref id="ref-10"><label>10</label><mixed-citation>Hansen, N. (2006). The CMA evolution strategy: a comparing review. Towards a new evolutionary computation: advances in the estimation of distribution algorithms, 75–102. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/3-540-32494-1_4">https://doi.org/10.1007/3-540-32494-1_4</ext-link></mixed-citation></ref>
<ref id="ref-11"><label>11</label><mixed-citation>Tanabe, R., &amp; Fukunaga, A. (2013). Success-history based parameter adaptation for differential evolution. 2013 IEEE congress on evolutionary computation (pp. 71–78). IEEE. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/CEC.2013.6557555">https://doi.org/10.1109/CEC.2013.6557555</ext-link></mixed-citation></ref>
<ref id="ref-12"><label>12</label><mixed-citation>Sörensen, K. (2015). Metaheuristics—the metaphor exposed. International transactions in operational research, 22(1), 3–18. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1111/itor.12001">https://doi.org/10.1111/itor.12001</ext-link></mixed-citation></ref>
<ref id="ref-13"><label>13</label><mixed-citation>Derrac, J., García, S., Molina, D., &amp; Herrera, F. (2011). A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and evolutionary computation, 1(1), 3–18. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.swevo.2011.02.002">https://doi.org/10.1016/j.swevo.2011.02.002</ext-link></mixed-citation></ref>
<ref id="ref-14"><label>14</label><mixed-citation>Demšar, J. (2006). Statistical comparisons of classifiers over multiple data sets. Journal of machine learning research, 7(1), 1–30. <ext-link ext-link-type="uri" xlink:href="http://www.jmlr.org/papers/volume7/demsar06a/demsar06a.pdf">http://www.jmlr.org/papers/volume7/demsar06a/demsar06a.pdf</ext-link></mixed-citation></ref>
</ref-list></back>
</article>