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

DOI10.1142/S0217595904000229zbMath1073.90037OpenAlexW2017646833MaRDI QIDQ5315817

Hoon Liong Ong, Suyan Teng, Huei-Chuen Huang

Publication date: 9 September 2005

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

Full work available at URL: https://doi.org/10.1142/s0217595904000229

zbMATH Keywords

Benders' decompositionstochastic program with recourseInteger L-shaped methodtime-constrained traveling salesman problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (11)

A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ A priori orienteering with time windows and stochastic wait times at customers ⋮ A two-stage approach to the orienteering problem with stochastic weights ⋮ A maritime inventory routing problem with stochastic sailing and port times ⋮ Rough approximation-based approach for designing a personalized tour route under a fuzzy environment ⋮ The orienteering problem with stochastic travel and service times ⋮ Challenges and Advances in A Priori Routing ⋮ Solving the stochastic time-dependent orienteering problem with time windows ⋮ Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers ⋮ Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times

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

This page was built for publication: AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES