摘要
针对生产车间物料配送的实际需求,考虑车间工位缓存区有容量约束的限制,建立了面向装配过程的物料配送路径优化问题模型,针对遗传算法易早熟的缺陷,采用了一种基于预选择机制的遗传算法对模型进行了求解。得到的配送顺序及路线用于指导车间的物料配送,可有效降低车间的配送费用,提高配送效率。最后通过实例仿真验证了模型的实用性和有效性。
For the actual demand of material delivery in the manufacturing shop, considering the limitation of the station buffer cache eapaeity in the work shop, the model used for solving material delivery route optimization problem has been established facing the assembling process. In order to solve the problem which has the defeet that the genetic algorithm get the result too soon, a genetic algorithm based on pre-choiee mechanism has been adopted to solve this model. And the delivery sequence and route got from this method could be used in the workshop to guide the material delivery. This may reduce the delivery fee of workshop and improve the delivery efficiency. And finally, the practicability and effectiveness of this model will be proved by example simulation.
出处
《机械工程师》
2014年第7期55-58,共4页
Mechanical Engineer
关键词
物料配送
缓存约束
VRP
预选择机制
material delivery
storage constraints
VRP
preliminary selection mechanism