Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-018-1342-y
Abstract: This article proposes extensions of exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows, which are a limited enlargement of the generally referred to as hard time windows. The… read more here.
Keywords: time; problem; exact heuristic; heuristic dynamic ... See more keywords