IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v37y2001i1p71-83.html
   My bibliography  Save this article

Resolving splits in location/allocation modeling: a heuristic procedure for transit center decisions

Author

Listed:
  • Willoughby, Keith A.
  • Uyeno, Dean H.

Abstract

A heuristic procedure is developed to assign buses to transit centers (garages) in such a way that all the buses on a particular route are assigned to a single transit center. This research builds on an optimal mixed integer programming location/allocation model that splits the bus assignments when capacity limitations were reached at a transit center. The heuristic procedure adopts a two-step process: namely, assignment of all buses of a route to a unique transit center, then switching of routes to alternative transit centers to enforce capacity limitations. The procedure is shown to still provide cost savings over current locations and allocations for the Vancouver Regional Transit System (VRTS), Canada's largest urban transit network.

Suggested Citation

  • Willoughby, Keith A. & Uyeno, Dean H., 2001. "Resolving splits in location/allocation modeling: a heuristic procedure for transit center decisions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 37(1), pages 71-83, March.
    • Handle: RePEc:eee:transe:v:37:y:2001:i:1:p:71-83
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554500000065
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Li, Xiangyong & Aneja, Y.P. & Huo, Jiazhen, 2012. "Using branch-and-price approach to solve the directed network design problem with relays," Omega, Elsevier, vol. 40(5), pages 672-679.

    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:eee:transe:v:37:y:2001:i:1:p:71-83. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.