检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]天津大学管理学院,天津300072 [2]军事交通学院装运机械系,天津300161
出 处:《计算机工程与应用》2012年第2期215-217,共3页Computer Engineering and Applications
摘 要:对于多行设备布局问题,通过对搬运车辆运行情况的分析,建立的模型中以搬运设备的重载运行和空载运行的费用之和最小作为目标函数,设计了相应的遗传算法来求解。通过一个实例进行了模拟计算,进一步与原有模型的仿真结果进行了比较。比较结果说明了利用该模型得到的设备布置方案要优于采用原有模型得到的布置方案。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.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.222.21.218