AbstractIn this paper we consider the fixed routes problem, which is the problem of designing routes for delivery vehicles that can be operated unchanged for a given period of time. We show how standard vehicle routing algorithms can be adapted to deal with the daily version of this problem. Computational results are presented for these adapted algorithms for a number of test problems drawn from the literature.