改进匈牙利法求解货郎担问题(TSP)  

Improved Hungarian Method to Solve Seller's Burden Problem

作　　者：黄潇 吕柏权[1] 张有得 

机构地区：[1]上海大学机电工程与自动化学院,上海200444

出　　处：《工业控制计算机》2022年第5期112-114,共3页Industrial Control Computer

摘　　要：提出了一个改进匈牙利法,给出了数学推导,以Hamilton回路选独立零,并给出终止条件,通过二个例子,与C-W节约算法和几何法比较,提出的方法精度比高。In this paper,an improved Hungarian method is presented,the mathematical derivation is given,the independent zero is selected from Hamilton loop.The termination condition is given in this paper.Through two examples,the proposed method has higher accuracy than the C-W saving algorithm and the geometric method.

关 键 词：TSP 匈牙利法 几何法 C-W节约算法 

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