Fleet management for vehicle sharing operations

This paper presents a stochastic, mixed-integer program (MIP) involving joint chance constraints developed to generate least-cost vehicle redistribution plans for shared-vehicle systems such that a proportion of all near-term demand scenarios are met. The aim of the model is to correct short-term demand asymmetry in shared-vehicle systems, where flow from one station to another is seldom equal to the flow in the opposing direction. The model accounts for demand stochasticity and generates partial redistribution plans in circumstances when demand outstrips supply. This stochastic MIP has a nonconvex feasible region. Used to transform the problem into a set of disjunctive, convex MIPs and handle dual-bounded chance constraints, a novel divide-and-conquer algorithm for generating p-efficient points is proposed. A faster cone-generation method is also presented, assuming independence of random demand across stations. The potential of redistribution as a fleet management strategy and the value of accounting for inherent stochasticities are demonstrated, in a real-world application for a system in Singapore.

Language

  • English

Media Info

  • Media Type: Print
  • Features: Figures; References; Tables;
  • Pagination: pp 524-540
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 01357495
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Nov 29 2011 1:43PM