Models and algorithms for the Time Window Assignment Traveling Salesperson Problem with stochastic travel times

Francesco Cavaliere, Matteo Fischetti, Roberto Roberti and Domenico Salvagnin

European Journal of Operational Research, 2026, vol. 329, issue 1, 96-111

Abstract: We study the Time Window Assignment Traveling Salesperson Problem with Stochastic Travel Times, a two-stage stochastic problem where the first-stage decisions involve the routing aspects and the customer time window definition. Second-stage decisions follow, which integrate travel time uncertainties into the optimization process. The objective is to minimize the combined routing and time window cost, including penalties for earliness and lateness, marking a shift from a cost-focused routing strategy to a more balanced approach that considers both cost and service quality aspects in delivery operations.

Keywords: Combinatorial optimization; Traveling salesman; Transportation; Routing; Benders decomposition (search for similar items in EconPapers)
Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221725005600
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:329:y:2026:i:1:p:96-111

DOI: 10.1016/j.ejor.2025.07.034

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().