A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Most vehicle routing approaches disregard the need to refuel fleets. However, planners search for opportunities to refuel at lower prices even if, counter-intuitively, distant fuel stations need to be visited. We propose a novel mathematical formulation and develop branch-and-cut and matheuristic algorithms to efficiently tackle this problem. Results indicate that, to minimize costs, detour distances may increase up to 6 percentage points when fuel stations with lower prices are farther awaydoi:10.1016/j.tre.2019.11.011 fatcat:mvnntm4agfcsbiporzv6ysuw6e