论文标题
优化加权旅行销售人员问题和旅行小偷问题的旅行：解决方案的结构比较
Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions
论文作者
论文摘要
旅行销售人员问题（TSP）是最著名的组合优化问题之一。但是，许多实际问题由几个相互作用的组件组成。旅行小偷问题（TTP）通过结合两个组合优化问题，即TSP和背包问题（KP）来解决此类相互作用。最近，引入了一个称为节点依赖的旅行销售人员问题（W-TSP）的新问题，其中节点的权重影响了旅行的成本。在本文中，我们比较W-TSP和TTP。我们研究了W-TSP和TTP的优化游览的结构，以及使用适应性功能的彼此的影响。我们的实验结果表明（1）与最佳TSP或最佳TSP或加权贪婪溶液相比，最终W-TSP和TTP溶液通常可以通过TTP健身函数更好地求解W-TSP。
The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial optimisation problems. However, many real-world problems are composed of several interacting components. The Traveling Thief Problem (TTP) addresses such interactions by combining two combinatorial optimisation problems, namely the TSP and the Knapsack Problem (KP). Recently, a new problem called the node weight dependent Traveling Salesperson Problem (W-TSP) has been introduced where nodes have weights that influence the cost of the tour. In this paper, we compare W-TSP and TTP. We investigate the structure of the optimised tours for W-TSP and TTP and the impact of using each others fitness function. Our experimental results suggest (1) that the W-TSP often can be solved better using the TTP fitness function and (2) final W-TSP and TTP solutions show different distributions when compared with optimal TSP or weighted greedy solutions.
