IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v33y1987i5p662-669.html
   My bibliography  Save this article

Optimal Average Cost Policies for the Two-Terminal Shuttle

Author

Listed:
  • Rajat K. Deb

    (Lotus Consulting Group, Los Altos, California)

  • Charles P. Schmidt

    (Department of Management Science and Statistics, University of Alabama, Tuscaloosa, Alabama 35487)

Abstract

In this paper we consider a transportation system consisting of a carrier with capacity Q \le \infty , operating between two terminals. Passengers arrive at these terminals according to independent Poisson processes and are transported by the carrier from one terminal to the other terminal. Under a fairly general cost structure we show that the optimal operating policy which minimizes the expected average cost is a monotone decreasing function of the number of customers waiting at each terminal. Bounds are derived for the optimal average cost policy and a method to compute these optimal policies using linear programming is presented.

Suggested Citation

  • Rajat K. Deb & Charles P. Schmidt, 1987. "Optimal Average Cost Policies for the Two-Terminal Shuttle," Management Science, INFORMS, vol. 33(5), pages 662-669, May.
    • Handle: RePEc:inm:ormnsc:v:33:y:1987:i:5:p:662-669
    DOI: 10.1287/mnsc.33.5.662
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.33.5.662
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.33.5.662?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hall, Randolph W. & Sabnani, Vikas C., 2002. "Control of vehicle dispatching on a cyclic route serving trucking terminals," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(3), pages 257-276, March.
    2. Papadaki, Katerina P. & Powell, Warren B., 2002. "Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem," European Journal of Operational Research, Elsevier, vol. 142(1), pages 108-127, October.
    3. Katerina P. Papadaki & Warren B. Powell, 2003. "An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 742-769, October.
    4. Song, Dong-Ping & Earl, Christopher F., 2008. "Optimal empty vehicle repositioning and fleet-sizing for two-depot service systems," European Journal of Operational Research, Elsevier, vol. 185(2), pages 760-777, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:33:y:1987:i:5:p:662-669. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.