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.

关键词： normal generating function not quite dissimilar elements combination freight transportation grouping

作者: Dakun Zhang Zhaoxin Li Chang Zhang Xinming Duan

作者单位: Tianjin Polytechnic UniversityChenglin Road 63,Hedong District Tianjin 300160 China Tianjin Polytechnic University Chenglin Road 63,Hedong District Tianjin 300160 China

会议类型: 国际会议

会议名称: 2008 IEEE International Conference on Service Operations and Logistics, and Informatics(IEEE/SOLI’2008)(IEEE服务运作、物流与信息年会)

会议地点: 北京

会议语种:英文

在线出版日期: 2008-10-12（万方平台首次上网日期，不代表论文的发表时间）