The multi-depot general share-a-ride problem

作者：

Highlights：

• The Multi-Depot General Share-a-Ride Problem (MD-GSARP) is introduced.

• A mathematical model for MD-GSARP is developed.

• A simulated annealing algorithm is developed for solving MD-GSARP.

• The proposed SA is effective and efficient to solve MD-GSARP.

摘要

•The Multi-Depot General Share-a-Ride Problem (MD-GSARP) is introduced.•A mathematical model for MD-GSARP is developed.•A simulated annealing algorithm is developed for solving MD-GSARP.•The proposed SA is effective and efficient to solve MD-GSARP.

论文关键词：Multi-depot,General share-a-ride problem,Simulated Annealing

论文评审过程：Received 20 November 2021, Revised 17 September 2022, Accepted 11 October 2022, Available online 18 October 2022, Version of Record 22 October 2022.

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