The balanced traveling salesmanproblem
The balanced traveling salesmanproblem
复制标题
平衡旅行商问题
DOI：
10.1016/j.cor.2010.09.016
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Abraham P. Punnen
中科院分区：
文献类型：
--
作者：
John Larusic;Abraham P. Punnen
在本文中，我们介绍了平衡旅行商问题（BTSP），它可以用来模拟资源的公平分配是重要的优化问题。BTSP显然是NP难的。有效的启发式算法来解决这个问题，沿着广泛的计算结果使用基准问题从TSPLIB和随机的情况。我们的算法产生了几个测试实例的可证明的最佳解决方案。并讨论了该模型在解决航空发动机维修中的喷管导向叶片装配问题中的应用。
In this paper we introduce the balanced traveling salesman problem (BTSP), which can be used to model optimization problems where equitable distribution of resources are important. BTSP is obviously NP-hard. Efficient heuristic algorithms are presented to solve the problem along with extensive computational results using benchmark problems from TSPLIB and random instances. Our algorithms produced provably optimal solutions for several test instances. Application of the model in solving the nozzle guide vane assembly problem related to the maintenance of aircraft engines is also discussed.