Sciweavers

GECCO
2006
Springer
163views Optimization» more  GECCO 2006»
14 years 7 days ago
The quadratic multiple knapsack problem and three heuristic approaches to it
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
Amanda Hiley, Bryant A. Julstrom
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
14 years 7 days ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
14 years 7 days ago
Search--based approaches to the component selection and prioritization problem
This poster paper addresses the problem of choosing sets of software components to combine in component
Mark Harman, Alexandros Skaliotis, Kathleen Steinh...
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
14 years 7 days ago
Local search for multiobjective function optimization: pareto descent method
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi
GECCO
2006
Springer
144views Optimization» more  GECCO 2006»
14 years 7 days ago
On semi-supervised clustering via multiobjective optimization
Semi-supervised classification uses aspects of both unsupervised and supervised learning to improve upon the performance of traditional classification methods. Semi-supervised clu...
Julia Handl, Joshua D. Knowles
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
14 years 7 days ago
Fitness function for finding out robust solutions on time-varying functions
Evolutionary Computations in dynamic/uncertain environments have attracted much attention. Studies regarding this research subjects can be classified into four categories: Noise, ...
Hisashi Handa
GECCO
2006
Springer
158views Optimization» more  GECCO 2006»
14 years 7 days ago
Exploring network topology evolution through evolutionary computations
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...
Sami J. Habib, Alice C. Parker
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
14 years 7 days ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
14 years 7 days ago
Inside a predator-prey model for multi-objective optimization: a second study
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
Christian Grimme, Karlheinz Schmitt