Sciweavers

9119 search results - page 138 / 1824
» A Simultaneous Search Problem
Sort
View
90
Voted
EMO
2003
Springer
81views Optimization» more  EMO 2003»
15 years 6 months ago
Solving Hierarchical Optimization Problems Using MOEAs
Abstract. In this paper, we propose an approach for solving hierarchical multi-objective optimization problems (MOPs). In realistic MOPs, two main challenges have to be considered:...
Christian Haubelt, Sanaz Mostaghim, Jürgen Te...
110
Voted
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
15 years 5 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
95
Voted
AAAI
2004
15 years 2 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
113
Voted
HEURISTICS
2002
146views more  HEURISTICS 2002»
15 years 17 days ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
PROCEDIA
2011
14 years 3 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff