English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The Clustered Traveling Salesman Problem (CTSP) is a variant of the popularTraveling Salesman Problem (TSP) arising from a number of real-lifeapplications. In this work, we explore a transformation approach that solvesthe CTSP by converting it to the well-studied TSP. For this purpose, we firstinvestigate a technique to convert a CTSP instance to a TSP and then applypowerful TSP solvers (including exact and heuristic solvers) to solve theresulting TSP instance. We want to answer the following questions: How dostate-of-the-art TSP solvers perform on clustered instances converted from theCTSP? Do state-of-the-art TSP solvers compete well with the best performingmethods specifically designed for the CTSP? For this purpose, we presentintensive computational experiments on various benchmark instances to drawconclusions.

Solving the Clustered Traveling Salesman Problem via TSP methods