Sciweavers

498 search results - page 10 / 100
» Optimization of Genetic Operators for Scheduling Problems
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 9 months ago
Evolving Dynamic Change and Exchange of Genotype Encoding in Genetic Algorithms for Difficult Optimization Problems
The application of genetic algorithms (GAs) to many optimization problems in organizations often results in good performance and high quality solutions. For successful and efficien...
Maroun Bercachi, Philippe Collard, Manuel Clergue,...
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 3 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 1 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
VLSID
2000
IEEE
94views VLSI» more  VLSID 2000»
15 years 1 months ago
A Genetic Algorithm for the Synthesis of Structured Data Paths
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...
Chittaranjan A. Mandal, R. M. Zimmer
EUROGP
2005
Springer
107views Optimization» more  EUROGP 2005»
15 years 3 months ago
Operator-Based Distance for Genetic Programming: Subtree Crossover Distance
Abstract. This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance mea...
Steven M. Gustafson, Leonardo Vanneschi