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.

• Type: Conference
• Year: 2008
• Where: AAIM
• Authors: Shieu-Hong Lin
• Keywords: AAIM 2008, Algorithms, Optimal Refueling Policies, Refueling Operations, Total Transportation Costs