In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan....
Antonio Garrido Tejero, Miguel A. Salido, Federico...
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
The Distributed Information Search COmponent (Disco) is a prototype heterogeneous distributed database that accesses underlying data sources. The Disco prototype currently focuses...
This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of...