检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杨玮[1] 岳婷[1] 李国栋[1] 王婷[1] 刘江[1] YANG Wei;YUE Ting;LI Guodong;WANG Ting;LIU Jiang(College of Mechanical and Electrical Engineering,Shaanxi University of Science and Technology,Xi an 710021,China)
机构地区:[1]陕西科技大学机电工程学院,陕西西安710021
出 处:《计算机集成制造系统》2018年第9期2349-2356,共8页Computer Integrated Manufacturing Systems
基 金:国家自然科学基金重大资助项目(71390331);陕西省农业科技创新与攻关资助项目(2014K01-29-01);陕西科技大学科研启动基金资助项目(BJ12-21)~~
摘 要:针对子母式穿梭车仓储系统复合作业路径优化问题,分析了两套子母车配一台升降机在一次存取货作业中的3种不同作业方式,以存取货作业时间最短为目标建立了进出库复合作业调度模型。设计结合交叉变异算子的自适应粒子群算法对该模型进行路径优化求解,并对两套子母穿梭车进行合理调度。仿真结果表明,该调度模型针对子母式穿梭车仓储系统复合作业具有较高的准确性,升降机与子母穿梭车以1∶2的配比方式在不同订单规模下能够更经济有效地缩短仓储系统的进出库复合作业时间,提高作业效率。Aiming at the routing optimization problem of compound operations in a shuttle-carrier warehousing system,three kinds of different operating modes in a way of matching two set of shuttle carriers with an elevator were analyzed in a couple of access operation.By taking the shortest time of storage and retrieval operations as the objective function,a loading/unloading scheduling model of compound operations was established.An adaptive particle swarm optimization algorithm combined with crossover and mutation operator was developed to solve the routing model,and two set of shuttle carriers were scheduled appropriately.The simulation results showed that the model had high accuracy for the compound operations of shuttle-carrier warehousing system,and the time of compound operations was shorten effectively and economically by matching two set of shuttle carriers with an elevator in different order scales for the shuttle-carrier warehousing system.
关 键 词:子母式穿梭车仓储系统 复合作业 调度模型 路径优化 自适应粒子群算法
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249