Enhanced Exact Methods for Optimizing Energy Delivery in Preemptive Electric Vehicle Charging Scheduling Problems
The increasing adoption of electric vehicles (EVs) requires efficient management of charging infrastructure, particularly in optimizing the allocation of limited charging resources. This paper addresses the preemptive electric vehicle charging scheduling problem (EVCSP), where charging sessions can be interrupted to maximize the number of satisfied demands. The existing mathematical formulations often struggle with scalability and computational efficiency for even small problem instances. As a result, we propose an enhanced mathematical programming model, which is further refined to reduce decision variable complexity and improve computational performance. In addition, a constraint programming (CP) approach is explored as an alternative method for solving the EVCSP due to its strength in handling complex scheduling constraints. The experimental results demonstrate that the developed methods significantly outperform the existing models in the literature, providing scalable and efficient solutions for optimizing EV charging infrastructure.
Authors
- Abdennour Azerine (ORCID: https://orcid.org/0000-0003-2460-3140)
- Ammar Oulamara (ORCID: https://orcid.org/0000-0003-2357-0404)
- Mahmoud Golabi (ORCID: https://orcid.org/0000-0002-3314-2051)
- Lhassane Idoumghar (ORCID: https://orcid.org/0000-0001-8853-3968)
Institutions
- Université de Haute-Alsace (FR)
- Laboratoire Lorrain de Recherche en Informatique et ses Applications (FR)
- Université de Lorraine (FR)
Publication Details
- Journal
- Mathematical and Computational Applications
- Published
- 2025-07-24
- DOI
- https://doi.org/10.3390/mca30040079
- Primary Topic
- Electric Vehicles and Infrastructure
- Type
- article
- Field-Weighted Citation Impact
- 0.00