Canqi Yao

Canqi Yao

Auto-generated profile, based on publicly available information

Canqi Yao

Guangdong University of Technology

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
13 May 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
CYCanqi Yao
Canqi Yao
SCShibo Chen
Shibo Chen
ZYZaiyue Yang
Zaiyue Yang
Logistics has gained great attentions with the prosperous development of e-commerce, which is often seen as the classic optimal vehicle routing problem. Meanwhile, electric vehicle (EV) has been widely used in logistic fleet to curb the emission of green house gases in recent years. Thus, solving the optimization problem of joint routing and charging of multiple EVs is in a urgent need, whose objective function includes charging time, charging cost, EVs travel time, usage fees of EV and revenue from serving customers. This joint problem is formulated as a mixed integer programming (MIP) problem, which, however, is NP-hard due to integer restrictions and bilinear terms from the coupling between routing and charging decisions. The main contribution of this paper lies at proposing an efficient two-stage algorithm that can decompose the original MIP problem into two linear programming (LP) problems, by exploiting the exactness of LP relaxation and eliminating the coupled term. This algorithm can achieve a near-optimal solution in polynomial time. In addition, another variant algorithm is proposed based on the two-stage one, to further improve the quality of solution. Compared with the state-of-the-art algorithm, extensive simulations are implemented to validate the effectiveness of the proposed algorithm.

27 June 2023 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
CYCanqi Yao
Canqi Yao
SCShibo Chen
Shibo Chen
MSMauro Salazar
Mauro Salazar
ZYZaiyue Yang
Zaiyue Yang
This paper investigates the scheduling problem of a fleet of electric vehicles, providing mobility as a service to a set of time-specified customers, where the operator needs to solve the routing and charging problem jointly for each EV. We consider incentive-aware customers and propose that the operator offers monetary incentives to customers in exchange for time flexibility. In this way, the fleet operator can arrive at a routing and charging schedule with lower costs, whilst the customers receive monetary compensation for their flexibility. Specifically, we first propose a bi-level optimization model whereby the fleet operator optimizes the routing and charging schedule accounting for the spatio-temporal varying charging price, jointly with a monetary incentive to reimburse the delivery time flexibility experienced by the customers. Concurrently the customers choose their own time flexibility by minimizing their cost. Second, we cope with the computational burden coming from this nonlinear bi-level optimization model with an accurate reformulation approach consisting of the Karush-Kuhn-Tucker optimality conditions, a Big-M-based linearization method, and the zero duality gap of convex optimization problems. We thus convert the proposed problem into a single-level optimization problem, which can be solved by a strengthened generalized Benders decomposition method holding a faster convergence rate than the classic generalized Benders decomposition method. To evaluate the effectiveness of the proposed mathematical model, we carry out numerous simulation experiments by using the VRP-REP data of Belgium. The numerical results showcase that the proposed mathematical model can reduce the delivery fees for the customers together with the cost of operation incurred by the fleet operator.

14 February 2022 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
CYCanqi Yao
Canqi Yao
SCShibo Chen
Shibo Chen
ZYZaiyue Yang
Zaiyue Yang
Considering the penetration of numerous electric vehicles (EV) into the transportation sector, the EV routing problem that jointly optimizes the charging and routing process of EVs is becoming increasingly popular, which should be solved in online fashion for the practical requirements. First, we start with an offline EVs routing and charging (EVRP) problem which is a large-scale mixed integer nonlinear program (MINLP). Considering the NP hardness of MINLP, solving the offline EVRP directly is a time-consuming task that is not suitable for the online setting. Hence, a Benders decomposition based method is proposed to decompose the offline EVRP into a master problem and a set of sub-problems which allows for distributed implementation. To further speed up the computation, we relax the mixed integer master problem to one that can be equivalently solved as a linear program. Moreover, a novel kind of valid cut is added to the relaxed master problem to further reduce the number of iterations. In order to adapt the offline EVRP to the online setting, by introducing the virtual depot, we utilize the rolling-horizon framework to tackle the uncertainty of future information, where the offline EVRP is solved in real-time repeatedly. Finally, simulations using real road map in Belgium are performed. Besides, numerical results validate that the computation speed of proposed algorithm is faster than the state-of-the-art algorithms by several orders of magnitude, and showcase the capability of proposed algorithm to solve large size instances up to 350 nodes with 35 EVs within 100 seconds.

11 March 2025 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
MXMingze Xu
Mingze Xu
Shunbo LeiShunbo Lei
Shunbo Lei
CYCanqi Yao
Canqi Yao
WWWeimin Wu
Weimin Wu
CMCheng Ma
Cheng Ma
Chong WangChong Wang
Chong Wang
Extreme weather events significantly threaten power system security and market operations, causing either substantial load fluctuations or grid line failures. Current distribution-level electricity market mechanisms often prove inadequate during such events. Furthermore, limited research has explored electricity market mechanisms for improving distribution system survivability. To fill this gap, this study proposes a double-auction mechanism to facilitate distribution-level transactions of nonutility distributed energy resources through market incentives for proactive system resilience enhancement. This mechanism aims to utilize a market-driven approach to achieve the highest system survivability in disasters. This trading mechanism is divided into two stages to address the direct changes in the tradability caused by line failures: clearing and delivery. During market clearing, the DSO operates as an auctioneer to concurrently optimize social welfare and prior-event network topology. The pricing rule employs an enhanced Vickrey-Clarke-Groves mechanism to ensure truthful bidding and incentive compatibility. During delivery, the DSO performs redispatch to mitigate economic losses and compensates for energy curtailments through established settlement protocols. This market-driven resilience enhancement method formulates a bi-level two-stage robust optimization problem, solved using a customized column-and-constraint generation algorithm. Modified IEEE 13-node and 123-node systems are used to verify the effectiveness of the proposed approach.

23 May 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
SCShibo Chen
Shibo Chen
HMHaoyu Miao
Haoyu Miao
ZGZhenwei Guo
Zhenwei Guo
LYLiusha Yang
Liusha Yang
CYCanqi Yao
Canqi Yao
ZYZaiyue Yang
Zaiyue Yang
Crowdshipping is an emerging logistics paradigm that leverages excess capacities of occasional couriers to transport goods. This paper investigates the problem that a crowdshipping platform recruits occasional couriers to serve the parcel pickup and delivery requests. A combinatorial reverse auction framework is introduced to model the interactions between the platform and couriers. We design an auction mechanism that implements in polynomial time, which satisfies the computational requirements of crowdshipping. It can also achieve near-optimal social cost with the approximation ratio rigidly proved. Through both rigorous theoretical analyses and extensive simulations, we demonstrate that the proposed auction mechanism is truthful, individual rational and has high computation efficiency.

12 October 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
CYCanqi Yao
Canqi Yao
SCShibo Chen
Shibo Chen
ZYZaiyue Yang
Zaiyue Yang
In this article, we study the cooperative operation problem between the fleet operator and incentive-aware customers in an on-demand delivery system. Specifically, the fleet operator offers discounts on transportation costs in exchange of customers’ delivery time flexibility. In order to capture the interaction between the fleet operator and customers, a novel bilevel optimization framework is proposed. By exploiting the strong duality, and the Karush–Kuhn–Tucker (KKT) optimality condition of customer optimization problems, we can reformulate the bilevel optimization problem as a mixed-integer nonlinear programming (MINLP) problem. Considering the inherent difficulties of MINLP, a computationally efficient algorithm, which combines the merits of Lagrangian dual decomposition and Benders decomposition, is devised to solve the resulting MINLP problem in a distributed manner. Finally, extensive numerical experiments demonstrate that the proposed cooperation scheme can decrease the delivery fees for the customers and reduce the operation cost of the fleet operator at the same time, thus leading to a win–win situation for both sides.