Abstract

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 away from the depot. For practice, these insights imply that current policies disregarding station location and/or fuel prices along with “myopic” planning horizons may lead to sub-optimal decisions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.