Sciweavers

187 search results - page 4 / 38
» Benchmarking and solving dynamic constrained problems
Sort
View
CEC
2007
IEEE
14 years 1 months ago
Comparing bio-inspired algorithms in constrained optimization problems
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
Efrén Mezura-Montes, Blanca Cecilia Lopez-R...
CEC
2005
IEEE
13 years 9 months ago
DynDE: a differential evolution for dynamic optimization problems
Abstract- This paper presents an approach of using Differential Evolution (DE) to solve dynamic optimization problems. Careful setting of parameters is necessary for DE algorithms ...
Rui Mendes, Arvind S. Mohais
CPAIOR
2006
Springer
13 years 10 months ago
The Timetable Constrained Distance Minimization Problem
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
Rasmus V. Rasmussen, Michael A. Trick
AAAI
2006
13 years 8 months ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
Robert T. Effinger, Brian C. Williams
IJCAI
1989
13 years 8 months ago
A Planning/Scheduling Methodology for the Constrained Resource Problem
This paper presents a new planning/scheduling methodology for the constrained resource problem (CRP), in which the amount of available resources is limited and usually monotonical...
Naiping Keng, David Y. Y. Yun