Sciweavers

544 search results - page 53 / 109
» Improving Local Search for Fuzzy Scheduling Problems
Sort
View
CEC
2008
IEEE
14 years 2 months ago
Solving deceptive problems using a genetic algorithm with reserve selection
— Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global o...
Yang Chen, Jinglu Hu, Kotaro Hirasawa, Songnian Yu
CONSTRAINTS
2006
120views more  CONSTRAINTS 2006»
13 years 8 months ago
Constraint Models for the Covering Test Problem
Covering arrays can be applied to the testing of software, hardware and advanced materials, and to the effects of hormone interaction on gene expression. In this paper we develop c...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
CSCLP
2004
Springer
13 years 11 months ago
Constraint-Based Approaches to the Covering Test Problem
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our propo...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
13 years 9 months ago
The effects of mutation and directed intervention crossover when applied to scheduling chemotherapy
This paper discusses the effects of mutation and directed intervention crossover approaches when applied to the derivation of cancer chemotherapy treatment schedules. Unlike trad...
Paul M. Godley, David E. Cairns, Julie Cowie, Kevi...
JAIR
2007
141views more  JAIR 2007»
13 years 7 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf