Introduces TTP with time windows, creates new benchmarks from existing TTP instances, and shows a new heuristic outperforms adapted TSP and TTP methods on many instances.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.NE 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
The Traveling Thief Problem with Time Windows: Benchmarks and Heuristics
Introduces TTP with time windows, creates new benchmarks from existing TTP instances, and shows a new heuristic outperforms adapted TSP and TTP methods on many instances.