Abstract: The move of transport vehicles between devices is divided into loaded move and unloaded move. In the multi-lines facilities layout problem, the objective of previous models only considers the costs of loaded trip, without regard to empty vehicle trip costs. In this paper, the move of transport vehicles between devices is analyzed, the objective of this model is to minimize the total loaded and empty vehicle trip costs, and a heuristic algorithm based on partheno-genetic algorithms is designed to solve this model. A layout example is simulated and further the simulation results are compared to those of only considering loaded vehicle trip costs. Comparison of results shows the facility layout plan obtained using this model is superior to the layout obtained using the original model.

Key words: multi-lines facilities layout, transport vehicles, empty vehicle trip, partheno-genetic algorithm

摘要： 对于多行设备布局问题，通过对搬运车辆运行情况的分析，建立的模型中以搬运设备的重载运行和空载运行的费用之和最小作为目标函数，设计了相应的遗传算法来求解。通过一个实例进行了模拟计算，进一步与原有模型的仿真结果进行了比较。比较结果说明了利用该模型得到的设备布置方案要优于采用原有模型得到的布置方案。

关键词: 多行设备布局, 搬运车辆, 车辆空载, 单亲遗传算法