Capacity expansion strategies for electric vehicle charging networks: Model, algorithms, and case study

DOI10.1002/nav.22027zbMath1523.90248OpenAlexW3208895056MaRDI QIDQ6053131

Qian-Qian Chen, Mark R. Ferguson, Kai Huang

Publication date: 18 October 2023

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.22027

zbMATH Keywords

facility locationcapacity expansionbranch-and-price algorithmelectric vehiclemultistage stochastic integer programminglogit choice modelcharging networks

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (1)

Synchronization and stability in automotive transportation networks

Cites Work

• The maximum capture problem with random utilities: problem formulation and algorithms
• P-hub approach for the optimal park-and-ride facility location problem
• A comparison of linear reformulations for multinomial logit choice probabilities in facility location models
• Capacity Expansion and Probabilistic Growth
• An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion
• A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Capacity expansion strategies for electric vehicle charging networks: Model, algorithms, and case study