入厂物流中短驳合并运输问题的建模与优化  

The Modeling and Optimization of Short Split Merged Transportation Problems about Inbound Logistics

作　　者：张超群[1] 张纪会[1] 宋晓鹏[1] 马清悦[1] 

机构地区：[1]青岛大学复杂性科学研究所,山东青岛266071

出　　处：《青岛大学学报（工程技术版）》2012年第3期79-83,共5页Journal of Qingdao University(Engineering & Technology Edition)

基　　金：山东省自然科学基金项目(ZR2010GM006)

摘　　要：为建立合理有效的入厂物流方案,本文建立了入厂物流短驳合并优化问题的数学模型,利用基于递降最佳适合算法(best fit decreasing,BFD)的启发式算法和基于整数编码的单亲遗传算法进行求解,并以某汽车组装厂入厂物流为例进行仿真,仿真结果表明,本文提出的算法与BFD算法相比,可以有效降低物料供应的总成本。To establish reasonable and effective inbound logistics solutions,this paper establishes a mathe- matical model of the short split combined optimization about inbound logistics, and uses a heuristic algo- rithm based on best fit descending algorithm （best fit decreasing,BFD） and a Partheno genetic algorithm based on the idea of integer coding to solve it. We take the inbound logistics of an automotive assembly plant as an example for simulation test. The simulation results show that the proposed algorithm can effec- tively reduce the total cost of supplies compared with the algorithm of BFD.

关 键 词：入厂物流 短驳合并 单亲遗传算法 

分 类 号：F252[经济管理—国民经济] F224