Application oriented variable fixing methods for the multiple depot vehicle scheduling problem

Abstract

In this article, we present heuristic methods for the vehicle scheduling problem that solve it by reducing the problem size using different variable fixing approaches. These methods are constructed in a way that takes some basic driver requirements into consideration as well. We show the eficiency of the methods on real-life and random data instances too. We also give an improved way of generating random input for the vehicle scheduling problem.