A taxonomic structure for vehicle routing and scheduling problems

Abstract

In this paper, it is shown that the routing and scheduling of vehicles with a nonreal time demand requirement has a reasonable natural taxonomic structure. It is also demonstrated that many vehicle routing and scheduling problems can be classified by their underlying properties in such a way that an algorithm suggested for their solution naturally evolves. Finally, some of the computational difficulties one encounters in implementing routing and scheduling systems on a computer are discussed.