A two-stage approach to the orienteering problem with stochastic weights

DOI10.1016/J.COR.2013.09.011MaRDI QIDQ336923zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

stochastic programmingstochastic heuristicuncertain orienteering problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

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

Cites work

• scientific article; zbMATH DE number 4061010 (Why is no real title available?)
• scientific article; zbMATH DE number 1769325 (Why is no real title available?)
• A branch and bound method for stochastic global optimization
• A fast and effective heuristic for the orienteering problem
• A heuristic for the multiple tour maximum collection problem
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
• Algorithms for a stochastic selective travelling salesperson problem
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• An Optimal Algorithm for the Orienteering Tour Problem
• Introduction to the theory of probabilistic functions and percentiles (value-at-risk)
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• Robust UAV mission planning
• Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans
• Solving the Orienteering Problem through Branch-and-Cut
• The generalized fixed-charge network design problem
• The orienteering problem
• The orienteering problem with stochastic travel and service times
• The orienteering problem: a survey
• The sample average approximation method for stochastic discrete optimization
• The selective travelling salesman problem
• Variable neighborhood search

Cited in

(19)

• A dynamic and probabilistic orienteering problem
• Robust Team Orienteering Problem with Decreasing Profits
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• An effective hybrid evolutionary algorithm for the clustered orienteering problem
• Solving the stochastic time-dependent orienteering problem with time windows
• Multi-period orienteering with uncertain adoption likelihood and waiting at customers
• Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method
• Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory
• The time-dependent orienteering problem with time windows: a fast ant colony system
• A matheuristic approach to the orienteering problem with service time dependent profits
• Rollout-based routing strategies with embedded prediction: a fish trawling application
• The hazardous orienteering problem
• Two-stage robust optimization for the orienteering problem with stochastic weights
• Optimization approaches for solving chance constrained stochastic orienteering problems
• Orienteering problem: a survey of recent variants, solution approaches and applications
• The probabilistic orienteering problem
• Trip planning for visitors in a service system with capacity constraints
• 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

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)