Solving the battery swap station location-routing problem with a mixed fleet of electric and conventional vehicles using a heuristic branch-and-price algorithm with an adaptive selection scheme

作者：

Highlights：

• Location routing problem, including time windows, and a mixed fleet, is investigated.

• A branch-and-price algorithm combining exact and heuristic policies is proposed.

• The proposed algorithm finds the optimal solution quickly to small-scale instances.

• The proposed algorithm performs better than existing ones for large-scale instances.

摘要

•Location routing problem, including time windows, and a mixed fleet, is investigated.•A branch-and-price algorithm combining exact and heuristic policies is proposed.•The proposed algorithm finds the optimal solution quickly to small-scale instances.•The proposed algorithm performs better than existing ones for large-scale instances.

论文关键词：Electric vehicles,Battery swapping,Location-routing problem,Branch-and-price,Heuristic policy

论文评审过程：Received 8 December 2020, Revised 16 May 2021, Accepted 26 July 2021, Available online 5 August 2021, Version of Record 12 August 2021.

论文官网地址：https://doi.org/10.1016/j.eswa.2021.115683