Sciweavers

GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
13 years 10 months ago
A Hybrid Ant Colony Optimisation Technique for Dynamic Vehicle Routing
Abstract. This paper is concerned with a dynamic vehicle routing problem. The problem is dynamic in the sense that the time it will take to traverse each edge is uncertain. The pro...
Darren M. Chitty, Marcel L. Hernandez
GECCO
2004
Springer
13 years 10 months ago
An Evolved Autonomous Controller for Satellite Task Scheduling
Abstract. A scheduling algorithm for satellites imaging tasks in a dynamic and uncertain environment. The environment is dynamic in the sense that imaging tasks will be added or re...
Darren M. Chitty
GECCO
2004
Springer
13 years 10 months ago
Introducing Subchromosome Representations to the Linkage Learning Genetic Algorithm
This paper introduces subchromosome representations to the linkage learning genetic algorithm (LLGA). The subchromosome representation is utilized for effectively lowering the num...
Ying-Ping Chen, David E. Goldberg
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
13 years 10 months ago
Modeling Coevolutionary Genetic Algorithms on Two-Bit Landscapes: Random Partnering
Abstract. A model of coevolutioinary genetic algorithms (COGA) consisting of two populations coevolving on two-bit landscapes is investigated in terms of the effects of random par...
Ming Chang, Kazuhiro Ohkura, Kanji Ueda, Masaharu ...
GECCO
2004
Springer
144views Optimization» more  GECCO 2004»
13 years 10 months ago
Feature Subset Selection, Class Separability, and Genetic Algorithms
Abstract. The performance of classification algorithms in machine learning is affected by the features used to describe the labeled examples presented to the inducers. Therefore,...
Erick Cantú-Paz
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
13 years 10 months ago
Adaptive Sampling for Noisy Problems
Abstract. The usual approach to deal with noise present in many realworld optimization problems is to take an arbitrary number of samples of the objective function and use the samp...
Erick Cantú-Paz
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
13 years 10 months ago
A Statistical Model of GA Dynamics for the OneMax Problem
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
Bulent Buyukbozkirli, Erik D. Goodman
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
13 years 10 months ago
Evolving En-Route Caching Strategies for the Internet
Nowadays, large distributed databases are commonplace. Client applications increasingly rely on accessing objects from multiple remote hosts. The Internet itself is a huge network ...
Jürgen Branke, Pablo Funes, Frederik Thiele
GECCO
2004
Springer
122views Optimization» more  GECCO 2004»
13 years 10 months ago
Gradient-Based Learning Updates Improve XCS Performance in Multistep Problems
This paper introduces a gradient-based reward prediction update mechanism to the XCS classifier system as applied in neuralnetwork type learning and function approximation mechani...
Martin V. Butz, David E. Goldberg, Pier Luca Lanzi
GECCO
2004
Springer
13 years 10 months ago
Bounding Learning Time in XCS
It has been shown empirically that the XCS classifier system solves typical classification problems in a machine learning competitive way. However, until now, no learning time es...
Martin V. Butz, David E. Goldberg, Pier Luca Lanzi