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

DOI10.1016/j.cor.2013.09.011zbMath1348.90085OpenAlexW2011268617MaRDI QIDQ336923

Lanah Evers, Ana Isabel Barros, Suzanne Van der Ster, Herman Monsuur, Kristiaan M. 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

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

Related Items (16)

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 ⋮ The probabilistic orienteering problem ⋮ The time-dependent orienteering problem with time windows: a fast ant colony system ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ A dynamic and probabilistic orienteering problem ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ 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 ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers ⋮ Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory ⋮ Rollout-based routing strategies with embedded prediction: a fish trawling application

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust UAV mission planning
• The orienteering problem: a survey
• The orienteering problem with stochastic travel and service times
• The generalized fixed-charge network design problem
• The selective travelling salesman problem
• A fast and effective heuristic for the orienteering problem
• A branch and bound method for stochastic global optimization
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• A heuristic for the multiple tour maximum collection problem
• Variable neighborhood search
• Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• The orienteering problem
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• An Optimal Algorithm for the Orienteering Tour Problem
• Solving the Orienteering Problem through Branch-and-Cut
• 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

This page was built for publication: A two-stage approach to the orienteering problem with stochastic weights