Answers are grounded in this paper and cite their sources.
We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problem. Computational experiments carried out on instances taken from the literature indicate that the proposed method outperforms existing heuristics for all three problems.
No takes yet. Share an insight, caveat, or question.
Cordeau et al. (1997) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: