dial-a-ride problem

A mathematical problem in which a set of deliveries must be made along a set of available routes between fixed sources and destinations, within limited time periods, and with the possibility of changing vehicles during a trip.