Finding Optimal Refueling Policies in Transportation Networks
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.
KeywordsShort Path Transportation Network Transition Sequence Combinatorial Property Transition Path
Unable to display preview. Download preview PDF.
- 2.Corman, T.H., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)Google Scholar
- 3.Khuller, S., Malekian, A., Mestre, J.: To fill or not to fill: the gas station problem. In: Proceedings of European Symposia on Algorithms (2007)Google Scholar
- 6.Suzuki, Y.: A generic model for motor-carrier fuel optimization. Working paper, College of Business, Iowa State UniversityGoogle Scholar