Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem

•A Multi-Depots Multi-Trips Heterogeneous Dial-A-Ride Problem is introduced (MD-MT-HDARP).•Three hybrid algorithms are proposed for the MD-MT-HDARP.•Algorithms are highly effective in solving newly generated instances.•Algorithms outperform current state-of-the-art algorithm on all sets of MD-HDARP instances.