检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吕永贵 李林珈 刘挺 赵云东 付聪 刀荣贵 LV Yonggui;LI Linjia;LIU Ting;ZHAO Yundong;FU Cong;DAO Ronggui(Logistics Center,Hongta Tobacco(Group)Co.,Ltd.,Yuxi 653100,China)
机构地区:[1]红塔烟草(集团)有限责任公司物流中心,云南玉溪653100
出 处:《物流技术》2022年第8期110-112,118,共4页Logistics Technology
摘 要:面对零散化、碎片化的卷烟订单,目前烟草行业内仍然依赖于人工经验进行订单组拼和货车装载,多规格烟箱、多种类车厢加上多到货时间要求,带来了订单组拼和装载布局的难题,制约了车辆满载率和装载效率,增加了运输成本。选取车辆满载率和运输总成本作为目标指标,科学构建三维装车模型,以订单组拼、装车码放、路径规划和承运均衡等四个智能算法模型为基础,采用改进的迪杰斯特拉(Dijkstra)算法,确定出最优组拼装车方案,并提供具有指导作用的装车作业流程。Currently,the tobacco industry still relies on operator experience about order grouping and truck loading in face of the oftentimes scattered and fragmented cigarette orders.However,multi-specification cigarette boxes,multi-type carriages,and multiple arrival time requirements have posed new obstacle for order grouping and loading layout,restricting the utility rate and efficiency of truck loading and increasing the cost of transportation.In this paper,with full loading rate and total transportation cost as the target indicators,we scientifically constructed a 3D truck loading model,then based on the four intelligent algorithm models of order grouping,truck loading/stacking,path planning and carrier balancing,used the improved Dijkstra algorithm to determine the optimal cargo consolidation and truck loading solution,and at the end,provided the loading process for guidance and reference.
关 键 词:成品卷烟装载 订单组拼 三维装车模型 改进的迪杰斯特拉(Dijkstra)算法 装载率
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.133.83.94