A hybrid metaheuristic to optimize electric first-mile feeder services with charging synchronization constraints and customer rejections
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910323360923648 |
|---|---|
| author | Ma, Tai-Yu Fang, Yumeng Connors, Richard D. Viti, Francesco Nakao, Haruko |
| author_facet | Ma, Tai-Yu Fang, Yumeng Connors, Richard D. Viti, Francesco Nakao, Haruko |
| contents | This paper addresses the on-demand meeting-point-based feeder electric bus routing and charging scheduling problem under charging synchronization constraints. The problem considered exhibits the structure of the location routing problem, which is more difficult to solve than many electric vehicle routing problems with capacitated charging stations. We propose to model the problem using a mixed-integer linear programming approach based on a layered graph structure. An efficient hybrid metaheuristic solution algorithm is proposed. A mixture of random and greedy partial charging scheduling strategies is used to find feasible charging schedules under the synchronization constraints. The algorithm is tested on instances with up to 100 customers and 49 bus stops/meeting points. The results show that the proposed algorithm provides near-optimal solutions within less one minute on average compared with the best solutions found by a mixed-integer linear programming solver set with a 4-hour computation time limit. A case study on a larger sized case with 1000 customers and 111 meeting points shows the proposed method is applicable to real-world situations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_03838 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A hybrid metaheuristic to optimize electric first-mile feeder services with charging synchronization constraints and customer rejections Ma, Tai-Yu Fang, Yumeng Connors, Richard D. Viti, Francesco Nakao, Haruko Optimization and Control This paper addresses the on-demand meeting-point-based feeder electric bus routing and charging scheduling problem under charging synchronization constraints. The problem considered exhibits the structure of the location routing problem, which is more difficult to solve than many electric vehicle routing problems with capacitated charging stations. We propose to model the problem using a mixed-integer linear programming approach based on a layered graph structure. An efficient hybrid metaheuristic solution algorithm is proposed. A mixture of random and greedy partial charging scheduling strategies is used to find feasible charging schedules under the synchronization constraints. The algorithm is tested on instances with up to 100 customers and 49 bus stops/meeting points. The results show that the proposed algorithm provides near-optimal solutions within less one minute on average compared with the best solutions found by a mixed-integer linear programming solver set with a 4-hour computation time limit. A case study on a larger sized case with 1000 customers and 111 meeting points shows the proposed method is applicable to real-world situations. |
| title | A hybrid metaheuristic to optimize electric first-mile feeder services with charging synchronization constraints and customer rejections |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2401.03838 |