检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:唐颖[1] 高倩芸 张文婷 陈晓健 陈伟[1] TANG Ying;GAO Qian-yun;ZHANG Wen-ting;CHEN Xiao-jian;CHEN Wei(Shanghai Tobacco Group Co.,Ltd.Shanghai Tobacco Storage and Transportation Company,Shanghai 200439,China)
机构地区:[1]上海烟草集团有限责任公司上海烟草储运公司,上海200439
出 处:《物流工程与管理》2022年第4期111-114,110,共5页Logistics Engineering and Management
摘 要:随着上海烟草集团产销规模的扩大,客户对卷烟的需求朝着多样化、小批量、多频次和个性化方向发展,烟草物流业务的运营体量和复杂程度与日俱增,如何依据全国各地客户点订单情况,并结合物流线路、运输工具、货物(烟件)规格等若干因素,进行快速、有效的车辆配载及货物装车成了上烟物流业务中一个迫切需要解决的问题。为了解决上烟多尺寸烟草的装箱问题,文中充分考虑烟草配载装车场景,建立符合实际业务需求的配载运输模型;确定优化目标与约束条件,建立车货匹配的混合整数线性规划装车模型;基于三维装箱的特性,提出了一种启发式算法,保证车箱空间利用率足够高。实验结果表明,该算法可以求得满意的可行解。With the expansion of production and marketing of Shanghai Tobacco Group,the customer demand for cigarettes is moving towards the direction of diversification,small batch,multi-frequency and personalization.As the operation volume and complexity of tobacco logistics business increase,how to get vehicle stowing and cargo loading rapidly and effectively according to customer orders all over the country and combining with the logistics lines,transport,goods(smoke)specifications and so on has become an urgent problem to be solved in the logistics business of tobacco loading.In order to solve the packing problem of multi-size tobacco,this paper fully considers the scene of tobacco stowing truck,and establishes a stowing transportation model that meets the actual business needs.The loading model of mixed integer linear programming based on vehicle and cargo matching was established.Based on the characteristics of 3D packing,a heuristic algorithm was proposed to ensure the high utilization rate of vehicle space.Experimental results show that this algorithm can obtain satisfactory feasible solutions.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.48