A HEURISTIC FOR THE PERIODIC VEHICLE ROUTING PROBLEM

This paper describes a model for the optimal management of periodic deliveries of a given commodity. The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling and routing policies of the vehicles in order to minimize over the planning horizon the maximum number of vehicles simultaneously employed, i.e., the fleet size. Heuristic algorithms are proposed and computational experience is reported.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    1314 Guilford Avenue
    Baltimore, MD  United States  21202
  • Authors:
    • Gaudioso, M
    • Paletta, G
  • Publication Date: 1992-5

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00621999
  • Record Type: Publication
  • Files: TRIS, ATRI
  • Created Date: May 31 1992 12:00AM