Exchange strategies for multiple Ant Colony System
Explore this paper's citation graph
Summary
The experimental studies demonstrate that the Multiple Ant Colony System outperforms the sequential Ant Colony system and indicate that the weighting scheme improves performance, particularly in strategies that share pheromone information among all colonies.
- Type
- article
- Published
- 2007-03-01
- Cited by
- 152
- References
- 38
- OpenAlex
- https://openalex.org/W2056678525
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:8944988
Keywords
Ant colony optimization algorithms, Travelling salesman problem, Computer science, Weighting, Ant colony
References
- PARALLEL IMPLEMENTATION OF AN ANT COLONY OPTIMIZATION METAHEURISTIC WITH OPENMP
- Parallel ant algorithms for the minimum tardy task problem
- Multi Colony Ant Algorithms
- A new approach to exploiting parallelism in ant colony optimization
- Multiple Ant Colonies Algorithm Based on Colony Level Interactions
- MAX-MIN Ant System
- A parallel ant colony optimization algorithm for all-pair routing in MANETs
- Ant colony system for a VRP with multiple time windows and multiple visits
- An Exchange Heuristic for Routeing Problems with Time Windows
- Reaching a Consensus
- Ant colony system with communication strategies
- A Parallel Implementation of Ant Colony Optimization
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- New approach for aggregating multi-sensory data
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An ant colony system approach for variants of the traveling salesman problem with time windows
- MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
- Swarm intelligence: from natural to artificial systems
- Ant colony system: a cooperative learning approach to the traveling salesman problem
- Computer Science and Operations Research: New Developments in Their Interfaces
Cited by
- Parallelizing Ant Colony Optimization Via Area of Expertise Learning
- Implementation of strong invariance on ACO algorithms and optimized routing of data packets in wired networks
- Ant Colony Optimization in Stationary and Dynamic Environments
- Parallel Ant Colony Optimization on Graphics Processing Units
- Tweaker: An Ant Colony Algorithm for solving the Time Window Assignment Vehicle Routing Problem with Uncertain Demand
- Offline Signature Verification Using Local Radon Transform and Support Vector Machines
- Newton's Law of Gravity-based Search Algorithms
- Implementation of a Parallel Algorithm Based on a Spark Cloud Computing Platform
- Meta-Heuristics Algorithms based on the Grouping of Animals by Social Behavior for the Traveling Salesman Problem
- Response and recovery after severe wind storms using hierarchical open vehicle routing
- the Bees Algorithm: a novel optimisation tool
- An Adaptive Heterogeneous Multiple Ant Colonies Algorithm
- Alternative Path Creation based on Hybrid Fuzzy-Genetic Approach to Congestion Control in Wireless Sensor Networks
- A chaotic digital secure communication based on a modified gravitational search algorithm filter
- The bee colony-inspired algorithm (BCiA): a two-stage approach for solving the vehicle routing problem with time windows
- An analysis of the equilibrium of migration models for biogeography-based optimization
- Proposta de um framework para prototipagem de sistemas heurísticos multiagentes baseados em algorítmos de colônia de formigas
- Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
- Multi-ant colony system for evacuation routing problem with mixed traffic flow
- A software model to prototype ant colony optimization algorithms
Related papers
- Traveling Salesman Problem with Ant Colony Optimization
- PARALLELIZATION STRATEGY FOR ANT COLONY OPTIMIZATION METAHEURISTIC
- U-Turning Ant Colony Algorithm for Solving Symmetric Traveling Salesman Problem
- A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends
- U-Turning Ant Colony Algorithm for Solving Symmetric Traveling Salesman Problem
- Satisfactory Solution of Chinese Travelling Salesman Problem Based on Ant Colony Algorithm
- CACO : Competitive Ant Colony Optimization, A Nature-Inspired Metaheuristic For Large-Scale Global Optimization
- THE APPLICATION OF ANT COLONY OPTIMIZATION (ACO) ALGORITHM IN THE SHORT RUTE SEARCH FOR COMPLETING TRAVELING PROBLEM (TP)
- Solution of Travelling Salesman Problem Using Ant Colony Algorithm
- MAX-MIN Ant System and local search for the traveling salesman problem