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

DOI10.1111/ITOR.13302MaRDI QIDQ6495385zbMATH OpenFDO

Authors Javier Panadero, Angel A. Juan, E. Ghorbani, Javier Faulin, Adela Pagès-Bernaus

Publication date 30 April 2024

Published in International Transactions in Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

zbMATH Keywords

sample average approximationteam orienteering problemsimheuristicsrandom travel timesbiased-randomized algorithms

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A biased-randomized metaheuristic for the capacitated location routing problem
• A fast solution method for the time-dependent orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• A method for solving traveling-salesman problems
• A path relinking approach for the team orienteering problem
• A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
• A two-stage approach to the orienteering problem with stochastic weights
• A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
• An effective PSO-inspired algorithm for the team orienteering problem
• Heuristics for the multi-period orienteering problem with multiple time windows
• Iterated local search for the team orienteering problem with time windows
• Lectures on Stochastic Programming
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• On complexity of multistage stochastic programs
• Simulation-based optimization. Parametric optimization techniques and reinforcement learning
• The orienteering problem with stochastic travel and service times
• The orienteering problem with variable profits
• The orienteering problem: a survey
• The reliable facility location problem: formulations, heuristics, and approximation algorithms
• The sample average approximation method for stochastic discrete optimization
• The team orienteering problem

Cited in

(1)

• A probabilistic bi-objective model for a humanitarian location-routing problem under uncertain demand and road closure

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495385)