OPTIMIZING SINGLE VEHICLE MANY-TO-MANY OPERATIONS WITH DESIRED DELIVERY TIMES: I. SCHEDULING

A set of n customers is given. Each customer has a desired point of pickup, a desired point of delivery and a desired time of delivery. The problem is to determine the order of pickup and delivery and the times of pickup and delivery of these n customers by a single vehicle in order to minimize total customer inconvenience. Here, a mathematical programming formulation of this problem is subjected to Benders' decomposition procedure. The result is a heuristic routing and scheduling algorithm which is shown to produce high quality solutions in reasonable computation time by testing on moderately sized real data bases from both Gaithersburg, Maryland, and Baltimore, Maryland. (Edited author abstract)

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  United States  21202
  • Authors:
    • Sexton, T R
    • BODIN, L D
  • Publication Date: 1985-11

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00455234
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: May 31 1986 12:00AM