Optimal Dispatching of an Infinite Capacity Shuttle: Control at a Single Therminal,

Abstract

The optimal control of a shuttle system consisting of a single infinite capacity carrier transporting passengers between two terminals is studied. Passengers arrive according to independent Poisson processes, and dispatching decisions to hold the carrier for more passengers can be made at only one of the terminals. The objective is minimization of the long-run average of a linear passenger waiting cost and a fixed charge per trip made. When complete information about the system state is available, and travel times are deterministic, it is optimal to dispatch the carrier if, and only if, the total number of passengers waiting at both terminals is greater than a cutoff value. An iterative method for computation of the cutoff value is given and it is found that it can be well approximated by a function of system costs and parameters similar to the economic lot size formula. A (possibly non-optimal) dispatching rule is proposed for the case when only the number of passengers waiting at one terminal is known, and its efficiency is compared to that of the aforementioned optimal rule. Extensions to other optimality criteria and to the case of stochastic travel times are outlined.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1973
Accession Number
ADA044830

Entities

People

  • Edward Ignall
  • Peter Kolesar

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Computations
  • Distribution Functions
  • Engineering
  • Equations
  • Intervals
  • Markov Chains
  • New York
  • Passengers
  • Probability
  • Random Variables
  • Semimarkov Processes
  • Terminals
  • Transitions
  • Travel Time
  • Two Dimensional
  • Universities

Readers

  • Approximation Theory.
  • Logistics and Supply Chain Management.
  • Mathematical Modeling and Probability Theory.