×

A generalized permanent labelling algorithm for the shortest path problem with time windows. (English) Zbl 0652.90097

The shortest path problem with time windows is to find the least cost route between two nodes while satisfying specified time windows at each visited node. The authors present a generalized permanent labelling algorithm to solve the problem. Some computational results on randomly generated problems are presented.
Reviewer: Lau Hang-Tong

MSC:

90C35 Programming involving graphs or networks
90C39 Dynamic programming
PDF BibTeX XML Cite
Full Text: DOI