冶金行业运输优化问题的算法求解及应用
Algorithmic Solutions to Some Transportation Optimization Problems with Applications in the Metallurgical Industry
摘要：
在本文中，我们解决几个约束运输优化问题（如车辆路径，最短的哈密尔顿路径），我们提出了新的算法解决方案和扩展，考虑到几个优化目标，如最小化成本和资源使用。所有考虑的问题都是由实际情况引起的，例如，在采矿和冶金工业中或在数据通信中。我们限制我们的注意力与路径，树或几何结构的运输网络，其中开发的多项式时间算法是最优或接近最优的。
英文摘要：
In this paper we address several constrained transportation optimization problems (e.g. vehicle routing, shortest Hamiltonian path), for which we present novel algorithmic solutions and extensions, considering several optimization objectives, like minimizing costs and resource usage. All the considered problems are motivated by practical situations arising, for instance, in the mining and metallurgical industry or in data communication. We restrict our attention to transportation networks with path, tree or geometric structures, for which the developed polynomial-time algorithms are optimal or nearly optimal.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
