Problem solving to complex combination based on normal generating functions and its application to freight transportation grouping

The paper described the necessity of solving the problem on r combination from not totally different elements based on generating functions using computer experiments. Accounting to solving this problem based on generating functions, the paper puts forward a grouping-hierarchy algorithm to realize m polynomials multiplication quickly. By analyzing this algorithm, it is highly efficient and superior to other general algorithms multiply. In this paper, we use C++ programming language to program this algorithm, and then applied it into practical problems on freight transportation grouping. The correctness and the universality are verified.