Sciweavers

155 search results - page 4 / 31
» A Conflict Tabu Search Evolutionary Algorithm for Solving Co...
Sort
View
124
Voted
EOR
2007
77views more  EOR 2007»
15 years 3 months ago
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...
Jorge Maturana, María-Cristina Riff
141
Voted
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
15 years 7 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...
192
Voted
CP
1995
Springer
15 years 7 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
125
Voted
HEURISTICS
2002
152views more  HEURISTICS 2002»
15 years 3 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
161
Voted
TEC
2002
163views more  TEC 2002»
15 years 3 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon