摘要
静态的物流车辆调度方案难以适应需求不确定引起的混流装配线物料需求动态变化,导致配送效率低下,甚至生产流程紊乱等问题。针对此问题,提出了一种面向需求不确定的混流装配线物流车辆配送区域划分方法。首先,分析需求不确定对物流车辆配送量的影响,提出了基于信息熵的配送任务复杂性测度方法。其次,在复杂性测度的基础上,建立以物流配送车辆满载率最大、配送任务复杂度最小为目标的调度优化模型。最后,在实例中应用遗传算法对调度优化模型进行求解,得出物流车辆配送区域最优划分方案。结果表明,所提方法能够输出适应需求不确定的物流车辆配送区域划分方案,满足需求变化的同时,保证车辆满载率维持在最高水平,并降低配送任务复杂度,减少配送错误发生率。
It is difficult for static scheduling solutions of logistics vehicles to adapt to the ever-changing material requirements for the mixed-model assembly line caused by uncertain demands,which has led to the low efficiency of distribution and even the production disorder.To this end,a method is set forth for the regional distribution of logistics vehi'cles in the mixedmodel assembly line geared to uncertain demands.Firstly,the analysis is conducted on the influence of uncertain demands upon the distribution volume of logistics vehicles;the method of complexity measurement of distribution tasks is proposed based on information entropy.Secondly,with the aid of complexity measurement,the optimized scheduling model is set up,which pursues the maximum capacity rate of logistics vehicles and the minimum complexity of distribution tasks.Finally,the genetic algorithm is employed to solve the scheduling model by means of some examples;the optimized scheme of regional distribution of logistics vehicles is obtained.The results show that by means of the proposed method,the reasonable scheme of regional distribution of logistics vehicles geared to uncertain demands is formulated,while ensuring the highest capacity rate of vehicles.It can also reduce the complexity of distribution tasks and the number of incidence of distribution errors.
作者
范国良
李爱平
徐立云
刘琨
李钰
FAN Guo-liang;LI Ai-ping;XU Li-yun;LIU Kun;LI Yu(Sehool of Mechanieal Engineering,Tongji University,Shanghai 201804)
出处
《机械设计》
CSCD
北大核心
2018年第11期10-16,共7页
Journal of Machine Design
基金
国家高档数控机床与基础制造装备科技重大专项资助项目(2013ZX04012-071)
上海市科委(上海市科技成果转化和产业化)资助项目(15111105500)
关键词
需求不确定性
混流装配线
物流车辆
配送区域
复杂度
uncertain demand
mixed-model assembly line
logistics vehicle
regional distribution
complexity