Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
Abstract— The accurate estimation of airport capacity is critical for the efficient planning of landing and takeoff operations, and the mitigation of congestion-induced delays. ...
Abstract—We present a new approach to providing soft realtime guarantees for Belief-Desire-Intention (BDI) agents. We define what it means for BDI agents to operate in real time...
Konstantin Vikhorev, Natasha Alechina, Brian Logan
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...