检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈香玲 郭鹏[1,2] 温昆 裴霞 CHEN Xiangling;GUO Peng;WEN Kun;PEI Xia(School of Mechanical Engineering,Southwest Jiaotong University,Chengdu,Sichuan 610031,China;Technology and Equipment of Rail Transit Operationand Maintenance Key Laboratoryof Sichuan Province,Chengdu,Sichuan 610031,China)
机构地区:[1]西南交通大学机械工程学院,四川成都610031 [2]轨道交通运维技术与装备四川省重点实验室,四川成都610031
出 处:《河北科技大学学报》2021年第2期91-100,共10页Journal of Hebei University of Science and Technology
基 金:国家自然科学基金(51405403);国家重点研发计划项目(2020YFB1712200)。
摘 要:为了提高自动引导小车(automatic guided vehicle,AGV)在物流分拣中心的分拣效率,考虑采用纯电力驱动的AGV分拣过程存在电量消耗和充电需求的特性,提出了一种优化模型.在考虑AGV剩余电量和包裹时间窗等约束条件的基础上,建立了以最小化分拣作业周期为目标的混合整数规划(MIP)模型并提出了相应的约束规划(CP)模型,模型中使用区间变量表示任务的执行情况,借助累积函数记录电量的变化情况.计算结果表明,与MIP模型相比,CP模型拥有更好的求解性能.采用混合整数规划与约束规划构建AGV调度模型,可以有效提高分拣效率,降低企业运营成本,并为考虑更多约束的AGV调度研究提供求解途径.In order to improve the sorting efficiency of automatic guided vehicle(AGV)in the logistics sorting center,an optimized model was proposed considering the characteristics of power consumption and charging demand in the sorting process of electric-driven AGVs.On the basis of considering of the AGVs’remaining power and package delivery time window,a mixed integer programming(MIP)model with the minimization of the sorting operation cycle and a corresponding constrained programming(CP)model were formulated.In CP model,the interval variables were used to describe the performance of tasks and the change of electric quantity was recorded by using cumulative function.The computational results show that the CP model has better performance compared with the MIP model.Adopting mixed integer programming and constrained programming to formulate the AGV scheduling model can effectively improve the sorting efficiency,reduce the operating cost of enterprises,and provide an alternative solution for the AGV scheduling problem with more constraints.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7