物流运输系统货郎问题算法及应用  

Optimizational Algorithms for Travelling Salesman Problem and Application in Logistics Transportation System

作　　者：程学华[1] 张乃书[2] 詹小旦[1] 

机构地区：[1]安徽三联学院,合肥230601 [2]安徽经济干部管理学院,合肥230059

出　　处：《人类工效学》2011年第2期42-46,共5页Chinese Journal of Ergonomics

摘　　要：针对物流运输系统运送时间与运输成本问题,本文对运筹学领域货郎问题的算法进行了探讨,比较了货郎问题的匈牙利算法、填数破圈算法及填数破圈表上作业算法三种算法,通过矩阵变换,对各种算法作了分析并加以改进优化。结合实例应用,结果提示解决物流货郎问题更简便适用的方法是填数破圈算法。To reduce delivery time and costs of logistics transportation systems,the algorithm for Travelling Salesman Problem（TSP） in the field of Operational Research is discussed.Three algorithms as Hungarian＇s algorithm,Infilling Number Breaking Circle algorithm and Table algorithm of Infilling Number Breaking Circle are compared,and every algorithm is analysed and optimized by matrix counterchanging.With example of application,it suggested that Infilling Number Breaking Circle algorithm is more handy and applicable for TSP in logistics transportation systems.

关 键 词：物流 货郎问题 匈牙利算法 填数破圈算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]