A fuel management model for the airline industry
Operations Research
Lower Bounds in Lot-Sizing Models: a Polyhedral Study
Mathematics of Operations Research
Solving Real-World Linear Programs: A Decade and More of Progress
Operations Research
A new characterization for the dynamic lot size problem with bounded inventory
Computers and Operations Research
A decision support system of dynamic vehicle refueling
Decision Support Systems
Going Bunkers: The Joint Route Selection and Refueling Problem
Manufacturing & Service Operations Management
To fill or not to fill: the gas station problem
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Computers and Industrial Engineering
A linear-time algorithm for finding optimal vehicle refueling policies
Operations Research Letters
Hi-index | 0.00 |
The fixed-route vehicle-refueling problem (FRVRP) is a difficult combinatorial problem that is used extensively in the US truckload industry to manage fuel costs. This paper proposes a preprocessing technique for the FRVRP that cuts the problem size noticeably without eliminating the optimal solution(s), which allows users to enlarge the size of solvable instances or save the CPU time of solving the problem dramatically. Empirical testing with real-world instances shows that our method: (i) reduces the problem size by 54.8% and (ii) solves the FRVRPs to optimality in roughly 1/4 of the time it is currently taking.