Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/1174
Title: Lower bound on fleet-size in variable-schedule fleet-size problem
Authors: Ankolekar, Suresh
Patel, Nitin R.
Keywords: Time management;Transportation
Issue Date: 14-Mar-2010
Series/Report no.: WP;1985/581
Abstract: This paper discusses an approach to compute a lower bound on fleet-size in variable-schedule fleet-size problem. The lower bound is computed in two stages. In stage one, a fixed-schedule fleet-size problem is solved for a relaxed set of trips where each trips is assumed to be departing at its latest permissible departure time and yet arrive at earliest arrival time resulting in reduced elapsed time. In second stage the lower bound is augmented by the minimum additional fleet-size required to make each trip individually restorable to its original elapsed time.
URI: http://hdl.handle.net/11718/1174
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP 1985_581.pdf280.39 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.