A tabu search heuristic for the undirected selective travelling salesman problem

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

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

Publication date: 18 August 2002

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

zbMATH Keywords

tabu search heuristicselective travelling salesman problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Search theory (90B40) Combinatorial optimization (90C27)

Related Items (30)

A matheuristic approach to the orienteering problem with service time dependent profits ⋮ Iterated local search for the team orienteering problem with time windows ⋮ The clustered orienteering problem ⋮ Classification, models and exact algorithms for multi-compartment delivery problems ⋮ Tabu search for the real-world carpooling problem ⋮ A guided local search metaheuristic for the team orienteering problem ⋮ Efficient meta-heuristics for the multi-objective time-dependent orienteering problem ⋮ Solving the orienteering problem with time windows via the pulse framework ⋮ An efficient evolutionary algorithm for the orienteering problem ⋮ Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem ⋮ AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands ⋮ Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows ⋮ The vehicle routing problem with service level constraints ⋮ The orienteering problem: a survey ⋮ A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment ⋮ Hybridized evolutionary local search algorithm for the team orienteering problem with time windows ⋮ Hybrid genetic algorithm for undirected traveling salesman problems with profits ⋮ An iterated local search for a multi‐period orienteering problem arising in a car patrolling application ⋮ A unified matheuristic for solving multi-constrained traveling salesman problems with profits ⋮ Multi-objective meta-heuristics for the traveling salesman problem with profits ⋮ A TABU search heuristic for the team 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 ⋮ A two-stage vehicle routing model for large-scale bioterrorism emergencies ⋮ A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP ⋮ The attractive traveling salesman problem ⋮ A fast solution method for the time-dependent orienteering problem

Cites Work

• 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
• 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

This page was built for publication: A tabu search heuristic for the undirected selective travelling salesman problem