Vehicle Scheduling: Proximity Priority Searching

Abstract

In this paper a new basis for the allocation of customers to routes is discussed. The technique commences at peripheral locations and branches sequentially to nearest customers. A sequential assignment technique provides a simple programming approach which incorporates restrictions, such as distance, weight, quantity and time. Several test problems are analysed and results compared with solutions produced by the more familiar scheduling techniques. It is concluded, on the basis of optimality and calculation time, that the proposed method is as good as any other technique.