Ant algorithms: theory and applications

DOI10.1007/s11086-005-0029-1zbMath1120.90051MaRDI QIDQ2432976

S. D. Shtovba

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

zbMATH Keywords

graph coloring; quadratic assignment problem; traveling salesman problem; vehicle routing problem; discrete optimization; job-shop scheduling problem; complex combinatorial optimization problems; network-traffic optimization

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

90B20: Traffic problems in operations research

90B80: Discrete location and assignment

Related Items

An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed, A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem, An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms, An algorithm for constructing single machine schedules based on ant colony approach, Some algorithms of solving minimax multiprocessor scheduling problem

Uses Software

• TSPLIB

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