Sciweavers

120 search results - page 7 / 24
» Genetically designed heuristics for the bin packing problem
Sort
View
MST
2010
117views more  MST 2010»
14 years 7 months ago
Class Constrained Bin Covering
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
GECCO
2005
Springer
133views Optimization» more  GECCO 2005»
15 years 3 months ago
Heuristic rules embedded genetic algorithm to solve in-core fuel management optimization problem
Because of the large number of possible combinations for the fuel assembly loading in the core, the design of the loading pattern (LP) is a complex optimization problem. It requir...
Fatih Alim, Kostadin Ivanov
GECCO
2003
Springer
122views Optimization» more  GECCO 2003»
15 years 2 months ago
Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
Gaofeng Huang, Andrew Lim
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 3 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
GECCO
1999
Springer
116views Optimization» more  GECCO 1999»
15 years 1 months ago
Dynamic Degree Constrained Network Design: A Genetic Algorithm Approach
The design and development of network infrastructure to support mission-critical operations has become a critical and complicated issue. In this study we explore the use of geneti...
Chao-Hsien Chu, G. Premkumar, Carey Chou, Jianzhon...