<?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.80</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group><subject>Generative agents, Bacterial foraging optimization, Large language models, Surrogate-assisted optimization, Stigmergy, Expensive black-box optimization.</subject></subj-group>
      </article-categories>
      <title-group>
        <article-title>Generative Agent Swarm: Bacterial Foraging with K LLM-Mediated Pheromone Communication</article-title><subtitle>Generative Agent Swarm: Bacterial Foraging with K LLM-Mediated Pheromone Communication</subtitle></title-group>
      <contrib-group><contrib contrib-type="author">
	<name name-style="western">
	<surname>Ferreira</surname>
		<given-names>Daniel A. </given-names>
	</name>
	<aff>School of Electrical and Computer Engineering, University of Campinas, Campinas, Brazil.</aff>
	</contrib></contrib-group>		
      <pub-date pub-type="ppub">
        <month>06</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>05</day>
        <month>06</month>
        <year>2026</year>
      </pub-date>
      <volume>3</volume>
      <issue>2</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>Generative Agent Swarm: Bacterial Foraging with K LLM-Mediated Pheromone Communication</article-title>
      </related-article>
	  <abstract abstract-type="toc">
		<p>
			Expensive black-box optimization spends its budget fast. Simulation-driven engineering design and hyperparameter tuning admit only a few hundred true function evaluations, so every observation collected during the search becomes a priced asset. This paper deploys GAS-Bacterial Foraging Optimization (BFO), a surrogate-assisted optimizer in which a swarm of thirty large-language-model-mediated bacterial agents runs chemotaxis over a shared collective memory. Agents post structured textual observations of their local landscape throughout the run, and every ten iterations a language model condenses this memory into a natural-language pheromone, a small set of weighted region summaries that defines an explicit chemoattractant field biasing every agent's movement; a hallucination guard cross-checks each directional cue against the surrogate gradient and falls back to a classical tumble on disagreement. The evaluation rebuilds the budget ledger from the ground up: Twelve problems, ten mathematical benchmarks and two simulated engineering cases, three budget tiers of 150, 400, and 900 true evaluations, thirty runs per cell, and fourteen methods, nine established references plus four language-model optimizers newly admitted to the race, OPRO, FunSearch, EoH, and ReEvo, raced under token-matched accounting. Survival analysis on tier-relative time-to-target carries the inference: GAS-BFO holds the best mean gap on 22 of 36 problem-tier cells, reaches the target gap with the highest probability at every tier, and is significantly faster than all thirteen rivals at the 400- and 900-evaluation tiers under Holm-corrected log-rank tests, with hazard ratios pricing the separation, while conceding specific cells, the mixed-space tuning task to Tree-structured Parzen Estimation (TPE) among them, that the ledger records openly. Ablations attribute the gain to generative condensation and collective memory; the token tables state the price, one to three dollars per run at deployment tiers; and under bursty message dropout and controlled distributional shift the swarm amortizes knowledge where single-model and single-history rivals concentrate it, retaining 79.4% of lossless quality at a 60% loss rate against 41.2% for Bayesian Optimization with Expected Improvement (BO-EI). 
		</p>
		</abstract>
    </article-meta>
  </front>
  <body></body>
  <back>
    <ack>
      <p>null</p>
    </ack>
  </back>
</article>