【摘要】 运输问题中可以分为两个过程:分配装载和规划路径运输,后者是图论问题,前者因为涉及到分配不同的货物装载到不同的运输工具上,是非线性整数规划问题,所以整个问题也是NP复杂问题,随着问题复杂度的增加,变量增多,求解将会非常耗时和困难.提出了基于多旅行商的M-TSP图论装载运输优化模型,和对此模型进行简化后的基于确定路线的整数线性规划装载模型,从而极大的方便此类问题的快速求解,为实际生产运输商业行为提供了一种方便、科学、可靠的决策模型和方案.更多还原

【Abstract】 Two parts axe involved in transportation problem:loading and path planning,the latter is a graph theory problem,and the former is a nonlinear integer programming problem relating to different goods on different transport vehicles,hence,the whole problem is summed up as a NP complicated problem,whose unknown parameters increases along with increasing complexity,which results into large time-consuming.This paper proposes a transportation optimization model based on multiple traveling salesman problem(M-TSP),and then simplifies this model to construct a linear integer programming loading model based on the known paths,which provides a convenient,scientific,realizable solution for this kind of transportation problem.更多还原