Journal article
INFORMS Journal on Computing, vol. 35(5), 2023, pp. 1195-1213
Professor and Chair of Operational Research
Professor and Chair of Operational Research
Professor and Chair of Operational Research
APA
Click to copy
Lamontagne, S., Carvalho, M., Frejinger, E., Gendron, B., Anjos, M. F., & Atallah, R. (2023). Optimising electric vehicle charging station placement using advanced discrete choice models. INFORMS Journal on Computing, 35(5), 1195–1213. https://doi.org/10.1287/ijoc.2022.0185
Chicago/Turabian
Click to copy
Lamontagne, S., M. Carvalho, E. Frejinger, B. Gendron, M.F. Anjos, and R. Atallah. “Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models.” INFORMS Journal on Computing 35, no. 5 (2023): 1195–1213.
MLA
Click to copy
Lamontagne, S., et al. “Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models.” INFORMS Journal on Computing, vol. 35, no. 5, 2023, pp. 1195–213, doi:10.1287/ijoc.2022.0185.
BibTeX Click to copy
@article{s2023a,
title = {Optimising electric vehicle charging station placement using advanced discrete choice models},
year = {2023},
issue = {5},
journal = {INFORMS Journal on Computing},
pages = {1195-1213},
volume = {35},
doi = {10.1287/ijoc.2022.0185},
author = {Lamontagne, S. and Carvalho, M. and Frejinger, E. and Gendron, B. and Anjos, M.F. and Atallah, R.}
}
We present a new model for finding the optimal placement of electric vehicle charging stations across a multiperiod time frame so as to maximise electric vehicle adoption. Via the use of stochastic discrete choice models and user classes, this work allows for a granular modelling of user attributes and their preferences in regard to charging station characteristics. We adopt a simulation approach and precompute error terms for each option available to users for a given number of scenarios. This results in a bilevel optimisation model that is, however, intractable for all but the simplest instances. Our major contribution is a reformulation into a maximum covering model, which uses the precomputed error terms to calculate the users covered by each charging station. This allows solutions to be found more efficiently than for the bilevel formulation. The maximum covering formulation remains intractable in some instances, so we propose rolling horizon, greedy, and greedy randomised adaptive search procedure heuristics to obtain good-quality solutions more efficiently. Extensive computational results are provided, and they compare the maximum covering formulation with the current state of the art for both exact solutions and the heuristic methods.