Optimal resource allocation among transit agencies for fleet management
Most transit agencies require government support for the replacement of their aging fleet. A procedure for equitable resource allocation among competing transit agencies for the purpose of transit fleet management is presented in this study. The proposed procedure is a 3-dimensional model that includes the choice of a fleet improvement program, agencies that may receive them, and the timing of investments. Earlier efforts to solve this problem involved the application of 1- or 2-dimensional models for each year of the planning period. These may have resulted in suboptimal solution as the models are blind to the impact of the fleet management program of the subsequent years. Therefore, a new model to address a long-term planning horizon is proposed. The model is formulated as a non-linear optimization problem of maximizing the total weighted average remaining life of the fleet subjected to improvement program and budgetary constraints. Two variants of the problem, one with an annual budget constraint and the other with a single budget constraint for the entire planning period, are formulated. Two independent approaches, namely, branch and bound algorithm and genetic algorithm are used to obtain the solution. An example problem is solved and results are discussed in details. Finally, the model is applied to a large scale real-world problem and a detailed analysis of the results is presented.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 44 (2010)
Issue (Month): 6 (July)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Pillai, Rekha S. & Rathi*, Ajay K. & L. Cohen, Stephen, 1998. "A restricted branch-and-bound approach for generating maximum bandwidth signal timing plans for traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 517-529, November.
- Haggag, A. A., 1981. "A variant of the generalized reduced gradient algorithm for non-linear programming and its applications," European Journal of Operational Research, Elsevier, vol. 7(2), pages 161-168, June.
- Sheu, Jiuh-Biing, 2006. "A novel dynamic resource allocation model for demand-responsive city logistics distribution operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 42(6), pages 445-472, November.
- Diana, Marco & Dessouky, Maged M. & Xia, Nan, 2006. "A model for the fleet sizing of demand responsive transportation services with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 40(8), pages 651-666, September.
- Simms, B. W. & Lamarre, B. G. & Jardine, A. K. S. & Boudreau, A., 1984. "Optimal buy, operate and sell policies for fleets of vehicles," European Journal of Operational Research, Elsevier, vol. 15(2), pages 183-195, February.
- Uyeno, Dean H. & Willoughby, Keith A., 1995. "Transit centre location-allocation decisions," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(4), pages 263-272, July.
- Melachrinoudis, Emanuel & Kozanidis, George, 2002. "A mixed integer knapsack model for allocating funds to highway safety improvements," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(9), pages 789-803, November.
When requesting a correction, please mention this item's handle: RePEc:eee:transa:v:44:y:2010:i:6:p:418-432. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.