A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
INFORMS Journal on Computing
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
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
A linear-time algorithm for finding optimal vehicle refueling policies
Operations Research Letters
A variable-reduction technique for the fixed-route vehicle-refueling problem
Computers and Industrial Engineering
A decision support system for public logistics information service management and optimization
Decision Support Systems
| Hi-index | 0.00 |
Given the recent trend of raising fuel cost and the increased time-sensitiveness of shippers, an extensive pressure is placed on the motor-carrier industry to meet the time-constrained customer demands at minimum fuel cost. We propose a decision support system that allows motor carriers to route each vehicle such that the vehicle not only visits all the customers in time (without violating time windows), but also utilizes the ''cheapest'' gas stations (cheapest truck stops in the region) as refueling points during the tour. While this approach does not necessarily minimize a vehicle's fuel consumption, as it often suggests using non-shortest routes with cheap gas stations (truck stops), it allows the vehicle to reduce the unit cost of buying fuel. Computational testing shows that the proposed approach may attain up to 4.29% savings in fuel cost for motor carriers.