CAJ | 학술논문

多旅行商问题(Multiple Traveling Salesperson Problem,简称MTSP)是讨论m住旅行商如何访问n座城市,要求每个城市都被访问,且仅被访问一次,求得所有旅行商经过的路径和最小.本文通过对MTSP特点的分析,依据遗传算法的基本思想,对编码和遗传算子进行合理选取.通过仿真表明,该优化方法能够取得较优解.
다여행상문제(Multiple Traveling Salesperson Problem,간칭MTSP)시토론m주여행상여하방문n좌성시,요구매개성시도피방문,차부피방문일차,구득소유여행상경과적로경화최소.본문통과대MTSP특점적분석,의거유전산법적기본사상,대편마화유전산자진행합리선취.통과방진표명,해우화방법능구취득교우해.
The Multiple Traveling Salesperson Problem is to discuss how m salespersons to visit a set of n locations, each of them is visited exactly only once while minimizing the total distance traveled by the salesperson. This paper analyzes the feature of MTSP, based on the basic idea of Genetic Algorithm, which selects the reasonable coding and genetic operators. The experimental results show that we can obtain a good solution from this method.