摘要
拼箱问题是货物运输中存在的NP完全问题。这里将贪婪法与自适应交叉变异算子引入到遗传算法中,设计了一种混合遗传算法,解决货箱的拼箱优化问题。文中给出了混合遗传算法与标准遗传算法、贪婪算法的比较结果。仿真研究验证了该方法的有效性。
The encasement problem that occurring in container loading is a NP|hard problem. It considers the objective optimizing of the loading problem. On the basis of the method with self|adaptive commute and mutate probability and greedy algorithm, a new hybrid genetic algorithm is developed for the loading problems of container. Relative study results of the adaptive genetic algorithm comparing with standard genetic algorithm and so on are given. Simulation study shows that the algorithm is effective.
出处
《仪器仪表学报》
EI
CAS
CSCD
北大核心
2004年第z1期931-932,943,共3页
Chinese Journal of Scientific Instrument
基金
四川省教育厅青年基金资助项目(2000-A53)。
关键词
混合遗传算法
贪婪算法
自适应
Hybrid genetic algorithm Greedy algorithm Adaptive