Shu, Yixiao; Li, Ruichao; Chen, Chao; Lu, Quanyi The combined optimal programming of loading and path planning. (Chinese. English summary) Zbl 1349.90127 Math. Pract. Theory 45, No. 15, 121-130 (2015). Summary: 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 an NP complicated problem, whose unknown parameters increase along with increasing complexity, which results in 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 and realizable solution for this kind of transportation problem. MSC: 90B06 Transportation, logistics and supply chain management 90C27 Combinatorial optimization 90C35 Programming involving graphs or networks 90C05 Linear programming 90C10 Integer programming 90C59 Approximation methods and heuristics in mathematical programming Keywords:transportation problem; joint optimal program; multiple traveling salesman problem; graph theory model; integer linear programming PDFBibTeX XMLCite \textit{Y. Shu} et al., Math. Pract. Theory 45, No. 15, 121--130 (2015; Zbl 1349.90127)