<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="nlm-ta">Rea Press</journal-id>
      <journal-id journal-id-type="publisher-id">Null</journal-id>
      <journal-title>Rea Press</journal-title><issn pub-type="ppub">3042-2248</issn><issn pub-type="epub">3042-2248</issn><publisher>
      	<publisher-name>Rea Press</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi"> https://doi.org/10.48313/maa.v2i1.34</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group><subject>Metaheuristic, Optimization, Feature selection, Nondeterministic polynomial-hard, Machine learning</subject></subj-group>
      </article-categories>
      <title-group>
        <article-title>Feature Selection with Metaheuristic Algorithms: A Review of Recent Developments (2020–2025)</article-title><subtitle>Feature Selection with Metaheuristic Algorithms: A Review of Recent Developments (2020–2025)</subtitle></title-group>
      <contrib-group><contrib contrib-type="author">
	<name name-style="western">
	<surname>Gochhait</surname>
		<given-names>Saikat </given-names>
	</name>
	<aff>Federal State Budgetary Educational Institution of Higher Education, Samara State Medical University, Ministry of Healthcare, Samara, Russia.</aff>
	</contrib></contrib-group>		
      <pub-date pub-type="ppub">
        <month>03</month>
        <year>2025</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>24</day>
        <month>03</month>
        <year>2025</year>
      </pub-date>
      <volume>2</volume>
      <issue>1</issue>
      <permissions>
        <copyright-statement>© 2025 Rea Press</copyright-statement>
        <copyright-year>2025</copyright-year>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/2.5/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p></license>
      </permissions>
      <related-article related-article-type="companion" vol="2" page="e235" id="RA1" ext-link-type="pmc">
			<article-title>Feature Selection with Metaheuristic Algorithms: A Review of Recent Developments (2020–2025)</article-title>
      </related-article>
	  <abstract abstract-type="toc">
		<p>
			Feature selection is a critical preprocessing step in machine learning, aimed at identifying relevant features from high-dimensional datasets to improve model performance and reduce computational cost. Due to its  Nondeterministic Polynomial (NP)-hard nature, metaheuristic algorithms have gained prominence for efficiently navigating the vast search space. This review examines approximately 150 metaheuristic algorithms developed or refined between 2020 and 2025, categorized into evolutionary, physics-based, human-social, and swarm intelligence approaches. Swarm intelligence algorithms dominate recent advances, comprising 55% of the surveyed methods, reflecting their scalability and effectiveness in complex domains such as healthcare and cybersecurity. The review highlights algorithmic trends, including hybridization, chaos-based diversity enhancement, and multi-objective optimization, and proposes future directions focused on adaptive, interpretable, and Artificial Intelligence (AI)-integrated frameworks.
		</p>
		</abstract>
    </article-meta>
  </front>
  <body></body>
  <back>
    <ack>
      <p>Null</p>
    </ack>
  </back>
</article>