arXiv (All)
open access
Dynamic Impact for Ant Colony Optimization algorithm
This paper proposes an extension method for Ant Colony Optimization (ACO) algorithm called Dynamic Impact. Dynamic Impact is designed to solve challenging optimization problems that has nonlinear relationship between resource consumption and fitness in relation to other part of the optimized solutio
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
- Optimization of maximum power point tracking in wind energy systems: a comparative study of ant colony and genetic algorithms#1028109
- Open Capacitated ARC routing problem by Hybridized Ant Colony Algorithm#284351
- Optimization without Future Compromises? Decentralized Coordination via Collective and Reinforcement Learning#1063786
- Ask Before You Optimize: Dynamic Pre-Formulation Clarification for Interactive Optimization#660861
- Distributed PSO for dynamic intersection management: Enhancing traffic flow and safety in connected autonomous vehicles#1203767
Record · ID 1401758
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