Metraipolis › archive › dc_fa940af5be11

The Time-Dependent Traveling Salesman Problem with Loose Time Windows — arXiv:2608.26360

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.26360
License (as archived)
CC0-1.0
Archived
2026-10-17T19:20:47.348Z
SHA-256 of the archived text
778196d3aace883a6910e578e4d2894b535c21835655dab01c06c0e969f2829f
Stable URL of this page
https://metraipolis.com/documento/dc_fa940af5be11

How to cite

The Time-Dependent Traveling Salesman Problem with Loose Time Windows — arXiv:2608.26360 — arXiv (en), https://arxiv.org/abs/2608.26360 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fa940af5be11 (Metraipolis archive dc_fa940af5be11, sha256 778196d3aace883a6910e578e4d2894b535c21835655dab01c06c0e969f2829f)
BibTeX
@misc{dcfa940af5be11,
  title = {The Time-Dependent Traveling Salesman Problem with Loose Time Windows — arXiv:2608.26360},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.26360},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fa940af5be11; sha256 778196d3aace883a6910e578e4d2894b535c21835655dab01c06c0e969f2829f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.26360. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The time-dependent traveling salesman problem with time windows (TDTSPTW) generalizes the well-known traveling salesman problem with time windows by accounting the effects of congestion on travel times. In this paper, we develop an exact framework for the TDTSPTW with a makespan objective that extends the range of instances solvable to optimality under loose time windows while remaining effective across all levels of time-window tightness. Our framework relies on a dynamic-programming labeling algorithm and combines column generation, ng-memory augmentation, and exact search, using completion bounds for state-space sparsification, variable fixing, and exact search pruning. Embedded within a branch-and-price method, the framework solves all instances with up to 45 customers in a benchmark comprising more than 10,000 instances, including all instances without time windows with up to 50 customers.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-28 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.26360 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T19:16:36.836Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).