The probabilistic orienteering problem

DOI10.1016/j.cor.2016.12.025zbMath1391.90503OpenAlexW2562459738WikidataQ56524200 ScholiaQ56524200MaRDI QIDQ1652250

Enrico Angelelli, Michele Vindigni, Claudia Archetti, Carlo Filippi

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.12.025

zbMATH Keywords

orienteering problemmatheuristicsstochastic routingprobabilistic TSPl-shaped method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items

The probabilistic travelling salesman problem with crowdsourcing ⋮ Boosting ant colony optimization via solution prediction and machine learning ⋮ Robust Team Orienteering Problem with Decreasing Profits ⋮ A dynamic and probabilistic orienteering problem ⋮ Solving the probabilistic profitable tour problem on a line ⋮ A revisited branch-and-cut algorithm for large-scale orienteering problems ⋮ The hazardous orienteering problem ⋮ An iterated local search for a multi‐period orienteering problem arising in a car patrolling application ⋮ An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem ⋮ A Tabu search algorithm for the probabilistic orienteering problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• A priori orienteering with time windows and stochastic wait times at customers
• Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
• A two-stage approach to the orienteering problem with stochastic weights
• An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
• The orienteering problem: a survey
• The orienteering problem with stochastic travel and service times
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Solving a generalized traveling salesperson problem with stochastic customers
• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
• Stochastic vehicle routing
• On the computational complexity of the probabilistic traveling salesman problem with deadlines
• On estimating the distribution of optimal traveling salesman tour lengths using heuristics
• A survey on matheuristics for routing problems
• Vehicle Routing
• Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Challenges and Advances in A Priori Routing
• The orienteering problem
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• The value of the stochastic solution in stochastic linear programs with fixed recourse
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Solving the Orienteering Problem through Branch-and-Cut
• Algorithms for a stochastic selective travelling salesperson problem
• Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• A Priori Optimization