The orienteering problem
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The attractive traveling salesman problem
- On symmetric subtour problems
- The team orienteering problem
- A fast and effective heuristic for the orienteering problem
- Minimum directed 1-subtree relaxation for score orienteering problem
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- A constant-factor approximation algorithm for the \(k\)-MST problem
- A heuristic for the multiple tour maximum collection problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- Strong linear programming relaxations for the orienteering problem
- A TSSP+1 decomposition strategy for the vehicle routing problem
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
- A tabu search heuristic for the undirected selective travelling salesman problem
- A matheuristic approach to the orienteering problem with service time dependent profits
- Shared capacity routing problem -- an omni-channel retail study
- The time constrained maximal covering salesman problem
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
- The probabilistic orienteering problem
- An efficient evolutionary algorithm for the orienteering problem
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
- Formulations for the orienteering problem with additional constraints
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- Application of fuzzy optimization to the orienteering problem
- Solving the stochastic time-dependent orienteering problem with time windows
- Solving the team orienteering arc routing problem with a column generation approach
- Attractive orienteering problem with proximity and timing interactions
- The set orienteering problem
- A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
- Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans
- A TABU search heuristic for the team orienteering problem
- Approximation algorithms for time-dependent orienteering.
- Using artificial neural networks to solve the orienteering problem
- Routing problems: A bibliography
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- Coupling ant colony systems with strong local searches
- A tabu search algorithm for the probabilistic orienteering problem
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
- The distance orientation problem
- The synchronized multi-assignment orienteering problem
- Optimal joint maintenance and orienteering strategy for complex mission-oriented systems: a case study in offshore wind energy
- The vacation planning problem: a multi-level clustering-based metaheuristic approach
- Faster algorithms for orienteering and \(k\)-TSP
- 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
- Algorithm selection for the team orienteering problem
- Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities
- Two-stage robust optimization for the orienteering problem with stochastic weights
- An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem
- An iterative three-component heuristic for the team orienteering problem with time windows
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics
- An approximation algorithm for vehicle routing with compatibility constraints
- An effective PSO-inspired algorithm for the team orienteering problem
- A fast solution method for the time-dependent orienteering problem
- A guided local search metaheuristic for the team orienteering problem
- The traveling group problem
- Evolution-inspired local improvement algorithm solving orienteering problem
- The time-dependent orienteering problem with time windows: a fast ant colony system
- Orienteering for electioneering
- A stabilized column generation scheme for the traveling salesman subtour problem
- A memetic algorithm for the orienteering problem with hotel selection
- Compact formulations of the Steiner traveling salesman problem and related problems
- Orienteering problem with time-windows and updating delay
- 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
- Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests
- Analysis of the selective traveling salesman problem with time-dependent profits
- A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles
- The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing
- The clustered orienteering problem
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
- Dynamic traveling repair problem with an arbitrary time window
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- Network repair crew scheduling and routing for emergency relief distribution problem
- Efficient meta-heuristics for the multi-objective time-dependent orienteering problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
- Single string planning problem arising in liner shipping industries: a heuristic approach
- The multi-district team orienteering problem
- A math-heuristic for the warehouse location-routing problem in disaster relief
- A two-stage approach to the orienteering problem with stochastic weights
- The dynamic multiperiod vehicle routing problem with probabilistic information
- Solving the orienteering problem with time windows via the pulse framework
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices
- Heuristics for the time dependent team orienteering problem: application to tourist route planning
- Time constrained maximal covering salesman problem with weighted demands and partial coverage
- scientific article; zbMATH DE number 4061010 (Why is no real title available?)
- An Optimal Algorithm for the Orienteering Tour Problem
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- A comparison of heuristics for the problem of batching orders for warehouse selection
- A simulated annealing heuristic for the team orienteering problem with time windows
- A Punt Returner Location Problem
- Approximation algorithms for the arc orienteering problem
- Modeling recreational systems using optimization techniques and information technologies
- The capacitated orienteering problem
- Formulation and a heuristic approach for the orienteering location-routing problem
This page was built for publication: The orienteering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3792511)
