Metaheuristics for the distance constrained generalized covering traveling salesman problem
From MaRDI portal
(Redirected from Publication:832809)
Recommendations
- Metaheuristics for the tabu clustered traveling salesman problem
- A GRAST/VNS metaheuristic for an approximate solution of the covering tour problem
- An empirical study of a new metaheuristic for the traveling salesman problem
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Approximation schemes for the generalized traveling salesman problem
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
- Metaheuristics based on decision hierarchies for the traveling purchaser problem
Cites work
- scientific article; zbMATH DE number 1390344 (Why is no real title available?)
- A branch-and-cut algorithm for the maximum covering cycle problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Expanding neighborhood GRASP for the traveling salesman problem
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- Heuristics for the multi-vehicle covering tour problem
- Solution of a Large-Scale Traveling-Salesman Problem
- The Covering Salesman Problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- Time constrained maximal covering salesman problem with weighted demands and partial coverage
Cited in
(3)- Optimizing hyperparameters in Hopfield neural networks using evolutionary search
- Modeling a humanitarian-aid covering tour problem with location selection and vehicle assignment decisions
- Location-allocation analysis of humanitarian distribution plans: a case of united nations humanitarian response depots
This page was built for publication: Metaheuristics for the distance constrained generalized covering traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832809)
