A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations

DOI10.1007/S11590-021-01714-3MaRDI QIDQ2230799zbMATH OpenOpenAlexFDO

Authors Maurizio Bruglieri, S. Mancini, Ornella Pisacane

Publication date 28 September 2021

Published in Optimization Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11590-021-01714-3

zbMATH Keywords

mixed integer linear programmingvehicle routing problemalternative fuel vehiclesfueling pump reservation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• The green vehicle routing problem with capacitated alternative fuel stations
• A path-based solution approach for the green vehicle routing problem
• A new mathematical programming model for the green vehicle routing problem
• A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations
• A meta-heuristic for capacitated green vehicle routing problem

Cites work

• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
• A path-based solution approach for the green vehicle routing problem
• A variable neighborhood search branching for the electric vehicle routing problem with time windows
• An NSGA-II algorithm for the green vehicle routing problem
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops
• Cutting planes in integer and mixed integer programming
• Electric vehicle routing problem with time-dependent waiting times at recharging stations
• Exact algorithms for electric vehicle-routing problems with time windows
• Fuzzy green vehicle routing problem with simultaneous pickup – delivery and time windows
• Routing a mix of conventional, plug-in hybrid, and electric vehicles
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations
• The green vehicle routing problem with capacitated alternative fuel stations

Cited in

(6)

• A path-based solution approach for the green vehicle routing problem
• A branch\&cut approach to recharging and refueling infrastructure planning
• A new mathematical programming model for the green vehicle routing problem
• The green vehicle routing problem with capacitated alternative fuel stations
• A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations
• Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations

This page was built for publication: A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230799)