arXiv (All)
open access
Herder Ants: Ant Colony Optimization with Aphids for Discrete Event-Triggered Dynamic Optimization Problems
Currently available dynamic optimization strategies for Ant Colony Optimization (ACO) algorithm offer a trade-off of slower algorithm convergence or significant penalty to solution quality after each dynamic change occurs. This paper proposes a discrete dynamic optimization strategy called Ant Colon
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Weather-responsive optimization in air traffic flow management#193080
- Ant Backpressure Routing for Dynamic Wireless Multi-hop Networks with Mixed Traffic Patterns#224459
- HCQ-SGuA: A Plant-Growth-Inspired Hybrid Saplings Growing Up Algorithm with Quasi-Random Initialization and Chaotic Operator Control for Continuous Optimization.#1091367
- Set-based particle swarm optimisation convergence#228806
- Squeezing the Most Out of Preemption for AoI Minimization: Single-source Case#386784
Record · ID 1401768
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive