Abstract
In this paper, we introduce the Green Vehicle Routing Problem with capacitated Alternative Fuel Stations (AFSs), a more realistic variant of the Green Vehicle Routing Problem where the capacity of the AFSs is addressed. Two Mixed Integer Linear Programming formulations, one based on arc-variables and one on path-variables are presented. In order to reduce the computational time required to solve the problem, two variants of an exact cutting planes method are proposed. All the proposed approaches are also extended to be applied in a scenario in which AFSs reservation is allowed, by introducing time windows at them. Computational experiments are carried out on both benchmark and challenging realistic instances for which the capacity of the AFSs is a crucial issue.
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.
