启发式匈牙利法求解货郎担问题  

Heuristic Hungarian Method to Solve the Traveling Salesman Problem

作　　者：徐晨 廖阳[1] XU Chen;LIAO Yang(College of Management, Xi＇an University of Architecture and Technology, Xi＇an 710055, China)

机构地区：[1]西安建筑科技大学管理学院

出　　处：《数学的实践与认识》2018年第2期114-118,共5页Mathematics in Practice and Theory

摘　　要：针对利用动态规划求解货郎担问题的复杂难度，提出了启发式匈牙利法求解，给出了它的算法步骤及时间复杂度分析，并通过实例具体描述了启发式匈牙利法求解的过程，发现能够较快地找到最优方案，算法具有一定的实用性．For complex difficulty of using dynamic programming to solve the traveling salesman problem, put forward the heuristic Hungary method, gives its algorithm steps and time complexity analysis, and through the instance description the heuristic Hungarian method solving process, found that can rapidly find the optimal solution, this algorithm has certain practicality.

关 键 词：指派问题 匈牙利解法 货郎担问题 对角调整 

分 类 号：O22[理学—运筹学与控制论]