检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:凌琳[1] 刘明周[1] 葛茂根[1] 王强[1] 马靖[1]
机构地区:[1]合肥工业大学机械与汽车工程学院,合肥230009
出 处:《机械工程学报》2015年第23期133-143,共11页Journal of Mechanical Engineering
基 金:国家重点基础研究发展计划(973计划;2011CB013406);国家自然科学基金(71071046)资助项目
摘 要:针对不确定作业车间环境下物料配送路径优化问题,采用能反映制造单元相对生产负荷及其变化趋势的瓶颈指数和瓶颈漂移指数表征实时变化的制造单元物料配送优先级,对路径选择过程中违反此优先级的行为设置惩罚成本,提出以最小化包括车辆运输成本和违反优先级的惩罚成本在内的总配送成本为优化目标,建立了时变的物料配送路径优化模型。在此基础上,为保证运输车辆所载物料全额配送,避免非必要负载以及由此造成的非必要配送子路径,对配送路径优化模型进行改进,允许运输车辆非满载和物料拆分配送,以提高物料配送效率降低配送成本;并结合模型特点将贪婪策略融入遗传算法对优化模型求解。最后,通过某作业车间内物料配送实例验证了所提出的计及漂移瓶颈的改进时变物料配送路径优化方法在不确定作业环境中具有有效性和实用性。Aiming at the material distribution routing optimization problem under uncertain job shop environment, the bottleneck index and bottleneck shifting index which represent the relative production load of each manufacturing unit and its the change trend are adopted to denote the time-varying distribution priority of the manufacturing unit. Then the time-varying material distribution routing optimization models are established and its objective is minimizing the distribution cost including vehicle transportation cost and punishment cost due to the violation of distribution priority. Based on that, suppose the condition that the vehicle haven't to be loaded fully and material can be distributed to one manufacturing more times in order to guarantee that the material in the vehicle is distributed totally before the vehicle comes back to the distribution center and to avoid unnecessary distribution sub-route, then propose the modified time-varying material distribution routing optimization model to enhance the distribution productivity and decrease the distribution cost further. The greedy-based genetic algorithm is presented to solve the proposed optimization model. An example of some job shop material distribution routing optimization is given to prove the validation and practicability of the proposed method under uncertainty.
关 键 词:漂移瓶颈 时变物料配送 路径优化 物料拆分 贪婪遗传算法
分 类 号:TH186[机械工程—机械制造及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.188.171.53