A two-stage approach to the orienteering problem with stochastic weights
From MaRDI portal
Publication:336923
DOI10.1016/J.COR.2013.09.011zbMATH Open1348.90085OpenAlexW2011268617MaRDI QIDQ336923FDOQ336923
Authors: Lanah Evers, Suzanne Van der Ster, Ana Isabel Barros, H. Monsuur, Kristiaan Glorie 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.09.011
Recommendations
- Two-stage robust optimization for the orienteering problem with stochastic weights
- The probabilistic orienteering problem
- Optimization approaches for solving chance constrained stochastic orienteering problems
- The orienteering problem with stochastic travel and service times
- A dynamic and probabilistic orienteering problem
Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)
Cites Work
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- The orienteering problem
- The orienteering problem: a survey
- The sample average approximation method for stochastic discrete optimization
- Variable neighborhood search
- A branch and bound method for stochastic global optimization
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- A fast and effective heuristic for the orienteering problem
- Introduction to the theory of probabilistic functions and percentiles (value-at-risk)
- Title not available (Why is that?)
- An Optimal Algorithm for the Orienteering Tour Problem
- Solving the Orienteering Problem through Branch-and-Cut
- Title not available (Why is that?)
- Algorithms for a stochastic selective travelling salesperson problem
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
- The orienteering problem with stochastic travel and service times
- The selective travelling salesman problem
- A heuristic for the multiple tour maximum collection problem
- Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
- Robust UAV mission planning
- The generalized fixed-charge network design problem
Cited In (19)
- An effective hybrid evolutionary algorithm for the clustered orienteering problem
- Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory
- The probabilistic orienteering problem
- The time-dependent orienteering problem with time windows: a fast ant colony system
- Rollout-based routing strategies with embedded prediction: a fish trawling application
- Two-stage robust optimization for the orienteering problem with stochastic weights
- The hazardous orienteering problem
- 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
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Trip planning for visitors in a service system with capacity constraints
- A dynamic and probabilistic orienteering problem
- Multi-period orienteering with uncertain adoption likelihood and waiting at customers
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method
- Optimization approaches for solving chance constrained stochastic orienteering problems
- Solving the stochastic time-dependent orienteering problem with time windows
- Robust Team Orienteering Problem with Decreasing Profits
This page was built for publication: A two-stage approach to the orienteering problem with stochastic weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336923)
