摘要
为最小化总运费,提出一种混装货物的优化配置模型。根据不同货物的运输费率、实际重量和体积重量完成混装搭配,在证明2个相关引理的基础上设计启发式算法,将其与基本遗传算法进行多组随机计算比较。实验结果表明,对于50件货物的10组随机数据,遗传算法所用平均计算时间是启发式算法的2 325倍,对于200件物品的10组随机数据,启发式算法所用的平均计算时间仅为4.009 4 s。
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 rtmtime of heuristic algorithm is only 4.009 4 s.
出处
《计算机工程》
CAS
CSCD
2012年第13期280-282,共3页
Computer Engineering
基金
教育部人文社会科学研究青年基金资助项目(10YJC630360)
浙江省自然科学基金资助项目(Y6110730)
关键词
计费重量
运输率
混装货物
优化配置
启发式算法
遗传算法
chargeable weight
transportation rate
mix-loading goods
optimal allocation
heuristic algorithm
Genetic Algorithm（GA）
