Maximizing the profit per unit of time for the TSP with convex resource-dependent travelling times
研究旅行商问题的一个扩展，其中旅行时间依赖于资源，目标是最大化单位时间利润。提出三步最优解法，计算总资源、构建路线并分配资源，计算复杂度与经典TSP相同。
This paper introduces a new problem that is an extension of the travelling salesman problem (TSP) in which the travelling times are resource dependent and the objective is to maximize the profit per unit of time. We present an optimal solution approach comprised of three main steps: (1) calculating the optimal amount of total resource required (regardless of the selected tour); (2) constructing the tour; and (3) assigning the optimal resource to each connection between vertices using the equivalent load method. This solution approach finds the optimal solution with the same computational complexity for solving the classic TSP.