The orienteering problem with stochastic travel and service times
From MaRDI portal
Publication:646634
DOI10.1007/s10479-011-0895-2zbMath1225.90024OpenAlexW1983758874MaRDI QIDQ646634
Barrett W. Thomas, Michel Gendreau, Ann Melissa Campbell
Publication date: 17 November 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0895-2
Related Items (22)
A matheuristic approach to the orienteering problem with service time dependent profits ⋮ 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 ⋮ Robust Team Orienteering Problem with Decreasing Profits ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ A two-stage approach to the orienteering problem with stochastic weights ⋮ The probabilistic orienteering problem ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ A dynamic and probabilistic orienteering problem ⋮ The hazardous orienteering problem ⋮ Two-stage robust optimization for the orienteering problem with stochastic weights ⋮ Solving the stochastic time-dependent orienteering problem with time windows ⋮ A Tabu search algorithm for the probabilistic orienteering problem ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers ⋮ Sampling-Based Objective Function Evaluation Techniques for the Orienteering Problem with Stochastic Travel and Service Times ⋮ Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios ⋮ Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering ⋮ Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios ⋮ Unnamed Item ⋮ Optimal joint maintenance and orienteering strategy for complex mission-oriented systems: a case study in offshore wind energy ⋮ Rollout-based routing strategies with embedded prediction: a fish trawling application
Cites Work
- Unnamed Item
- Unnamed Item
- The orienteering problem: a survey
- Travel time reliability in vehicle routing and scheduling with time windows
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
- A fast and effective heuristic for the orienteering problem
- Variable neighborhood search
- Record breaking optimization results using the ruin and recreate principle
- Vehicle routing with soft time windows and Erlang travel times
- Challenges and Advances in A Priori Routing
- A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Algorithms for a stochastic selective travelling salesperson problem
- Single-Vehicle Routing and Scheduling to Minimize the Number of Delays
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
This page was built for publication: The orienteering problem with stochastic travel and service times
