检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:侯克金 袁锐波[1] 杨灏泉 李焕 HOU Kejin;YUAN Ruibo;YANG Haoquan;LI Huan(Faculty of Mechanical&Electrical Engineering,Kunming University of Science and Technology,Kunming 650500,Yunnan,China;Yunnan Soft Control Technology Co.,Ltd.,Kunming 650031,Yunnan,China)
机构地区:[1]昆明理工大学机电工程学院,云南省昆明市650500 [2]云南柔控科技有限公司,云南省昆明市650031
出 处:《农业装备与车辆工程》2023年第5期28-33,共6页Agricultural Equipment & Vehicle Engineering
基 金:云南省科技厅重大科技专项“货箱式物料智能物流关键技术及系统”(2022BA045)。
摘 要:为满足仓储自动化物流系统中对货箱自动装车的需求,利用启发式思维,设定摆放、稳定性等约束条件建立货物装车的模型框架,运用蚁群算法进行多目标优化,以货箱体积占用率和重心范围为目标函数,创新性地将各个货物的相似度和目的地路径作为启发因子,动态地将货箱的体积占比作为信息素的参数,自适应改变信息素的挥发程度来加快算法收敛速度,得出一种能提高货车空间利用率以及货物稳定性装载方案。并通过实例验证得出,在货箱种类和数量较多的情况下,由本算法模型得到的货箱装载方案的满载率,相较于人工,提升了6%~7%。Based on the urgent need for automatic loading of cargo boxes in the warehouse automation logistics system,this paper uses heuristic thinking to set constraints such as placement and stability to establish a model framework for cargo loading,and uses the ant colony algorithm to perform multi-objective optimization.The volume occupancy rate of the cargo box and the range of the center of gravity are the objective functions.The similarity of each cargo and the destination path are innovatively used as the heuristic factors,and the volume ratio of the cargo box is dynamically used as the parameter of the pheromone to adaptively change the pheromone.The volatilization degree is used to speed up the convergence speed of the algorithm,and a scheme that can improve the space utilization rate of the truck and the stability of the cargo is obtained.And through example verification,when there are many types and quantities of containers,the full load rate of the container loading scheme obtained by this algorithm model is increased by 6 to 7 percentage points compared with manual work.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.143.17.164