Sciweavers

150 search results - page 8 / 30
» Numeric Mutation: Improved Search in Genetic Programming
Sort
View
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 1 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
15 years 3 months ago
Genetic multi-step search in interpolation and extrapolation domain
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP, and it shows high availability in TSP. Both of th...
Yoshiko Hanada, Tomoyuki Hiroyasu, Mitsunori Miki
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
14 years 11 months ago
Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
Torsten Hildebrandt, Jens Heger, Bernd Scholz-Reit...
GECCO
1999
Springer
148views Optimization» more  GECCO 1999»
15 years 1 months ago
An Analysis of Automatic Subroutine Discovery in Genetic Programming
This paper analyses Rosca's ARL as a general framework for automatic subroutine discovery. We review and compare a number of heuristics for code selection, and experimentally...
Antonello Dessi, Antonella Giani, Antonina Starita
ICNC
2009
Springer
15 years 4 months ago
Reducing Boarding Time: Synthesis of Improved Genetic Algorithms
—With the aim to minimize boarding time and devise procedures for boarding strategies, this paper develop the synthesis of Improved Genetic Algorithms and simulation. This paper ...
Kang Wang