Abstract
The fixed-route vehicle-refueling problem is a daily scheduling problem used by truck companies that seeks the best set of refueling stations (truck stops) for a given route. The paper introduces valid inequalities, lower bounds, as well as methods to reduce the number of stops that can be visited directly after a given stop. We show in a comprehensive computational study that our model formulation reduces the average computation times in comparison with a standard MIP formulation by over 78% on average and by 95% for instances with 2000 truck stops. Instances with 2000 truck stops are solved in less than 0.3 s.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
