A linear-time algorithm for finding optimal vehicle refueling policies

Authors:
Shieu Hong Lin;Nate Gertsch;Jennifer R. Russell
Affiliations:
Department of Mathematics and Computer Science, Biola University, 13800 Biola Avenue, La Mirada, CA 90639, USA;Department of Mathematics and Computer Science, Biola University, 13800 Biola Avenue, La Mirada, CA 90639, USA;Department of Mathematics and Computer Science, Biola University, 13800 Biola Avenue, La Mirada, CA 90639, USA
Venue:
Operations Research Letters
Year:
2007

Citing 3
Cited 5

An O(T2) algorithm for the NI/G/NI/ND capacitated lot size problem

Management Science
An O(T3) algorithm for the economic lot-sizing problem with constant capacities

Management Science
Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation

Operations Research

Finding Optimal Refueling Policies in Transportation Networks

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
A decision support system of dynamic vehicle refueling

Decision Support Systems
Fuel-cache site-selection for polar research: a summary of results

Proceedings of the Second International Workshop on Computational Transportation Science
A decision support system of vehicle routing and refueling for motor carriers with time-sensitive demands

Decision Support Systems
A variable-reduction technique for the fixed-route vehicle-refueling problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore a fixed-route vehicle refueling problem as a special case of the inventory-capacitated lot-sizing problem, and present a linear-time greedy algorithm for finding optimal refueling policies.