Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method

Cites Work

A two-stage approach to the orienteering problem with stochastic weights
The orienteering problem: a survey
The orienteering problem with stochastic travel and service times
Heuristics for the multi-period orienteering problem with multiple time windows
Iterated local search for the team orienteering problem with time windows
A path relinking approach for the team orienteering problem
The team orienteering problem
Monte Carlo bounding techniques for determinig solution quality in stochastic programs
Simulation-based optimization. Parametric optimization techniques and reinforcement learning
An effective PSO-inspired algorithm for the team orienteering problem
A fast solution method for the time-dependent orienteering problem
A guided local search metaheuristic for the team orienteering problem
On complexity of multistage stochastic programs
A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
The Sample Average Approximation Method for Stochastic Discrete Optimization
The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
Lectures on Stochastic Programming
The orienteering problem with variable profits
A biased‐randomized metaheuristic for the capacitated location routing problem
A Method for Solving Traveling-Salesman Problems
A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands

This page was built for publication: Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method