Sciweavers

904 search results - page 64 / 181
» The State Problem for Evolutionary Testing
Sort
View
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
15 years 1 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
COR
2010
155views more  COR 2010»
14 years 10 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
15 years 4 months ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 1 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
15 years 4 months ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li