IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v35y2001i3p322-330.html
   My bibliography  Save this article

Dispatching Buses in Parking Depots

Author

Listed:
  • Giorgio Gallo

    (Department of Computer Science, University of Pisa, Corso Italia 40, 56125 Pisa, Italy)

  • Federico Di Miele

    (Department of Computer Science, University of Pisa, Corso Italia 40, 56125 Pisa, Italy)

Abstract

Very often, space is a scarce resource in bus depots located in congested urban areas: Vehicles arriving at the end of their trips are packed together in a rather small space. This implies that when a vehicle has to leave to start a new trip, most often other vehicles have to be moved to clear the way. Here a new model, based on “Noncrossing Matching” and “Generalized Assignment,” is presented to allocate parking spaces to vehicles in a depot to minimize the shunting cost. The results obtained by applying this approach to a real-life case are discussed.

Suggested Citation

  • Giorgio Gallo & Federico Di Miele, 2001. "Dispatching Buses in Parking Depots," Transportation Science, INFORMS, vol. 35(3), pages 322-330, August.
    • Handle: RePEc:inm:ortrsc:v:35:y:2001:i:3:p:322-330
    DOI: 10.1287/trsc.35.3.322.10151
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.35.3.322.10151
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.35.3.322.10151?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. Antonio Frangioni & Giorgio Gallo, 1999. "A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 370-393, November.
    2. Thomas Winter & Uwe Zimmermann, 2000. "Real-time dispatch of trams in storage yards," Annals of Operations Research, Springer, vol. 96(1), pages 287-315, November.
    3. Martin Savelsbergh, 1997. "A Branch-and-Price Algorithm for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 45(6), pages 831-841, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Gkiotsalitis, K. & Alesiani, F., 2019. "Robust timetable optimization for bus lines subject to resource and regulatory constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 128(C), pages 30-51.
    2. Richard Freling & Ramon M. Lentink & Leo G. Kroon & Dennis Huisman, 2005. "Shunting of Passenger Train Units in a Railway Station," Transportation Science, INFORMS, vol. 39(2), pages 261-272, May.
    3. Mohamed Hamdouni & Guy Desaulniers & Odile Marcotte & François Soumis & Marianne van Putten, 2006. "Dispatching Buses in a Depot Using Block Patterns," Transportation Science, INFORMS, vol. 40(3), pages 364-377, August.
    4. Hamdouni, Mohamed & Soumis, Francois & Desaulniers, Guy, 2007. "Parking buses in a depot with stochastic arrival times," European Journal of Operational Research, Elsevier, vol. 183(2), pages 502-515, December.
    5. Lentink, R.M. & Fioole, P-J. & Kroon, L.G. & van 't Woudt, C., 2003. "Applying Operations Research techniques to planning of train shunting," ERIM Report Series Research in Management ERS-2003-094-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.
    6. Dennis Huisman & Leo G. Kroon & Ramon M. Lentink & Michiel J. C. M. Vromans, 2005. "Operations Research in passenger railway transportation," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 59(4), pages 467-497, November.
    7. Kroon, L.G. & Lentink, R.M. & Schrijver, A., 2006. "Shunting of Passenger Train Units: an Integrated Approach," ERIM Report Series Research in Management ERS-2006-068-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.
    8. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    9. Leo G. Kroon & Ramon M. Lentink & Alexander Schrijver, 2008. "Shunting of Passenger Train Units: An Integrated Approach," Transportation Science, INFORMS, vol. 42(4), pages 436-449, November.
    10. Haahr, Jørgen & Lusby, Richard M., 2017. "Integrating rolling stock scheduling with train unit shunting," European Journal of Operational Research, Elsevier, vol. 259(2), pages 452-468.

    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. Jafar Rezaei & Negin Salimi, 2015. "Optimal ABC inventory classification using interval programming," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(11), pages 1944-1952, August.
    2. Alberto Ceselli & Giovanni Righini, 2006. "A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem," Operations Research, INFORMS, vol. 54(6), pages 1172-1184, December.
    3. Hamdouni, Mohamed & Soumis, Francois & Desaulniers, Guy, 2007. "Parking buses in a depot with stochastic arrival times," European Journal of Operational Research, Elsevier, vol. 183(2), pages 502-515, December.
    4. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    5. Lentink, R.M. & Fioole, P-J. & Kroon, L.G. & van 't Woudt, C., 2003. "Applying Operations Research techniques to planning of train shunting," ERIM Report Series Research in Management ERS-2003-094-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.
    6. Gamvros, Ioannis & Raghavan, S., 2012. "Multi-period traffic routing in satellite networks," European Journal of Operational Research, Elsevier, vol. 219(3), pages 738-750.
    7. Irnich, Stefan, 2000. "A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles," European Journal of Operational Research, Elsevier, vol. 122(2), pages 310-328, April.
    8. Wei Huang & H. Edwin Romeijn & Joseph Geunes, 2005. "The continuous‐time single‐sourcing problem with capacity expansion opportunities," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(3), pages 193-211, April.
    9. Albareda-Sambola, Maria & Vlerk, Maarten H. van der & Fernandez, Elena, 2002. "Exact solutions to a class of stochastic generalized assignment problems," Research Report 02A11, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    10. Amy Cohn & Michael Magazine & George Polak, 2009. "Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 215-225, April.
    11. A Higgins & G Beashel & A Harrison, 2006. "Scheduling of brand production and shipping within a sugar supply chain," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 490-498, May.
    12. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    13. repec:dgr:rugsom:02a11 is not listed on IDEAS
    14. Richard Freling & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2003. "A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem," Operations Research, INFORMS, vol. 51(6), pages 922-939, December.
    15. Naderi, Siamak & Kilic, Kemal & Dasci, Abdullah, 2020. "A deterministic model for the transshipment problem of a fast fashion retailer under capacity constraints," International Journal of Production Economics, Elsevier, vol. 227(C).
    16. Syam Menon & Linus Schrage, 2002. "Order Allocation for Stock Cutting in the Paper Industry," Operations Research, INFORMS, vol. 50(2), pages 324-332, April.
    17. Jeet, V. & Kutanoglu, E., 2007. "Lagrangian relaxation guided problem space search heuristics for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1039-1056, November.
    18. Zhi‐Long Chen & Warren B. Powell, 2003. "Exact algorithms for scheduling multiple families of jobs on parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 823-840, October.
    19. Marc Peeters & Zeger Degraeve, 2004. "The Co-Printing Problem: A Packing Problem with a Color Constraint," Operations Research, INFORMS, vol. 52(4), pages 623-638, August.
    20. Peters, Emmanuel & de Matta, Renato & Boe, Warren, 2007. "Short-term work scheduling with job assignment flexibility for a multi-fleet transport system," European Journal of Operational Research, Elsevier, vol. 180(1), pages 82-98, July.
    21. Nigam, Ashutosh & Agarwal, Yogesh K., 2014. "Optimal relay node placement in delay constrained wireless sensor network design," European Journal of Operational Research, Elsevier, vol. 233(1), pages 220-233.

    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:3:p:322-330. 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.