Concepts and applications of backup coverage
Management Science
The capacitated maximal covering location problem with backup service
Annals of Operations Research
Ant algorithms for discrete optimization
Artificial Life
Tabu Search
Parallelization Strategies for Ant Colony Optimization
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
Transportation Science
Paper: Robust taboo search for the quadratic assignment problem
Parallel Computing
Parallel ACS for weighted MAX-SAT
IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1
A survey on parallel ant colony optimization
Applied Soft Computing
A multi-agent approach for integrated emergency vehicle dispatching and covering problem
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
In this paper we propose, implement and analyse a parallel solution to solve an integrated dispatching and covering problem for emergency vehicle fleet management system. The basic sequential algorithm is a coupled ant colony system (ACS) with tabu search heuristic. To speed up this algorithm, we develop a master slave ACS parallel version based on the parallel neighbourhood evaluation approach for the tabu procedure. In experiments we compare synchronisation strategies between the parallel processes and show the impact of inter processes communication frequency and the information exchanged on the efficiency of the algorithm.