摘要
讨论并求解了一道求最佳巡视路线的实际问题.归结为图论中的多旅行商问题,通过较为合理的"人造顶点"分区方式将其转化为多个单旅行商问题,通过几种近似的方法求解单旅行商问题,得到了在限定组数或时间的条件下的分组及巡视路线的较优方案.
This thesis discussed and solved an actual problem,'Finding the best touring route'.Firstly it abstracted the problem to a 'maths model'by neglecting the secondary factors,and transformed it to a MTSP (Multi Traveling Salesman Problem) in Graph theory.Then it divided the problem into several TSP (Travelling Salesman Problem) by a reasonable artificial areas dividing method.Finally,it solved the TSP with several approximate methods and achieved better plans of dividing the area and the touring routes,limited by factors of the time or the amount of the dividing.
出处
《沈阳师范大学学报（自然科学版）》
CAS
2003年第3期177-180,共4页
Journal of Shenyang Normal University:Natural Science Edition
