Weiquan Wang

Weiquan Wang

Auto-generated profile, based on publicly available information

Weiquan Wang


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

22 November 2024 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
WWWeiquan Wang
Weiquan Wang
YAYossiri Adulyasak
Yossiri Adulyasak
JCJean-François Cordeau
Jean-François Cordeau
GHGuannan He
Guannan He

14 January 2026 in Computers & Operations Research
Verified
Journal Article
Closed access
WWWeiquan Wang
Weiquan Wang
YAYossiri Adulyasak
Yossiri Adulyasak
JCJean-François Cordeau
Jean-François Cordeau

15 April 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
WWWeiquan Wang
Weiquan Wang
ADAmira Dems
Amira Dems
YAYossiri Adulyasak
Yossiri Adulyasak
OAOkan Arslan
Okan Arslan
JCJean-François Cordeau
Jean-François Cordeau
As fast-charging demand grows, ensuring the operational resilience of electric vehicle (EV) infrastructure under congestion becomes a key challenge in large-scale transportation systems. We study a bilevel charging facility location problem in which EV drivers choose paths based on a disutility function incorporating travel time, charging stops, and queuing delays modeled via an M/M/c system. We develop both arc-flow and path-based bilevel formulations and derive equivalent single-level mixed-integer linear programming (MILP) reformulations using strong duality and piecewise-linear approximations of queuing delays. To address the computational challenges arising from large-scale transportation networks, we propose an exact decomposition algorithm (DA) that iteratively solves a location master problem and an evaluation subproblem capturing path choice and congestion effects. Several acceleration strategies are introduced to improve convergence speed significantly. Computational results show that the proposed DA substantially outperforms the direct solution of the single-level MILP formulations using a commercial solver on small networks. Extensive experiments on large real-world networks from California and a case study in Quebec demonstrate strong scalability, with most instances solved to optimality or near-optimality within reasonable time limits. Benchmark comparisons on a closely related problem from the literature further show that the proposed DA consistently outperforms the state-of-the-art algorithm in both solution quality and computational robustness.