On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands

DOI10.1007/s10107-008-0206-0zbMath1163.90014OpenAlexW2080837771MaRDI QIDQ1013973

Juan-José Salazar-González, François V. Louveaux

Publication date: 24 April 2009

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-008-0206-0

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items

An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot ⋮ A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction ⋮ Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands

Cites Work

• Unnamed Item
• Unnamed Item
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• New optimality cuts for a single-vehicle stochastic routing problem
• Robust discrete optimization and network flows
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• The Vehicle Routing Problem with Stochastic Travel Times
• Approximating Capacitated Routing and Delivery Problems
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
• A Priori Optimization