AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES

DOI10.1142/S0217595904000229zbMath1073.90037MaRDI QIDQ5315817

Suyan Teng, Hoon Liong Ong, Huei-Chuen Huang

Publication date: 9 September 2005

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Benders' decomposition; stochastic program with recourse; Integer L-shaped method; time-constrained traveling salesman problem

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C15: Stochastic programming

90C27: Combinatorial optimization

Related Items

Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• The selective travelling salesman problem
• A multicut algorithm for two-stage stochastic linear programs
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• Partitioning procedures for solving mixed-variables programming problems
• New optimality cuts for a single-vehicle stochastic routing problem
• The traveling salesman. Computational solutions for RSP applications
• A tabu search heuristic for the undirected selective travelling salesman problem
• A Linear Programming Approach to the Cutting-Stock Problem
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• The Vehicle Routing Problem with Stochastic Travel Times
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers