The orienteering problem
From MaRDI portal
Publication:3792511
DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D" /><307::AID-NAV3220340302>3.0.CO;2-D 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-DzbMath0647.90099OpenAlexW2003281104MaRDI QIDQ3792511
Bruce L. Golden, Laurence S. Levy, Rakesh V. Vohra
Publication date: 1987
Full work available at URL: https://doi.org/10.1002/1520-6750(198706)34:3<307::aid-nav3220340302>3.0.co;2-d
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items (only showing first 100 items - show all)
The median tour and maximal covering tour problems: Formulations and heuristics ⋮ Strong linear programming relaxations for the orienteering problem ⋮ Faster algorithms for orienteering and \(k\)-TSP ⋮ A matheuristic approach to the orienteering problem with service time dependent profits ⋮ Shared capacity routing problem -- an omni-channel retail study ⋮ Iterated local search for the team orienteering problem with time windows ⋮ The clustered orienteering problem ⋮ A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ The time constrained maximal covering salesman problem ⋮ A TSSP+1 decomposition strategy for the vehicle routing problem ⋮ A guided local search metaheuristic for the team orienteering problem ⋮ 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 ⋮ 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 ⋮ Heuristic algorithms for visiting the customers in a rolling schedule environment ⋮ The traveling group problem ⋮ 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 ⋮ 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 ⋮ Time constrained maximal covering salesman problem with weighted demands and partial coverage ⋮ Using artificial neural networks to solve the orienteering problem ⋮ Routing problems: A bibliography ⋮ Algorithm selection for the team orienteering problem ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ The time-dependent orienteering problem with time windows: a fast ant colony system ⋮ Orienteering problem with time-windows and updating delay ⋮ Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities ⋮ 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 ⋮ The team orienteering problem with time windows: an LP-based granular variable neighborhood search ⋮ Coupling ant colony systems with strong local searches ⋮ Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems ⋮ The orienteering problem: a survey ⋮ Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests ⋮ Formulations for the orienteering problem with additional constraints ⋮ On the adaptivity gap of stochastic orienteering ⋮ Hybridized evolutionary local search algorithm for the team orienteering problem with time windows ⋮ A stabilized column generation scheme for the traveling salesman subtour problem ⋮ Dynamic Traveling Repair Problem with an Arbitrary Time Window ⋮ The selective travelling salesman problem ⋮ A simulated annealing heuristic for the team orienteering problem with time windows ⋮ A unified matheuristic for solving multi-constrained traveling salesman problems with profits ⋮ 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 ⋮ Two-stage robust optimization for the orienteering problem with stochastic weights ⋮ Approximation algorithms for the arc orienteering problem ⋮ Modeling recreational systems using optimization techniques and information technologies ⋮ An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem ⋮ The capacitated orienteering problem ⋮ Mixed-integer programming approaches for the time-constrained maximal covering routing problem ⋮ 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 ⋮ A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints ⋮ Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming ⋮ On symmetric subtour problems ⋮ An iterative three-component heuristic for the team orienteering problem with time windows ⋮ Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans ⋮ A TABU search heuristic for the team orienteering problem ⋮ The directed orienteering problem ⋮ The effective application of a new approach to the generalized orienteering problem ⋮ A path relinking approach for the team orienteering problem ⋮ 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 ⋮ A Tabu search algorithm for the probabilistic orienteering problem ⋮ A memetic algorithm for the orienteering problem with hotel selection ⋮ An approximation algorithm for vehicle routing with compatibility constraints ⋮ The team orienteering problem ⋮ A fast and effective heuristic for the orienteering problem ⋮ The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing ⋮ Minimum directed 1-subtree relaxation for score orienteering problem ⋮ Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach ⋮ The attractive traveling salesman problem ⋮ An efficient composite heuristic for the symmetric generalized traveling salesman problem ⋮ The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm ⋮ A constant-factor approximation algorithm for the \(k\)-MST problem ⋮ The synchronized multi-assignment orienteering problem ⋮ Approximation algorithms for time-dependent orienteering. ⋮ 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 ⋮ A heuristic for the multiple tour maximum collection problem ⋮ Compact formulations of the Steiner traveling salesman problem and related problems ⋮ A tabu search heuristic for the undirected selective travelling salesman problem ⋮ An effective PSO-inspired algorithm for the team orienteering problem ⋮ A fast solution method for the time-dependent orienteering problem
This page was built for publication: The orienteering problem
