Metaheuristics for the distance constrained generalized covering traveling salesman problem

DOI10.1007/s12597-020-00503-3OpenAlexW3124319046MaRDI QIDQ832809

Prashant Singh, Ajinkya N. Tanksale, Ankush R. Kamthane

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

zbMATH Keywords

GRASPtravelling salesman problemant colony optimizationhumanitarian logisticscovering salesman problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Location-allocation analysis of humanitarian distribution plans: a case of united nations humanitarian response depots

Cites Work

• Unnamed Item
• 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 probabilistic heuristic for a computationally difficult set covering problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• Heuristics for the multi-vehicle covering tour problem
• A branch-and-cut algorithm for the maximum covering cycle problem
• Expanding neighborhood GRASP for the traveling salesman problem
• The Covering Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem