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

DOI10.3934/MBE.2022206MaRDI QIDQ2086823zbMATH OpenOpenAlexFDO

Authors Hui Li, Mengyao Zhang, Chenbo Zeng

Publication date 26 October 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Jaccard distancemetaheuristicsmulti-solution optimizationmultimodal optimizationtraveling salesman problem

Mathematics Subject Classification ID

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

Cites work

• 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
• A method for solving traveling-salesman problems
• A Survey of the Generalized Assignment Problem and Its Applications
• Improving TSP Tours Using Dynamic Programming over Tree Decompositions
• Measuring and testing dependence by correlation of distances
• Multimodal optimization using whale optimization algorithm enhanced with local search and niching technique
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
• The traveling salesman problem: An overview of exact and approximate algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2086823)