Circular Jaccard distance based multi-solution optimization for traveling salesman problems

DOI10.3934/mbe.2022206zbMath1505.90105OpenAlexW4224271060MaRDI QIDQ2086823

Mengyao Zhang, Chenbo Zeng, Hui Li

Publication date: 26 October 2022

Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/mbe.2022206

zbMATH Keywords

metaheuristicstraveling salesman problemmultimodal optimizationJaccard distancemulti-solution optimization

Mathematics Subject Classification ID

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

Cites Work

• Measuring and testing dependence by correlation of distances
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A cutting plane procedure for the travelling salesman problem on road networks
• The traveling salesman problem: An overview of exact and approximate algorithms
• Multimodal optimization using whale optimization algorithm enhanced with local search and niching technique
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
• Improving TSP Tours Using Dynamic Programming over Tree Decompositions
• A Method for Solving Traveling-Salesman Problems
• A Survey of the Generalized Assignment Problem and Its Applications

This page was built for publication: Circular Jaccard distance based multi-solution optimization for traveling salesman problems