Answers are grounded in this paper and cite their sources.
A numbet of papets have been proposed for the approximate solution of the diaUa-ride routing problem, Tl]e object of this paper is to examine some of these heuristics, to introduce some new heuristics, and to compare tliese approximate algoritluns.
No takes yet. Share an insight, caveat, or question.
Kubo et al. (1990) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: