A Continuous Approximation Model for the Electric Vehicle Fleet Sizing Problem
FROGER, Aurélien
Institut de Mathématiques de Bordeaux [IMB]
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]
Institut de Mathématiques de Bordeaux [IMB]
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]
JABALI, Ola
Dipartimento di Electtronica, Informazione e Bioingegneria [Politecnico Milano] [POLIMI]
Voir plus >
Dipartimento di Electtronica, Informazione e Bioingegneria [Politecnico Milano] [POLIMI]
FROGER, Aurélien
Institut de Mathématiques de Bordeaux [IMB]
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]
Institut de Mathématiques de Bordeaux [IMB]
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]
JABALI, Ola
Dipartimento di Electtronica, Informazione e Bioingegneria [Politecnico Milano] [POLIMI]
< Réduire
Dipartimento di Electtronica, Informazione e Bioingegneria [Politecnico Milano] [POLIMI]
Langue
en
Document de travail - Pré-publication
Résumé en anglais
Establishing the size of an EV fleet is a vital decision for logistics operators. In urban settings, this issue is often dealt with by partitioning the geographical area around a depot into service zones, each served by a ...Lire la suite >
Establishing the size of an EV fleet is a vital decision for logistics operators. In urban settings, this issue is often dealt with by partitioning the geographical area around a depot into service zones, each served by a single vehicle. Such zones ultimately guide daily routing decisions. We study the problem of determining the optimal partitioning of an urban logistics area served by EVs. We cast this problem in a Continuous Approximation (CA) framework. Considering a ring radial region with a depot at its center, we introduce the electric vehicle fleet sizing problem (EVFSP). As the current range of EVs is fairly sufficient to perform service in urban areas, we assume that the EV fleet is exclusively charged at the depot, i.e., en-route charging is not allowed. In the EVFSP we account for EV features such as limited range, and non-linear charging and energy pricing functions stemming from Time-of-use (ToU) tariffs. Specifically, we combine non-linear charging functions with pricing functions into charging cost functions, establishing the cost of charging an EV for a target charge level. We propose a polynomial time algorithm for determining this function. The resulting function is non-linear with respect to the route length. Therefore, we propose a Mixed Integer Non-linear Program (MINLP) for the EVFSP, which optimizes both dimensions of each zone in the partition. We strengthen our formulation with symmetry breaking constraints. Furthermore, considering convex charging cost functions, we show that zones belonging to the same ring are equally shaped. We propose a tailored MINLP formulation for this case. Finally, we derive upper and lower bounds for the case of non-convex charging cost functions. We perform a series of computational experiments. Our results demonstrate the effectiveness of our algorithm in computing charging cost functions. We show that it is not uncommon that these functions are non-convex. Furthermore, we observe that our tailored formulation for convex charging cost functions improves the results compared to our general formulation. Finally, contrary to the results obtained in the CA literature for combustion engine vehicles, we empirically observe that the majority of EVFSP optimal solutions consist of a single inner ring.< Réduire
Mots clés en anglais
Continuous Approximation
Electric Vehicles
Fleet Sizing
Region Partitioning
Origine
Importé de halUnités de recherche