优化模型验证关键代码06：多行程旅行商问题(mTSP)

参考文献：Bektas, T. (2006). The multiple traveling salesman problem: an overview of formulations and solution procedures. omega, 34(3), 209-219.

问题描述

The mTSP can in general be defined as follows:

• Given a set of nodes, let there be m salesmen located at a single depot node. The remaining nodes (cities) that are to be visited are called intermediate nodes.
• The mTSP consists of finding tours for all m salesmen, who all start and end at the depot, such that each intermediate node is visited exactly once and the total cost of visiting all nodes is minimized. 【mTSP包含多个旅行商】
• The cost metric can be defined in terms of distance, time, etc.

基于分配的整数规划模型

定义二进制决策变量：