Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1023744 | Transportation Research Part E: Logistics and Transportation Review | 2012 | 13 Pages |
In this paper, we consider the problem of managing a fleet of trucks with different capacity to serve the requests of different customers that arise randomly over time. The problem is formulated via dynamic programming. Linear programming approximations of the problem are presented and their solutions are exploited to develop partitioned booking limits and bid prices policies. The numerical experiments show that the proposed policies can be profitably used in supporting the decision maker.
► The management of a fleet of trucks by revenue management techniques is exploited. ► A dynamic programming formulation and linear approximations are defined. ► The possibility of loading multiple demands on the same truck is also considered. ► Booking limit and bid price control policies are developed and tested empirically. ► The proposed policies can be profitably used to support the logistic operator.