A Simulated Annealing for The Resolution of “Dial-A-Ride-Problem with Transfer” Using Hybrid Neighborhood Methods

In classical transport problems (DARP), a customer must be moved from his collection site to his destination by a single vehicle. On the other hand, in dial-a-ride problems with transfers, it is possible (or obligatory) that customers change their vehicle one time or more during their trips. For this, transferring constraints must be respected in order to guarantee that the reliability of the transfer remains at an acceptable level by avoiding too short delivery times and each customer can rest in the transfer center before finishing his travel. This paper deals with solving the dial a ride problem with transfer taking account of the scheduling in central transfer hub. A simulated annealing algorithm combined with some neighborhood search methods are presented experimental results show that proposed resolution algorithm can perform a presented result in the literature.