A linear-time algorithm for finding optimal vehicle refueling policies

DOI10.1016/j.orl.2006.05.003zbMath1180.90025OpenAlexW2078256846WikidataQ115038541 ScholiaQ115038541MaRDI QIDQ2467464

Jennifer R. Russell, Nate Gertsch, Shieu-Hong Lin

Publication date: 21 January 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2006.05.003

zbMATH Keywords

capacitated lot-sizing problem with inventory bounds

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (5)

A branch and price approach for routing and refueling station location model ⋮ A fast algorithm for the gas station problem ⋮ Finding Optimal Refueling Policies in Transportation Networks ⋮ Greedy algorithm for local heating problem ⋮ A generic model of motor-carrier fuel optimization

Cites Work

• An O(T²) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
• Deterministic Production Planning: Algorithms and Complexity
• Computational Complexity of the Capacitated Lot Size Problem
• Bounded Production and Inventory Models with Piecewise Concave Costs
• A Greedy Algorithm for Capacitated Lot-Sizing Problems
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation

This page was built for publication: A linear-time algorithm for finding optimal vehicle refueling policies