A tabu search heuristic for the undirected selective travelling salesman problem

DOI10.1016/S0377-2217(97)00289-0zbMath0991.90103MaRDI QIDQ1609914

Michel Gendreau, Gilbert Laporte, Frédéric Semet

Publication date: 18 August 2002

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

zbMATH Keywords

tabu search heuristic; selective travelling salesman problem

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B40: Search theory

90C27: Combinatorial optimization

Related Items

AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES, Iterated local search for the team orienteering problem with time windows, Multi-objective meta-heuristics for the traveling salesman problem with profits, The attractive traveling salesman problem, A TABU search heuristic for the team orienteering problem, A guided local search metaheuristic for the team orienteering problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The selective travelling salesman problem
• Algorithms to solve the orienteering problem: A comparison
• Using artificial neural networks to solve the orienteering problem
• Formules de réactualisation pour une famille d'indices de proximité inter-classe en classification hiérarchique
• An Optimal Algorithm for the Orienteering Tour Problem
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem