Routing a Fleet of Vehicles for Dynamic Combined Pick-up and Deliveries Services

This work partially reports the results of a study aiming at the design and analysis of the performance of a multi-cab metropolitan transportation system. In our model we investigate a particular multi-vehicle many-to-many dynamic request dial-a-ride problem. We present a heuristic algorithm for this problem and some preliminary results. The algorithm is based on iteratively solving a single-vehicle subproblem at optimality: a pretty efficient dynamic programming routine has been devised for this purpose.