Heuristics for a cash-collection routing problem with a cluster-first route-second approach

DOI10.1007/s10479-022-04883-1zbMath1512.90202MaRDI QIDQ6099456

Sergey Ivliev, Lena Oberfichtner, Bismark Singh

Publication date: 20 June 2023

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsclusteringapproximationstraveling salesman problemdecision analysisopen-source solvers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimating the Number of Clusters in a Data Set Via the Gap Statistic
• An exact algorithm for the clustered travelling salesman problem
• A random-key genetic algorithm for the generalized traveling salesman problem
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
• A cluster-first route-second approach for the swap body vehicle routing problem
• The effect of the asymmetry of road transportation networks on the traveling salesman problem
• An improved ant system algorithm for the vehicle routing problem
• Routing problems: A bibliography
• Genetic algorithms for the traveling salesman problem
• A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• The approximation ratio of the 2-Opt heuristic for the metric traveling salesman problem
• Integer Programming Formulation of Traveling Salesman Problems
• Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
• Finding Groups in Data
• Fast Algorithms for Geometric Traveling Salesman Problems
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• The symmetric generalized traveling salesman polytope
• A Method for Solving Traveling-Salesman Problems
• The Traveling Salesman Problem: A Survey
• Computational Experience with an M-Salesman Traveling Salesman Algorithm
• Data Mining and Knowledge Discovery Handbook