Computation of the Optimal Average Cost Policy for the Two Terminal Shuttle.

Abstract

This paper considers the problem of determining the optimal average cost policy for operating a shuttle between two terminals. The passengers arrive at each of the terminals according to Poisson processes and are transported by a single carrier with capacity Q < or = infinity operating between the terminals. Under a fairly general cost structure, the optimal average cost policy is monotone. bounds are derived for the optimal control function and computational procedures for determining the optimal policy for both the finite and infinite capacity cases are presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 30, 1978
Accession Number
ADA060912

Entities

People

  • Rajat K. Deb

Organizations

  • Stanford University

Tags

Communities of Interest

  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Equations
  • Industrial Engineering
  • Inequalities
  • Linear Programming
  • Markov Chains
  • Markov Processes
  • New Jersey
  • New York
  • Operations Research
  • Passengers
  • Probability
  • Random Variables
  • Random Walk
  • Semimarkov Processes
  • United States

Readers

  • Aviation Safety and Air Traffic Management
  • Mathematical Modeling and Probability Theory.