检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈勇[1] 程子文 姜枞聪 王亚良[1] 王成[1] 郦仕云 CHEN Yong;CHENG Ziwen;JIANG Congcong;WANG Yaliang;WANG Cheng;LI Shiyun(College of Mechanical Engineering,Zhejiang University of Technology,Hangzhou,310014)
机构地区:[1]浙江工业大学机械工程学院
出 处:《中国机械工程》2019年第15期1837-1848,共12页China Mechanical Engineering
基 金:国家自然科学基金资助项目(71371170,71871203);浙江省自然科学基金资助项目(LY17E050023,LY18G010017,LY16G010013)
摘 要:为满足大规模定制和产业集群下多品种、小批量的市场需求和订单动态波动的客户需求以及车间低成本、高稳健性的布局要求,设计了以单位面积布置成本、单位产品物流成本和布局熵为优化指标的多目标布局优化模型。提出了基于Pareto优化的聚类并行多目标遗传算法,引入模糊C-均值聚类算法以提高Pareto解集分布的多样性与均匀性,设计了多元胞差分进化重插入操作与基于“精英策略”的移民操作,增强了算法全局与局部搜索能力,有效避免了早熟现象。通过典型算例对比,验证了模型和算法的有效性;同时在企业布局实例应用中,获得了既能满足低成本又能将布局熵值控制在理想范围内的车间布局方案,表明模型具有良好的实用性。In order to meet the multi-variety and small-batch markets demands and dynamic fluctuating customers demands under mass customization and industrial cluster, and to meet the low cost and high robustness layout requirements of workshops,a multi objective layout optimization model was designed which included unit area layout cost, unit product logistics cost and layout entropy. A clustering parallel multi-objective genetic algorithm was proposed based on Pareto optimization. Fuzzy C-means clustering algorithm was introduced to improve the diversity and uniformity of Pareto solution set distributions. The multiple cell differential evolution re-insertion operation and the migration operation based on “elite strategy” were designed to enhance the global and local search ability of the algorithm, and effectively avoid the phenomenon of precocity. By comparing the typical examples, the validity of the algorithm and model was verified. In addition, the model may provide high practicability in real layout applications since it may reach the aim of low cost, and control the entropy of workshops within an ideal range.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.200.145