In this paper, a generalization of a traffic problem is discussed.It has been proved that this problem is equivalent to a problem of permutation optimization.

• 摘要研究一个车队探险问题的推广，证明了这个问题等价于一个置换极值问题，得到了最优解的一组必要条件。