The generalized covering salesman problem

DOI10.1287/IJOC.1110.0480MaRDI QIDQ2815466zbMATH OpenOpenAlexFDO

Authors Bruce Golden, Zahra Naji-Azimi, Majid Salari, Paolo Toth, S. 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

zbMATH Keywords

covering salesman problemgeneralized covering salesman problemgeneralized traveling salesman problemheuristic algorithmslocal search

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The Covering Salesman Problem
• An integer programming-based local search for the covering salesman problem
• Online covering salesman problem
• The Covering Tour Problem
• Solving the multi-vehicle multi-covering tour problem

Cites work

• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A random-key genetic algorithm for the generalized traveling salesman problem
• A tabu search algorithm for the single vehicle routing allocation problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• Approximation algorithms for the Geometric Covering Salesman Problem
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• The Covering Salesman Problem
• The Covering Tour Problem
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
• The selective travelling salesman problem
• The traveling salesman problem and its variations
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(38)

• 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
• The multiple traveling salesman problem with backup coverage
• The cardinality constrained covering traveling 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
• Maximal covering salesman problems with average travelling cost constraints
• A branch-and-cut algorithm for the maximum covering cycle problem
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• Searching for a cycle with maximum coverage in undirected graphs
• Time constrained maximal covering salesman problem with weighted demands and partial coverage
• scientific article; zbMATH DE number 2000148 (Why is no real title available?)
• 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
• The Covering Salesman 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
• A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations
• Modeling a humanitarian-aid covering tour problem with location selection and vehicle assignment decisions
• A synchronized vessel and autonomous vehicle model for environmental monitoring: mixed integer linear programming model and adaptive matheuristic
• Survivable two-fault-tolerant ring star problem
• Exact algorithms and heuristics for the capacitated covering salesman problem
• A survey on the traveling salesman problem and its variants in a warehousing context
• A unifying framework for selective routing problems
• Covering tour problem with varying coverage: application to marine environmental monitoring
• Solving the family traveling salesman problem
• The covering tour problem with path upgrades
• Optimizing the traveling salesman problem with hybrid GFlowNets and genetic algorithms
• Multi-period heterogeneous fleet vehicle routing problem with self-pickup point selection: a last-mile delivery scenario in urban and rural areas

Describes a project that uses

Uses Software

• VRP
• CPLEX
• LKH
• TSPLIB

This page was built for publication: The generalized covering salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815466)