197 search results - page 12 / 40 » Optimizing Chemotherapy Scheduling Using Local Search Heuris... |
SAGA
2001
Springer
13 years 11 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
WSC
2008
13 years 9 months ago
2008
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
AAAI
2004
13 years 8 months ago
2004
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
SLS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...