IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v35y2001i1p1-18.html

The Holding Problem with Real–Time Information Available

Author

Listed:
  • Xu Jun Eberlein

    (Caliper Corporation, Newton, Massachusetts 02161)

  • Nigel H. M. Wilson

    (Department of Civil and Environment Engineering, MIT, Cambridge, Massachusetts 02139)

  • David Bernstein

    (Department of Computer Science, James Madison University, Harrisonburg, VA 22807)

Abstract

Holding is one of the most commonly used real–time control strategies in transit operations. Given a transit network and its operations plan, the holding problem is to decide at a given time at a control station, which vehicle is to be held and for how long, such that the total passenger cost along the route is minimized over a time period. Previous research on the holding problem has always assumed no real–time information available. Such an assumption not only poses great difficulties in solving the problem, but also limits practical applications in a real–time, dynamic operations environment. In this paper we formulate the holding problem as a deterministic quadratic program in a rolling horizon scheme, and develop an efficient solution algorithm to solve it. Using headway data collected by an automated system, we tested the algorithm and evaluated the impact of the resulting holding policies. Important and interesting properties of the holding solution, obtained from both theoretical and computational analyses, are presented.

Suggested Citation

  • Xu Jun Eberlein & Nigel H. M. Wilson & David Bernstein, 2001. "The Holding Problem with Real–Time Information Available," Transportation Science, INFORMS, vol. 35(1), pages 1-18, February.
    • Handle: RePEc:inm:ortrsc:v:35:y:2001:i:1:p:1-18
    DOI: 10.1287/trsc.35.1.1.10143
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.35.1.1.10143
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.35.1.1.10143?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
    ---><---

    References listed on IDEAS

    as
    1. Warren B. Powell, 1985. "Analysis of Vehicle Holding and Cancellation Strategies in Bulk Arrival, Bulk Service Queues," Transportation Science, INFORMS, vol. 19(4), pages 352-377, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Le-Duc, T. & de Koster, M.B.M., 2002. "Determining The Optimal Order Picking Batch Size In Single Aisle Warehouses," ERIM Report Series Research in Management ERS-2002-64-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    2. Chung-Yee Lee & Sila Çetinkaya & Wikrom Jaruphongsa, 2003. "A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse," Operations Research, INFORMS, vol. 51(5), pages 735-747, October.
    3. Anton J. Kleywegt & Jason D. Papastavrou, 1998. "Acceptance and Dispatching Policies for a Distribution Problem," Transportation Science, INFORMS, vol. 32(2), pages 127-141, May.
    4. 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.
    5. 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.
    6. M. A. A. Boon & A. J. E. M. Janssen & J. S. H. Leeuwaarden & R. W. Timmerman, 2019. "Pollaczek contour integrals for the fixed-cycle traffic-light queue," Queueing Systems: Theory and Applications, Springer, vol. 91(1), pages 89-111, February.
    7. Souvik Ghosh & A. D. Banik & Joris Walraevens & Herwig Bruneel, 2022. "A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service," 4OR, Springer, vol. 20(2), pages 241-272, June.
    8. 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.
    9. Srinivas R. Chakravarthy & Serife Ozkar, 2024. "A Queueing Model with BMAP Arrivals and Heterogeneous Phase Type Group Services," Methodology and Computing in Applied Probability, Springer, vol. 26(4), pages 1-30, December.
    10. Çetinkaya, SIla & Bookbinder, James H., 2003. "Stochastic models for the dispatch of consolidated shipments," Transportation Research Part B: Methodological, Elsevier, vol. 37(8), pages 747-768, September.
    11. Sıla Çetinkaya & Chung‐Yee Lee, 2002. "Optimal outbound dispatch policies: Modeling inventory and cargo capacity," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(6), pages 531-556, September.
    12. Sila Çetinkaya & Chung-Yee Lee, 2000. "Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems," Management Science, INFORMS, vol. 46(2), pages 217-232, February.
    13. Warren B. Powell, 1987. "Waiting‐time distributions for bulk arrival, bulk service queues with vehicle‐holding and cancellation strategies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 207-227, April.

    More about this item

    Statistics

    Access and download statistics

    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:ortrsc:v:35:y:2001:i:1:p:1-18. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.