A stochastic dynamic traveling salesman problem with hard time windows
From MaRDI portal
Publication:1042055
DOI10.1016/j.ejor.2008.10.012zbMath1176.90100OpenAlexW1986840051MaRDI QIDQ1042055
Tsung-Sheng Chang, Yat-Wah Wan, Wei Tsang Ooi
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.10.012
Related Items
Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015 ⋮ A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service ⋮ Ensuring service levels in routing problems with time windows and stochastic travel times ⋮ Uncertain multiobjective traveling salesman problem ⋮ A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures ⋮ Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility ⋮ Unnamed Item ⋮ A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping ⋮ Routing Optimization Under Uncertainty ⋮ Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- A dynamic vehicle routing problem with time-dependent travel times
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Lagrangian duality applied to the vehicle routing problem with time windows
- Vehicle routing and scheduling with dynamic travel times
- A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
- A New Heuristic for the Traveling Salesman Problem with Time Windows
- A Hybrid Exact Algorithm for the TSPTW
- A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
- Optimal paths in graphs with stochastic or multidimensional weights
- On a routing problem
- Vehicle Routing with Time Windows
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- The Vehicle Routing Problem with Stochastic Travel Times
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- A Close Approximation Related to the Error Function