Sciweavers

59 search results - page 2 / 12
» Solving Multi-criteria Optimization Problems with Population...
Sort
View
PPSN
2010
Springer
13 years 3 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
GPEM
2002
163views more  GPEM 2002»
13 years 5 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
FGCS
2000
90views more  FGCS 2000»
13 years 5 months ago
An ANTS heuristic for the frequency assignment problem
The problem considered in this paper consists in defining an assignment of frequencies to radio links, to be established between base stations and mobile transmitters, which minim...
Vittorio Maniezzo, Antonella Carbonaro
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
13 years 11 months ago
ACO vs EAs for solving a real-world frequency assignment problem in GSM networks
Frequency planning is a very important task for current GSM operators. In this work we present a new mathematical formulation of the problem in which the frequency plans are evalu...
Francisco Luna, Christian Blum, Enrique Alba, Anto...
IMCSIT
2010
13 years 2 months ago
Effectiveness of Solving Traveling Salesman Problem Using Ant Colony Optimization on Distributed Multi-Agent Middleware
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
Sorin Ilie, Costin Badica