A TABU search heuristic for the team orienteering problem
type: Item
instance of: scholarly article
title: A TABU search heuristic for the team orienteering problem
zbMATH Open document ID: 1122.90434
author: Hao Tang
author: Elise Miller-Hooks
published in: Computers \& Operations Research
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2136903
zbMATH Keywords: Team Orienteering Problem (TOP)
zbMATH Keywords: Multiple Tour Maximum Collection Problem
zbMATH Keywords: Tabu Search
zbMATH Keywords: Adaptive Memory Procedure
zbMATH Keywords: Selective TSP
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2003.11.008
OpenAlex ID: W2078256564
cites work: The orienteering problem
cites work: The team orienteering problem
cites work: A heuristic for the multiple tour maximum collection problem
cites work: The Distribution Problem with Carrier Service: A Dual Based Penalty Approach
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: An optimal solution procedure for the multiple tour maximum collection problem using column generation
cites work: The selective travelling salesman problem
cites work: An Optimal Algorithm for the Orienteering Tour Problem
cites work: Solving the Orienteering Problem through Branch-and-Cut
cites work: Q4540081
cites work: Q3795496
cites work: A fast and effective heuristic for the orienteering problem
cites work: A tabu search heuristic for the undirected selective travelling salesman problem
cites work: Q4205235
cites work: Q4955265
cites work: Q4532228
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: A tabu search heuristic for the heterogeneous fleet vehicle routing problem
cites work: Adaptive memory programming: a unified view of metaheuristics
cites work: Q4352217
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A tabu search algorithm for the vehicle routing problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Variable neighborhood search
cites work: A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
cites work: Semi-greedy heuristics: An empirical study
cites work: A heuristic column generation method for the heterogeneous fleet VRP
DOI: 10.1016/J.COR.2003.11.008
description: scientific article; zbMATH DE number 2136903