装载与运输路径的联合最优规划  

The Combined Optimal Programming of Loading and Path planning

作　　者：舒毅潇 李睿超[2] 陈超[3] 吕全义[4] 

机构地区：[1]西北工业大学机电学院,陕西西安710072 [2]西北工业大学动力与能源学院,陕西西安710072 [3]西北工业大学航空学院,陕西西安710072 [4]西北工业大学理学院,陕西西安710072

出　　处：《数学的实践与认识》2015年第15期121-130,共10页Mathematics in Practice and Theory

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

关 键 词：装载运输 联合最优规划 多旅行商问题 图论模型 整数线性规划 

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