Coloured Ant System and Local Search to Design Local Telecommunication Networks

Authors:
Roberto Cordone;Francesco Maffioli
Affiliations:
-;-
Venue:
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Year:
2001

Citing 6
Cited 2

Heuristics with constant error guarantees for the design of tree networks

Management Science
Approximation algorithms for minimum tree partition

Discrete Applied Mathematics
The Ant System Applied to the Quadratic Assignment Problem

IEEE Transactions on Knowledge and Data Engineering
A Study of Some Properties of Ant-Q

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH

Cybernetics and Systems
New heuristics for two bounded-degree spanning tree problems

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work combines local search with a variant of the Ant System recently proposed for partitioning problems with cardinality constraints. The Coloured Ant System replaces the classical concept of trail with p trails of different "colours", representing the assignment of an element to one of the classes in the partition. We apply the method with promising results to the design of local telecommunication networks. The combination of the Coloured Ant System with local search yields much better results than the two approaches alone.