Portrait de Nagisa Sugishita

Nagisa Sugishita

Postdoctorat - HEC
Superviseur⋅e principal⋅e
Sujets de recherche
Équité
Optimisation
Systèmes multi-agents
Théorie des jeux

Publications

Competitive EV charging station location with queues
The Minh Nguyen
Amira Dems
Electric vehicle (EV) public charging infrastructure planning faces significant challenges in competitive markets, where multiple service pr… (voir plus)oviders affect congestion and user behaviour. This work extends existing modelling frameworks by incorporating the presence of competitors’ stations and more realistic queueing systems. First, we analyse three finite queueing systems, M/M/1/K,M/M/s/K, and M/Er/s/K, with varying numbers of servers (charging outlets) and service time distributions, deriving analytic expressions for user behaviour metrics. Second, we embed the queueing-based user behaviour model into a bilevel program, where the upper level locates new charging stations to maximise accessibility (throughput), and the lower level captures users’ station choices via a user equilibrium. Third, we apply a reformulation from competitive congested user-choice facility location models to approximately solve the bilevel problem and introduce a surrogate-based heuristic to enhance scalability. Fourth, we showcase our methodology on a real-world case study of an urban area in Montreal (Canada), offering managerial insights into how user-choice behaviour assumptions and competition affect throughput and location decisions. The results demonstrate that our model yields (re)location strategies that outperform the existing network. More broadly, this approach provides a tool for incorporating charging service quality—through queueing metrics—and existing competition into station planning.
The strength of flow refueling location problem formulations and an extension to cyclic routing
Decision Problems in Multilevel Linear Programming
We study the computational complexity of decision problems in …
Unboundedness in Bilevel Optimization
Bárbara Rodrigues
Miguel Anjos
Abstract Bilevel optimization has garnered growing interest over the past decade. However, little attention has been paid to detecting and d… (voir plus)ealing with unboundedness in these problems, with most research assuming a bounded high-point relaxation. In this paper, we address unboundedness in bilevel and multilevel optimization by studying its computational complexity. We show that deciding whether an optimistic linear bilevel problem is unbounded is strongly NP-complete, even without coupling constraints. Furthermore, we extend the hardness result to the linear multilevel case, by showing that for each extra level added, the decision problem of checking unboundedness moves up a level in the polynomial hierarchy. Deciding unboundedness of a mixed-integer multilevel problem is shown to be one level higher in the polynomial complexity hierarchy than the decision problem for linear multilevel problem with the same number of levels. Finally, we introduce two algorithmic approaches to determine whether a linear bilevel problem is unbounded and, if so, return a certificate of unboundedness. This certificate consists of a direction of unboundedness and corresponding bilevel feasible point. We present a proof of concept of these algorithmic approaches on some relevant examples, and provide a brief computational comparison.
The Strength of Fuel Refueling Location Problem Formulations