VEHICLE ROUTING WITH STOCHASTIC DEMANDS: PROPERTIES AND SOLUTION FRAMEWORKS

The objective of this paper is to survey the work done so far on the Vehicle Routing Problem with stochastic demands (SVRP). A variety of solution methodologies are examined. A new integer programming model as well as a new solution framework in the form of a Markov decision process model are proposed. The paper is organized as follows: Section 1 describes problem characteristics and examines problem parameters, operating and service policies. Solution properties are discussed in Section 2. Section 3 presents stochastic programming models for the SVRP. Section 4 describes the new Markov decision process model, and Section 5 contains the conclusions.

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00488565
  • Record Type: Publication
  • Files: TRIS, ATRI
  • Created Date: Oct 31 1989 12:00AM