Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Abstract. This paper presents a Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem PVRP. The PRVP generalizes the classical Vehicle Routing Problem b...
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...