This is the authors' abstract. We don't add key points for this paper.
The shortest path problem with time windows (SPPTW) consists of finding the least cost route between a source and a sink in a network G = (N, A) while respecting specified time windows [ai, bi] at each visited node. The duration dij of each arc is restricted to positive values while the cost Cij of each arc (i, j) Є A is unrestricted.This article presents an efficient generalized permanent labelling algorithm to solve this problem. This new algorithm is based on the definition of the concept of a generalized bucket and on a specific order of handling the labels. The algorithm runs in pseudo-polynomial time. Problems with up to 2500 nodes and 250,000 arcs have heen solved.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Desrochers et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: