We study the complexity of the problem, and develop a solution algorithm using greedy randomised adaptive search. A case study of real-life data from Stockholm Arlanda Airport shows that optimised ...

We consider the NP-hard Multiple Depot Vehicle Scheduling Problem, in which a given set of time-tabled trips have to be assigned to vehicles stationed at different depots, so as to minimize the number ...