<?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">reapress</journal-id>
      <journal-id journal-id-type="publisher-id">null</journal-id>
      <journal-title>reapress</journal-title><issn pub-type="ppub">3042-2248</issn><issn pub-type="epub">3042-2248</issn><publisher>
      	<publisher-name>reapress</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">https://doi.org/10.48313/maa.vi.25</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group><subject>Metaheuristic algorithms, Computation offloading, Service placement, Computation paradigms.</subject></subj-group>
      </article-categories>
      <title-group>
        <article-title>Metaheuristic Algorithms for Computation Offloading: A Comprehensive Review</article-title><subtitle>Metaheuristic Algorithms for Computation Offloading: A Comprehensive Review</subtitle></title-group>
      <contrib-group><contrib contrib-type="author">
	<name name-style="western">
	<surname>Maghsoudi </surname>
		<given-names>Amin </given-names>
	</name>
	<aff>Department of Computer and Information Technology Engineering, Qa. c., Islamic Azad University, Qazvin, Iran.</aff>
	</contrib><contrib contrib-type="author">
	<name name-style="western">
	<surname>Ghahramankhani</surname>
		<given-names>Behnam </given-names>
	</name>
	<aff>Department of Computer and Information Technology Engineering, La. c., Islamic Azad University, Lahijan, Iran.</aff>
	</contrib></contrib-group>		
      <pub-date pub-type="ppub">
        <month>12</month>
        <year>2025</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>22</day>
        <month>12</month>
        <year>2025</year>
      </pub-date>
      <volume>2</volume>
      <issue>4</issue>
      <permissions>
        <copyright-statement>© 2025 reapress</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>Metaheuristic Algorithms for Computation Offloading: A Comprehensive Review</article-title>
      </related-article>
	  <abstract abstract-type="toc">
		<p>
			With the development of computing paradigms such as edge computing, fog computing, and cloud computing, and the need for users to process their requested services, deciding which services should be processed locally and which ones should be processed non-locally has become a challenge. This issue is addressed by the concept of computation offloading. computation offloading is a process in which heavy computational tasks are transferred from resource-constrained devices, such as Internet of Things (IoT) devices, smartphones, and sensors, to remote computing servers with significant computational capacity. Due to the existence of numerous conditions, including environmental dynamics, user mobility, etc., and the existence of various criteria such as latency, energy consumption, cost, etc., the  computation offloading problem is classified as NP-Hard . To address these problems and reach a near-optimal solution in rational time, we can use metaheuristic algorithms. In this study, we review and analyze relevant research in the field of computational offloading using metaheuristic algorithms. This article can provide a perspective for researchers interested in research in this field and inform them about the challenges and open issues in this field.
		</p>
		</abstract>
    </article-meta>
  </front>
  <body></body>
  <back>
    <ack>
      <p>null</p>
    </ack>
  </back>
</article>