摘要： 为最小化总运费，提出一种混装货物的优化配置模型。根据不同货物的运输费率、实际重量和体积重量完成混装搭配，在证明 2个相关引理的基础上设计启发式算法，将其与基本遗传算法进行多组随机计算比较。实验结果表明，对于50件货物的10组随机数据，遗传算法所用平均计算时间是启发式算法的2 325倍，对于200件物品的10组随机数据，启发式算法所用的平均计算时间仅为4.009 4 s。

关键词: 计费重量, 运输率, 混装货物, 优化配置, 启发式算法, 遗传算法

Abstract: This paper presents an optimal allocation model of mix-loading goods to minimize the total freight. Mix-loading of different goods with different transportation rate, gross weight and volume is the basis of this optimal allocation model. By using two relative lemmas, it proposes a heuristic algorithm to solve this model. Numerical examples are presented to demonstrate the efficiencies of the heuristic algorithm by comparing with a basic Genetic Algorithm(GA). Giving 10 groups random data of 50 piece goods, experimental results show that the average runtime of GA is 2 325 times as much as that of heuristic algorithm, and give 10 groups random data of 200 piece goods, the average runtime of heuristic algorithm is only 4.009 4 s.

Key words: chargeable weight, transportation rate, mix-loading goods, optimal allocation, heuristic algorithm, Genetic Algorithm(GA)

中图分类号: 

• TP301.6