VEHICLE SCHEDULING: PROXIMITY PRIORITY SEARCHING

The article describes an approach to the problem of the allocation of customers to route planning. A proximity priority search algorithm is proposed for minimising the total distance travelled and number of vehicles required to supply an array of customers in given locations. The technique described commences at peripheral locations and branches sequentially to nearest customers. The sequential assignment technique provides a simple programming approach which incorporates restrictions such as distance, weight, quantity and time. A number of test problems are analysed and results are compared with solutions produced by more familiar scheduling techniques. It is concluded on the basis of optimality and calculation time, that the proposed method is as efficient as other techniques. (TRRL)

  • Availability:
  • Corporate Authors:

    Pergamon Press, Incorporated

    Headington Hill Hall
    Oxford OX30BW,    
  • Authors:
    • Williams, B W
  • Publication Date: 1982-10

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00370568
  • Record Type: Publication
  • Source Agency: Transport Research Laboratory
  • Files: ITRD, TRIS
  • Created Date: Feb 28 1983 12:00AM