首页|Branch and Price for the Stochastic Traveling Salesman Problem with Generalized Latency

Branch and Price for the Stochastic Traveling Salesman Problem with Generalized Latency

扫码查看
原文链接
  • NETL
  • NSTL
  • Informs
We consider an extension of the symmetric traveling salesman problem with generalized latency that explicitly models uncertainty. The stochastic traveling salesman problem with generalized latency (STSP-GL) aims to choose a subset of nodes of an undirected graph and determines a Hamiltonian tour among those nodes, minimizing an objective function that is a weighted combination of route design and passenger routing costs. These nodes are selected to ensure that a predefined percentage of uncertain passenger demand is served with a given probability. We formulate the STSP-GL as a stochastic program and propose a branch-and-price algorithm for solving its deterministic equivalent. We also develop a local search approach with which we improve the performance of the branch-and-price approach. We assess the efficiency of the proposed methods on a set of instances from the literature. We demonstrate that the proposed methods outperform a known benchmark, improving upper bounds by up to 85% and lower bounds by up to 55%. Finally, we show that solutions of the stochastic model are both more cost-effective and robust than those of the deterministic model.

semiflexible transitbranch and pricetraveling salesperson problemlatencystochastic programming

Benedikt Lienkamp、Mike Hewitt、Maximilian Schiffer

展开 >

School of Management, Technical University of Munich, 80333 Munich, Germany

Quinlan School of Business, Loyola University, Chicago, Illinois 60611

School of Management, Technical University of Munich, 80333 Munich, Germany||Munich Data Science Institute, Technical University of Munich, 80333 Munich, Germany

2025

10.1287/trsc.2023.0417

Transportation science

Transportation science

ISSN：0041-1655
年,卷(期)：2025.59(2)
  • 55