Sciweavers

155 search results - page 13 / 31
» A Conflict Tabu Search Evolutionary Algorithm for Solving Co...
Sort
View
121
Voted
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 3 months ago
An Indirect Genetic Algorithm for a Nurse Scheduling Problem
This paper describes a Genetic Algorithms approach to a manpower-scheduling problem arising at a major UK hospital. Although Genetic Algorithms have been successfully used for sim...
Uwe Aickelin, Kathryn A. Dowsland
121
Voted
ECAI
2004
Springer
15 years 9 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
CP
2005
Springer
15 years 9 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
115
Voted
AIR
2004
130views more  AIR 2004»
15 years 3 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
SARA
2007
Springer
15 years 9 months ago
DFS-Tree Based Heuristic Search
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
Montserrat Abril, Miguel A. Salido, Federico Barbe...