Sciweavers

266 search results - page 32 / 54
» A greedy genetic algorithm for the quadratic assignment prob...
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
13 years 9 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
GECCO
2004
Springer
14 years 28 days ago
Three Evolutionary Codings of Rectilinear Steiner Arborescences
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. Th...
Bryant A. Julstrom, Athos Antoniades
WSC
2008
13 years 10 months ago
Mixed model assembly line balancing problem with fuzzy operation times and drifting operations
Assembly line balancing problem (ALBP) means assigning a series of task elements to uniform sequential stations under certain restrictions. This paper considers a special type of ...
Weida Xu, Tianyuan Xiao
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
13 years 11 months ago
Hybrid search for cardinality constrained portfolio optimization
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...
Miguel A. Gomez, Carmen X. Flores, Maria A. Osorio