Answers are grounded in this paper and cite their sources.
SYNOPTIC ABSTRACTThe single-vehicle dial-a-ride problem with time window constraints for both pick-up and delivery locations, and precedence and capacity constraints, is solved using a forward dynamic programming algorithm. The total distance is minimized. The development of criteria for the elimination of infeasible states results in solution times which increase linearly with problem size.
No takes yet. Share an insight, caveat, or question.
Desrosiers et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: