Metaheuristics for the distance constrained generalized covering traveling salesman problem
From MaRDI portal
Publication:832809
DOI10.1007/S12597-020-00503-3OpenAlexW3124319046MaRDI QIDQ832809FDOQ832809
Authors: Prashant Singh, Ankush R. Kamthane, Ajinkya N. Tanksale 
Publication date: 25 March 2022
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-020-00503-3
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
ant colony optimizationtravelling salesman problemhumanitarian logisticsGRASPcovering salesman problem
Cites Work
- Title not available (Why is that?)
- Expanding neighborhood GRASP for the traveling salesman problem
- Solution of a Large-Scale Traveling-Salesman Problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- A probabilistic heuristic for a computationally difficult set covering problem
- Heuristics for the multi-vehicle covering tour problem
- The Covering Salesman Problem
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- Time constrained maximal covering salesman problem with weighted demands and partial coverage
- A branch-and-cut algorithm for the maximum covering cycle problem
Cited In (2)
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)
