Exact and anytime approach for solving the time dependent traveling salesman problem with time windows

Romain Fontaine, Jilles Dibangoye, Christine Solnon

Abstract: Highlights•We introduce a new bounding function based on an efficient feasibility check.•We combine it with an anytime and exact variant of A*, constraint propagation and LS.•We provide an experimental study on various time-dependent and constant benchmarks.•Our approach finds reference solutions faster than state-of-the-art approaches.•Our approach is competitive with state-of-the-art approaches for proving optimality.