A heuristic algorithm for the period vehicle routing problem (with C.C.R.Tan), Omega, vol.12, no.5, 1984, pp497-504

In this paper we consider the period routing problem, which is the problem of designing routes for delivery vehicles to meet customer service level requirements (not all customers require delivery on every day in the period). A heuristic algorithm, based upon the daily vehicle routing algorithm of Fisher and Jaikumar, is presented and computational results are given for test problems drawn from the literature.

Full paper

J E Beasley