Optimizing Recovery Network for Used Electric Vehicle Battery: A Comprehensive Location-Routing Approach

This study presents a comprehensive model addressing the Location-Routing Problem (LRP) in the context of recovery of used electric vehicle battery (EVB) for reuse and recycling. Our contribution aims to minimize total costs that cover the installation of central collection centre, the routing problem and direct transportation to big installation of reuse and recycling. We employ the branch-and-bound method via the CPLEX solver to optimize MILP model formulated for EVB recovery network in the case of Small instance. Elsewhere for medium and big instance the metha-heuristic of genetic algorithm is implemented and tested to prove the efficiency of our approach across different scenarios. The experimentation of results show that the genetic algorithm produces competitive solutions within significantly reduced computation times compared to the CPLEX solver, particularly for larger problem instances.

Authors

Institutions

Publication Details

Published
2024-11-03
DOI
https://doi.org/10.1109/afros62115.2024.11036948
Primary Topic
Electric Vehicles and Infrastructure
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing Recovery Network for Used Electric Vehicle Battery: A Comprehensive Location-Routing Approach

Abdelghani Bekrar, Mohammed Bennekrouf, Chaima Zormati, Oumaima BOUCHAKOUR et al.
Electric Vehicles and Infrastructure
article

Optimizing Recovery Network for Used Electric Vehicle Battery: A Comprehensive Location-Routing Approach

Abdelghani Bekrar, Mohammed Bennekrouf, Chaima Zormati, Oumaima BOUCHAKOUR, Imane NIGRO
article en

Abstract

This study presents a comprehensive model addressing the Location-Routing Problem (LRP) in the context of recovery of used electric vehicle battery (EVB) for reuse and recycling. Our contribution aims to minimize total costs that cover the installation of central collection centre, the routing problem and direct transportation to big installation of reuse and recycling. We employ the branch-and-bound method via the CPLEX solver to optimize MILP model formulated for EVB recovery network in the case of Small instance. Elsewhere for medium and big instance the metha-heuristic of genetic algorithm is implemented and tested to prove the efficiency of our approach across different scenarios. The experimentation of results show that the genetic algorithm produces competitive solutions within significantly reduced computation times compared to the CPLEX solver, particularly for larger problem instances.

Laboratoire d'Automatique, de Mécanique et d'Informatique Industrielles et Humaines (FR), École Supérieure en Sciences Appliquées de Tlemcen (DZ), Université Polytechnique Hauts-de-France (FR)
Affordable and clean energy
Openalex Percentile: Top 72%
Electric Vehicles and Infrastructure
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.