Abstract
We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total transportation costs between vertices. The insight into the structure of optimal refueling policies leads to an elegant reduction of the problem of finding optimal refueling policies into the classical shortest path problem, which ends in simple and more efficient algorithms for finding optimal refueling policies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Atamtürk, A., Küçükyavuz, S.: Lot sizing with inventory bounds and fixed costs: polyhedral study and computation. Operations Research 53, 711–730 (2005)
Corman, T.H., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Khuller, S., Malekian, A., Mestre, J.: To fill or not to fill: the gas station problem. In: Proceedings of European Symposia on Algorithms (2007)
Lin, S.-H., Gertsch, N., Russell, J.: A linear-time algorithm for finding optimal refueling policies. Operations Research Letters 35(3), 290–296 (2007)
Love, S.F.: Bounded production and inventory models with piecewise concave costs. Management Science 20, 313–318 (1973)
Suzuki, Y.: A generic model for motor-carrier fuel optimization. Working paper, College of Business, Iowa State University
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, SH. (2008). Finding Optimal Refueling Policies in Transportation Networks. In: Fleischer, R., Xu, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2008. Lecture Notes in Computer Science, vol 5034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68880-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-68880-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68865-5
Online ISBN: 978-3-540-68880-8
eBook Packages: Computer ScienceComputer Science (R0)