3,797 research outputs found
A hybrid swarm-based algorithm for single-objective optimization problems involving high-cost analyses
In many technical fields, single-objective optimization procedures in
continuous domains involve expensive numerical simulations. In this context, an
improvement of the Artificial Bee Colony (ABC) algorithm, called the Artificial
super-Bee enhanced Colony (AsBeC), is presented. AsBeC is designed to provide
fast convergence speed, high solution accuracy and robust performance over a
wide range of problems. It implements enhancements of the ABC structure and
hybridizations with interpolation strategies. The latter are inspired by the
quadratic trust region approach for local investigation and by an efficient
global optimizer for separable problems. Each modification and their combined
effects are studied with appropriate metrics on a numerical benchmark, which is
also used for comparing AsBeC with some effective ABC variants and other
derivative-free algorithms. In addition, the presented algorithm is validated
on two recent benchmarks adopted for competitions in international conferences.
Results show remarkable competitiveness and robustness for AsBeC.Comment: 19 pages, 4 figures, Springer Swarm Intelligenc
Equation-free modeling of evolving diseases: Coarse-grained computations with individual-based models
We demonstrate how direct simulation of stochastic, individual-based models
can be combined with continuum numerical analysis techniques to study the
dynamics of evolving diseases. % Sidestepping the necessity of obtaining
explicit population-level models, the approach analyzes the (unavailable in
closed form) `coarse' macroscopic equations, estimating the necessary
quantities through appropriately initialized, short `bursts' of
individual-based dynamic simulation. % We illustrate this approach by analyzing
a stochastic and discrete model for the evolution of disease agents caused by
point mutations within individual hosts. % Building up from classical SIR and
SIRS models, our example uses a one-dimensional lattice for variant space, and
assumes a finite number of individuals. % Macroscopic computational tasks
enabled through this approach include stationary state computation, coarse
projective integration, parametric continuation and stability analysis.Comment: 16 pages, 8 figure
A genetic algorithm for the design of a fuzzy controller for active queue management
Active queue management (AQM) policies are those
policies of router queue management that allow for the detection of network congestion, the notification of such occurrences to the
hosts on the network borders, and the adoption of a suitable control
policy. This paper proposes the adoption of a fuzzy proportional
integral (FPI) controller as an active queue manager for Internet
routers. The analytical design of the proposed FPI controller is
carried out in analogy with a proportional integral (PI) controller,
which recently has been proposed for AQM. A genetic algorithm is
proposed for tuning of the FPI controller parameters with respect
to optimal disturbance rejection. In the paper the FPI controller
design metodology is described and the results of the comparison
with random early detection (RED), tail drop, and PI controller
are presented
Multi-agent collaborative search : an agent-based memetic multi-objective optimization algorithm applied to space trajectory design
This article presents an algorithm for multi-objective optimization that blends together a number of heuristics. A population of agents combines heuristics that aim at exploring the search space both globally and in a neighbourhood of each agent. These heuristics are complemented with a combination of a local and global archive. The novel agent-based algorithm is tested at first on a set of standard problems and then on three specific problems in space trajectory design. Its performance is compared against a number of state-of-the-art multi-objective optimization algorithms that use the Pareto dominance as selection criterion: non-dominated sorting genetic algorithm (NSGA-II), Pareto archived evolution strategy (PAES), multiple objective particle swarm optimization (MOPSO), and multiple trajectory search (MTS). The results demonstrate that the agent-based search can identify parts of the Pareto set that the other algorithms were not able to capture. Furthermore, convergence is statistically better although the variance of the results is in some cases higher
Optimisation of Mobile Communication Networks - OMCO NET
The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University.
The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing
- …