检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈婵娟[1] 寇创创 刘利军[1] 宋博 CHEN Chan-juan;KOU Chuang-chuang;LIU Li-jun;SONG Bo(Shaanxi University of Science&Technology,Collge of Mechanical and Electrical Engineering,Shanxi Xi'an 710021,China)
机构地区:[1]陕西科技大学机电工程学院,陕西西安710021
出 处:《机械设计与制造》2021年第12期293-296,共4页Machinery Design & Manufacture
基 金:国家自然科学基金资助项目(71601113)。
摘 要:针对汽车制造企业入厂物流取货周期长、取货成本高等问题,提出一种"多层级循环取货模型"。首先,通过系统聚类法对所有供应商进行区域划分;其次,运用Topsis法将同一区域的供应商分为一、二两个层级;最后,将第一层级供应商作为该区域的集货点,并运用蚁群算法规划各集货点的最优取货路径。结合某汽车制造企业实例,建立入厂物流成本和取货周期最优的数学模型,通过对比多层级循环取货和milk-run两种取货方案,验证了多层级循环取货模型的先进性和可行性。Aiming at the problem that the automobile manufacturing enterprise has a long logistics pick-up period and high cost of picking up the goods. A “multi-level milk-run model” is proposed. First, all suppliers are partitioned by systematic clustering;Secondly,the suppliers in the same area are divided into one or two levels using the Topsis method;Finally,the first level suppliers are used as collection points in the area,and use the ant colony algorithm to plan the picking path of the collection point. Combined with an example of an automobile manufacturing enterprise,the mathematical model of the logistics cost and the picking cycle of the inbound plant was established. The advancement and feasibility of the multi-level milk-run model was verified by comparing the multi-level milk-run and the milk-run pickup scheme.
关 键 词:入厂物流 多层级循环取货 TOPSIS法 蚁群算法
分 类 号:TH16[机械工程—机械制造及自动化] TP312[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28