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/

Zendy Plus

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

Zendy Tools

Zendy Open

The Traveling Salesperson Problem (TSP) is one of the best-knowncombinatorial optimisation problems. However, many real-world problems arecomposed of several interacting components. The Traveling Thief Problem (TTP)addresses such interactions by combining two combinatorial optimisationproblems, namely the TSP and the Knapsack Problem (KP). Recently, a new problemcalled the node weight dependent Traveling Salesperson Problem (W-TSP) has beenintroduced where nodes have weights that influence the cost of the tour. Inthis paper, we compare W-TSP and TTP. We investigate the structure of theoptimised tours for W-TSP and TTP and the impact of using each others fitnessfunction. Our experimental results suggest (1) that the W-TSP often can besolved better using the TTP fitness function and (2) final W-TSP and TTPsolutions show different distributions when compared with optimal TSP orweighted greedy solutions.

Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions