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

A heuristic procedure is developed to assign buses to transit centers (gara ges) 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 proced ure adopts a two-step process: namely, assignment of all buses of a route t o a unique transit center, then switching of routes to alternative transit centers to enforce capacity limitations. The procedure is shown to still pr ovide cost savings over current locations and allocations for the Vancouver Regional Transit System (VRTS), Canada's largest urban transit network. (C ) 2000 Elsevier Science Ltd. All rights reserved.