Orienteering problem: a survey of recent variants, solution approaches and applications

DOI10.1016/j.ejor.2016.04.059zbMath1346.90703OpenAlexW2346699423MaRDI QIDQ323527

Hoong Chuin Lau, Aldy Gunawan, Pieter Vansteenwegen

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://ink.library.smu.edu.sg/sis_research/3271

zbMATH Keywords

surveyschedulingorienteering problempractical applications

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (84)

Faster algorithms for orienteering and \(k\)-TSP ⋮ A matheuristic approach to the orienteering problem with service time dependent profits ⋮ A stochastic programming model for a tactical solid waste management problem ⋮ An iterated local search algorithm for the team orienteering problem with variable profits ⋮ Boosting ant colony optimization via solution prediction and machine learning ⋮ Time dependent orienteering problem with time windows and service time dependent profits ⋮ UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections ⋮ Selective generalized travelling salesman problem ⋮ An efficient evolutionary algorithm for the orienteering problem ⋮ A profit-maximization location-routing-pricing problem: a branch-and-price algorithm ⋮ Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem ⋮ An integrated routing and scheduling problem for home healthcare delivery with limited person-to-person contact ⋮ Algorithm selection for the team orienteering problem ⋮ The time-dependent orienteering problem with time windows: a fast ant colony system ⋮ Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities ⋮ Team Orienteering with Time-Varying Profit ⋮ Ants can orienteer a thief in their robbery ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows ⋮ A reinforcement learning approach to the orienteering problem with time windows ⋮ Selective routing problem with synchronization ⋮ A dynamic and probabilistic orienteering problem ⋮ Branch-and-check approaches for the tourist trip design problem with rich constraints ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ A decomposition approach for the stochastic asset protection problem ⋮ Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems ⋮ The time-dependent capacitated profitable tour problem with time windows and precedence constraints ⋮ Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem ⋮ Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests ⋮ Multi-period location routing: an application to the planning of mobile clinic operations in Iraq ⋮ Formulations for the orienteering problem with additional constraints ⋮ Combining incomplete search and clause generation: an application to the orienteering problems with time windows ⋮ Solving the team orienteering problem with nonidentical agents: A Lagrangian approach ⋮ Rough approximation-based approach for designing a personalized tour route under a fuzzy environment ⋮ Large neighborhood search for the bike request scheduling problem ⋮ Variable neighborhood search to solve the generalized orienteering problem ⋮ Clustered coverage orienteering problem of unmanned surface vehicles for water sampling ⋮ GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows ⋮ Solving the probabilistic profitable tour problem on a line ⋮ A revisited branch-and-cut algorithm for large-scale orienteering problems ⋮ A lexicographic maximin approach to the selective assessment routing problem ⋮ Planning robust drone-truck delivery routes under road traffic uncertainty ⋮ A new MILP formulation for the flying sidekick traveling salesman problem ⋮ A data-driven optimization framework for routing mobile medical facilities ⋮ An iterated local search for a multi‐period orienteering problem arising in a car patrolling application ⋮ Decision support for the technician routing and scheduling problem ⋮ A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs ⋮ A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application ⋮ Flexible vehicle scheduling with precedence constraints for tourists ⋮ Analysis of the selective traveling salesman problem with time-dependent profits ⋮ Two-stage robust optimization for the orienteering problem with stochastic weights ⋮ Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants ⋮ An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem ⋮ On path-bridge inequalities for the orienteering arc routing problems ⋮ \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources ⋮ Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations ⋮ Mixed-integer programming approaches for the time-constrained maximal covering routing problem ⋮ Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand ⋮ A general framework for assessing the value of social data for disaster response logistics planning ⋮ Solving the team orienteering arc routing problem with a column generation approach ⋮ Attractive orienteering problem with proximity and timing interactions ⋮ The set orienteering problem ⋮ The vehicle routing problem with profits and consistency constraints ⋮ The clustered team orienteering problem ⋮ \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem ⋮ Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem ⋮ Prioritized single nurse routing and scheduling for home healthcare services ⋮ A biased random-key genetic algorithm for the set orienteering problem ⋮ Modeling and solving the multimodal car- and ride-sharing problem ⋮ A multi-period analysis of the integrated item-sharing and crowdshipping problem ⋮ Single-machine scheduling with release times, deadlines, setup times, and rejection ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers ⋮ The multi-visit team orienteering problem with precedence constraints ⋮ A greedy randomized adaptive search procedure for the orienteering problem with hotel selection ⋮ Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory ⋮ Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers ⋮ Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach ⋮ Spatial coverage in routing and path planning problems ⋮ Robust drone selective routing in humanitarian transportation network assessment ⋮ Fairness in ambulance routing for post disaster management ⋮ The synchronized multi-assignment orienteering problem ⋮ Solving the traveling delivery person problem with limited computational time ⋮ New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
• The clustered orienteering problem
• A priori orienteering with time windows and stochastic wait times at customers
• A matheuristic for the team orienteering arc routing problem
• The multi-district team orienteering problem
• A two-stage approach to the orienteering problem with stochastic weights
• Solving the orienteering problem with time windows via the pulse framework
• A branch-and-cut algorithm for the orienteering arc routing problem
• The capacitated team orienteering problem with incomplete service
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• A simulated annealing heuristic for the team orienteering problem with time windows
• Approximation algorithms for the arc orienteering problem
• A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts
• The orienteering problem: a survey
• The orienteering problem with stochastic travel and service times
• Heuristics for the multi-period orienteering problem with multiple time windows
• Iterated local search for the team orienteering problem with time windows
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• A memetic algorithm for the team orienteering problem
• The effective application of a new approach to the generalized orienteering problem
• The attractive traveling salesman problem
• The fleet size and mix problem for capacitated arc routing
• The team orienteering problem
• A fast and effective heuristic for the orienteering problem
• Approximation algorithms for time-dependent orienteering.
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Coupling ant colony systems with strong local searches
• Optimal solutions for routing problems with profits
• The capacitated team orienteering problem: a bi-level filter-and-fan method
• An iterative three-component heuristic for the team orienteering problem with time windows
• An effective PSO-inspired algorithm for the team orienteering problem
• A fast solution method for the time-dependent orienteering problem
• An exact algorithm for team orienteering problems
• A memetic algorithm for the orienteering problem with hotel selection
• The split delivery capacitated team orienteering problem
• Optimization Approaches for Solving Chance Constrained Stochastic Orienteering Problems
• Exploiting Tabu Search Memory in Constrained Problems
• The Team Orienteering Problem: Formulations and Branch-Cut and Price
• Vehicle Routing
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
• The capacitated team orienteering and profitable tour problems
• Integer Programming Formulation of Traveling Salesman Problems
• Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
• Locating a cycle in a transportation or a telecommunications network
• The orienteering problem
• The Orienteering Problem with Time Windows
• TSPLIB—A Traveling Salesman Problem Library
• Solving the Orienteering Problem through Branch-and-Cut
• Generalized orienteering problem with resource dependent rewards
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• A Fictitious Play Approach to Large-Scale Optimization
• The orienteering problem with variable profits
• A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
• Ejection chain and filter-and-fan methods in combinatorial optimization

This page was built for publication: Orienteering problem: a survey of recent variants, solution approaches and applications