A TABU search heuristic for the team orienteering problem

DOI10.1016/j.cor.2003.11.008zbMath1122.90434OpenAlexW2078256564MaRDI QIDQ1764755

Hao Tang, Elise D. Miller-Hooks

Publication date: 22 February 2005

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

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

zbMATH Keywords

Tabu SearchAdaptive Memory ProcedureMultiple Tour Maximum Collection ProblemSelective TSPTeam Orienteering Problem (TOP)

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (52)

The multi-vehicle profitable pickup and delivery problem ⋮ A matheuristic approach to the orienteering problem with service time dependent profits ⋮ Iterated local search for the team orienteering problem with time windows ⋮ A guided local search metaheuristic for the team orienteering problem ⋮ The selective vehicle routing problem in a collaborative environment ⋮ Adaptive memory programming for the vehicle routing problem with multiple trips ⋮ Efficient meta-heuristics for the multi-objective time-dependent orienteering problem ⋮ Heuristic algorithms for visiting the customers in a rolling schedule environment ⋮ The multi-district team orienteering problem ⋮ Solving the orienteering problem with time windows via the pulse framework ⋮ Managing platelet supply through improved routing of blood collection vehicles ⋮ A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints ⋮ An efficient evolutionary algorithm for the orienteering problem ⋮ Solving the team orienteering problem with cutting planes ⋮ Algorithm selection for the team orienteering problem ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ The orienteering problem with variable profits ⋮ The capacitated team orienteering problem with incomplete service ⋮ 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 ⋮ Column generation based heuristics for a generalized location routing problem with profits arising in space exploration ⋮ Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ The orienteering problem: a survey ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ Formulations for the orienteering problem with additional constraints ⋮ Solving the team orienteering problem with nonidentical agents: A Lagrangian approach ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ Hybridized evolutionary local search algorithm for the team orienteering problem with time windows ⋮ A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem ⋮ A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application ⋮ A simulated annealing heuristic for the team orienteering problem with time windows ⋮ The capacitated orienteering problem ⋮ Challenges and Advances in A Priori Routing ⋮ 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 ⋮ An exact algorithm for team orienteering problems ⋮ Local search for the undirected capacitated arc routing problem with profits ⋮ 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 memetic algorithm for the team orienteering problem ⋮ A path relinking approach for the team orienteering problem ⋮ The undirected capacitated arc routing problem with profits ⋮ A Tabu search algorithm for the probabilistic orienteering problem ⋮ Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem ⋮ Heuristics for the multi-period orienteering problem with multiple time windows ⋮ The split delivery capacitated team orienteering problem ⋮ Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers ⋮ An effective PSO-inspired algorithm for the team orienteering problem ⋮ A memetic algorithm for the multiperiod vehicle routing problem with profit ⋮ Data-Driven Robust Resource Allocation with Monotonic Cost Functions

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The selective travelling salesman problem
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• The team orienteering problem
• A fast and effective heuristic for the orienteering problem
• A tabu search heuristic for the heterogeneous fleet vehicle routing problem
• A tabu search algorithm for the vehicle routing problem
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• A heuristic for the multiple tour maximum collection problem
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• Variable neighborhood search
• A tabu search heuristic for the undirected selective travelling salesman problem
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
• Semi-greedy heuristics: An empirical study
• Future paths for integer programming and links to artificial intelligence
• Probabilistic diversification and intensification in local search for vehicle routing
• The orienteering problem
• Tabu Search—Part I
• Tabu Search—Part II
• An Optimal Algorithm for the Orienteering Tour Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• Solving the Orienteering Problem through Branch-and-Cut
• A heuristic column generation method for the heterogeneous fleet VRP
• A Tabu Search Heuristic for the Vehicle Routing Problem
• The Distribution Problem with Carrier Service: A Dual Based Penalty Approach
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Adaptive memory programming: a unified view of metaheuristics

This page was built for publication: A TABU search heuristic for the team orienteering problem