Ant algorithms: theory and applications
DOI10.1007/s11086-005-0029-1zbMath1120.90051OpenAlexW2004186912MaRDI QIDQ2432976
Publication date: 26 October 2006
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11086-005-0029-1
graph coloringquadratic assignment problemtraveling salesman problemvehicle routing problemdiscrete optimizationjob-shop scheduling problemcomplex combinatorial optimization problemsnetwork-traffic optimization
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items (10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The traveling salesman. Computational solutions for RSP applications
- A new rank based version of the ant system. -- A computational study
- Optimization of the keyboard arrangement problem using an ant colony algorithm.
- Algorithms of ant system and simulated annealing for the \(p\)-median problem
- Learning cooperative linguistic fuzzy rules using the best-worst ant system algorithm
- Stochastic Algorithms: Foundations and Applications
This page was built for publication: Ant algorithms: theory and applications