COMPUTATIONAL APPROACHES TO STOCHASTIC VEHICLE ROUTING

This paper is a computational study of several well-known "graphical" heuristics for the probabilistic traveling salesman problem (PTSP) and the probabilistic vehicle routing problem (PVRP). These problems are of wide interest in logistical and transportation planning because they explicitly treat the uncertainty in the collection demands.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    1314 Guilford Avenue
    Baltimore, MD  United States  21202
  • Authors:
    • Bertsimas, D
    • Chervi, P
    • Peterson, M
  • Publication Date: 1995-11

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00715449
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jan 4 1996 12:00AM