This paper introduces the selective traveling salesman problem with draft limits, an extension of the traveling salesman problem with draft limits, wherein the goal is to design a maximum profit tour respecting draft limit constraints at the visited nodes. We propose a mixed integer linear programming (MILP) formulation for this problem. This MILP model is used to solve—to optimality—small size instances and to assess the quality of solutions obtained using a general variable neighborhood search heuristic that explores several neighborhood structures. Our extensive computational experiments confirm the efficiency of the method and the quality of the reported solutions.

中文翻译：

---

具有草稿限额的选择性旅行推销员问题

本文介绍了具有草稿限制的选择性旅行推销员问题，是具有草稿限制的旅行推销员问题的扩展，其中目标是设计一个在被访问节点上考虑草稿限制的最大利润之旅。我们针对此问题提出了混合整数线性规划（MILP）公式。该MILP模型用于求解（最小化）最优实例，并评估使用探索多个邻域结构的通用变量邻域搜索启发式方法获得的解决方案的质量。我们广泛的计算实验证实了该方法的效率和所报告解决方案的质量。