THE VEHICLE SCHEDULING PROBLEM AND MONTE CARLO SIMULATION

A new method for planning the routes of a fleet of carriers subject to a maximum load restriction is outlined. It is derived from a combination of the well-known "savings" heuristic rule and Monte Carlo simulation. Without increasing the level of complexity of the search routine beyound that already employed in "savings" based programs a marked reduction in total route length can be obtained. This is demonstrated with the aid of three much-considered problems, and for one of these, distances have been found that are below any previously recorded, even for those algorithms with the support of more elaborate logistics.(a) /TRRL/

  • Availability:
  • Corporate Authors:

    Pergamon Press, Incorporated

    Maxwell House, Fairview Park
    Elmsford, NY  United States  10523
  • Authors:
    • Buxey, G M
  • Publication Date: 1979-6

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00302006
  • Record Type: Publication
  • Source Agency: Transport Research Laboratory
  • Files: ITRD, TRIS
  • Created Date: Dec 19 1979 12:00AM