The multi-depot general share-a-ride problem

This research introduces the multi-depot general share-a-ride problem (MD-GSARP), which is an extension of the general share-a-ride problem (G-SARP). The goal of MD-GSARP is to maximize the profit from serving parcel and passenger requests with taxis that depart from several depots and return to their respective depots. We developed a mixed integer linear program for MD-GSARP and proposed a Simulated Annealing (SA) algorithm to solve the problem. The proposed algorithm consists of a deterministic insertion heuristic, a time slack strategy, two sets of neighborhood moves that depend on the time slack strategy, and a penalty mechanism for infeasible solutions. Computational results show that both the commercial solver CPLEX and our proposed SA achieve optimal solutions to small benchmark instances. Moreover, comparative results show that the proposed SA algorithm yields better solutions than the basic SA algorithm. Our analysis also reveals that MD-GSARP solutions are better than G-SARP solutions.