检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:范春阳 潘飞 Chunyang Fan;Fei Pan(Business School,University of Shanghai for Science and Technology,Shanghai)
机构地区:[1]上海理工大学管理学院,上海
出 处:《建模与仿真》2025年第3期52-65,共14页Modeling and Simulation
基 金:上海市白玉兰人才计划浦江项目(23PJC074);国家自然科学基金(72202137)。
摘 要:随着物流行业竞争加剧,越库配送模式逐渐得到推广,尤其在易腐品物流中展现出明显优势。易腐品因其易变质特性,存储和运输难度大,多次搬运和长时间存储容易加速变质,增加损耗。越库模式通过减少商品的搬运次数和库存存储,提升了物流效率并减少了运输成本。本文提出将越库模式应用于易腐品转运过程的车辆调度,基于最小化总变质质量,构建混合整数数学规划模型,并设计基于车辆排序的遗传算法求解。通过数值分析对比最小化完工时间和最小化总变质质量模型,分析两种不同模型在易腐品越库转运过程中的优劣,为易腐品物流企业的越库实践提供指导,具有重要的现实意义。With the intensification of competition in the logistics industry,the cross-docking distribution model has gradually been promoted and has shown obvious advantages especially in the logistics of perishable products.Perishable products are difficult to store and transport due to their perish-able nature.Multiple handlings and long-term storage are likely to accelerate deterioration and in-crease losses.The cross-docking modelimproves logistics efficiency and reduces transportation costs by reducing the number of times goods are handled and inventory storage.This paper proposes to apply the cross-docking model to truck scheduling in the transshipment process of perishable prod-ucts.Based on minimizing the total deteriorated quality,a mixed integer mathematical program-ming model is constructed,and a genetic algorithm based on truck sequencing is designed for solu-tion.Through numerical analysis,the models of minimizing the makespan and minimizing the total deteriorated quality are compared,and the advantages and disadvantages of the two different mod-els in the cross-docking transshipment process of perishable products are analyzed,which provides guidance for the cross-docking practice of perishable goods logistics enterprises and has important practical significance.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7