A branch\&cut approach to recharging and refueling infrastructure planning

DOI10.1016/j.ejor.2019.06.031zbMath1430.90376MaRDI QIDQ2315636

Paul Göpfert, Stefan Bock

Publication date: 25 July 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.06.031

zbMATH Keywords

location; electric vehicles; branch\&cut; charging infrastructure planning; limited range

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B06: Transportation, logistics and supply chain management

90B80: Discrete location and assignment

Related Items

Prescriptive analytics in public-sector decision-making: a framework and insights from charging infrastructure planning, Optimizing the electrification of roads with charge-while-drive technology

Cites Work

• Unnamed Item
• A branch and price approach for routing and refueling station location model
• Battery swap station location-routing problem with capacitated electric vehicles
• Theoretical challenges towards cutting-plane selection
• The electric location routing problem with time windows and partial recharging
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• On the separation of maximally violated mod-\(k\) cuts
• The electric vehicle shortest-walk problem with battery exchanges
• Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model
• Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem
• Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
• Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets