A New Multiperiod Multiple Traveling Salesman Problem with Heuristic and Application to a Scheduling Problem
提出了一种新的多周期多旅行商问题变体，用于优化旅游行业展会上经纪人与供应商的访谈调度，并给出了多项式时间的启发式解法。
ABSTRACT A new multiperiod variation of the M ‐traveling salesman problem is introduced. The problem arises in efficient scheduling of optimal interviews among tour brokers and vendors at conventions of the tourism and travel industry. In classical traveling salesman problem vocabulary, a salesman is a tour broker at the convention and a city is a vendor's booth. In this problem, more than one salesman may be required to visit a city, but at most one salesman per time period can visit each city. The heuristic solution method presented is polynomial and is guaranteed to produce a nonconflicting set of salesmen's tours. The results of an implementation of the method for a recent convention are also reported.