arXiv (All)
open access
Accelerating supply chains with Ant Colony Optimization across range of hardware solutions
Ant Colony algorithm has been applied to various optimization problems, however most of the previous work on scaling and parallelism focuses on Travelling Salesman Problems (TSPs). Although, useful for benchmarks and new idea comparison, the algorithmic dynamics does not always transfer to complex r
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
- Improved Discrete Queuing Search Algorithm for Traveling Salesman Problem#1149057
- A reinforcement learning-enhanced discrete zebra optimization algorithm for solving the traveling salesman problem.#610417
- Nora: Normalized Orthogonal Row Alignment for Scalable Matrix Optimizer#155302
- Solving Large Traveling Salesman Problems (TSPs) by a Recursive Clustering Algorithm and a Scalable FPGA-Based Implementation#394369
- AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network#287135
Record · ID 1401756
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