The Generalized Covering Salesman Problem
From MaRDI portal
Publication:2815466
DOI10.1287/ijoc.1110.0480zbMath1462.90106MaRDI QIDQ2815466
Majid Salari, Zahra Naji-Azimi, Bruce L. Golden, Paolo Toth, S. Raghu Raghavan
Publication date: 29 June 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1110.0480
local searchheuristic algorithmsgeneralized traveling salesman problemcovering salesman problemgeneralized covering salesman problem
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
A generalized model and a heuristic algorithm for the large-scale covering tour problem, Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem, Randomized heuristics for the family traveling salesperson problem, Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility, A multi‐vehicle covering tour problem with speed optimization, Heuristic approaches for the family traveling salesman problem, The two‐echelon routing problem with truck and drones, The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods, The capacitated family traveling salesperson problem, Searching for a cycle with maximum coverage in undirected graphs, Time constrained maximal covering salesman problem with weighted demands and partial coverage, Solving the family traveling salesman problem, The time constrained maximal covering salesman problem, Solving the multi-vehicle multi-covering tour problem, Online covering salesman problem, A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands, An integer programming-based local search for the covering salesman problem, A parallel variable neighborhood search for solving covering salesman problem, A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak, Spatial coverage in routing and path planning problems, A branch-and-cut algorithm for the maximum covering cycle problem, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
Uses Software
Cites Work
- A random-key genetic algorithm for the generalized traveling salesman problem
- The selective travelling salesman problem
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Approximation algorithms for the Geometric Covering Salesman Problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- The traveling salesman problem and its variations
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- A tabu search algorithm for the single vehicle routing allocation problem
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- TSPLIB—A Traveling Salesman Problem Library
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- The Covering Tour Problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- The Covering Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
