<?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.v3i3.116</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group><subject>Low-resource languages, Metaheuristic, Genetic algorithm, Large language models, Natural language processing.</subject></subj-group>
      </article-categories>
      <title-group>
        <article-title>Metaheuristic Optimization of Prompt Structures for Low-Resource Language Models</article-title><subtitle>Metaheuristic Optimization of Prompt Structures for Low-Resource Language Models</subtitle></title-group>
      <contrib-group><contrib contrib-type="author">
	<name name-style="western">
	<surname>Al-Harthy </surname>
		<given-names>Abdulrahman </given-names>
	</name>
	<aff>Department of Computer Science, Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia.</aff>
	</contrib><contrib contrib-type="author">
	<name name-style="western">
	<surname>Thi Lan</surname>
		<given-names>Nguyen </given-names>
	</name>
	<aff>School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam.</aff>
	</contrib></contrib-group>		
      <pub-date pub-type="ppub">
        <month>09</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>10</day>
        <month>09</month>
        <year>2026</year>
      </pub-date>
      <volume>3</volume>
      <issue>3</issue>
      <permissions>
        <copyright-statement>© 2026 reapress</copyright-statement>
        <copyright-year>2026</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 Optimization of Prompt Structures for Low-Resource Language Models</article-title>
      </related-article>
	  <abstract abstract-type="toc">
		<p>
			Large Language Models (LLMs) have demonstrated remarkable capabilities across a range of Natural Language Processing (NLP) tasks when guided by carefully designed prompts. However, their performance degrades substantially on low-resource languages, where limited pretraining data and the absence of large-scale labeled corpora render conventional prompt engineering strategies ineffective. In this paper, we introduce Evolutionary Prompt Optimization for Low-Resource Language Models (EvoPrompt-LR), a novel framework that employs a hybrid Genetic Algorithm with Simulated Annealing (GA-SA) to automatically discover optimal prompt structures for low-resource languages. EvoPrompt-LR features four key innovations: 1) a hierarchical prompt genome encoding that jointly optimizes instruction templates, in-context example selection and ordering, Chain-of-Thought (CoT) scaffold structures, and output format specifications, 2) a cross-lingual fitness transfer mechanism that evaluates prompt candidates on high-resource proxy languages before selectively fine-evaluating top candidates on the target low-resource language, reducing expensive evaluations by approximately 80%, 3) semantic diversity preservation via embedding-space crowding distance to maintain a diverse population of prompt candidates, and 4) language-specific mutation operators that respect the morphological and syntactic constraints of typologically diverse languages, including agglutinative (Vietnamese, Turkish, Uzbek), fusional (Arabic), and isolating (Khmer) language families. We evaluate EvoPrompt-LR on six low-resource languages Arabic (dialectal), Vietnamese, Swahili, Yoruba, Uzbek, and Khmer across four NLP tasks: Sentiment analysis, Named Entity Recognition (NER), Question Answering (QA), and text summarization, using LLaMA-3-8B, Mistral-7B, and AceGPT-7B as base models. Experimental results demonstrate that EvoPrompt-LR achieves improvements of 8–22% in accuracy and F1 score over the strongest baselines, with the largest gains observed on truly low-resource languages (Yoruba: +22%, Khmer: +19%). On four of six languages, EvoPrompt-LR attains performance competitive with Supervised Fine-Tuning (SFT) approaches that use 100× more labeled data.
		</p>
		</abstract>
    </article-meta>
  </front>
  <body></body>
  <back>
    <ack>
      <p>null</p>
    </ack>
  </back>
</article>