检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:边展[1] 张倩[2] BIAN Zhan;ZHANG Qian(School of Business Administration,Capital University of Economics and Business,Beijing 100070,China;Business School,Bejing Technology and Business University,Beijing 100048,China)
机构地区:[1]首都经济贸易大学工商管理学院,北京100070 [2]北京工商大学商学院,北京100048
出 处:《工业工程》2025年第2期20-27,共8页Industrial Engineering Journal
基 金:国家自然科学基金资助项目(72172023,71602130);教育部人文社会科学资助项目(21YJCZH201);首都经济贸易大学学术创新团队中国ESG生态体系构建机制研究团队项目(XSCXTD202404)。
摘 要:针对需求可拆分的多品种库存路径问题(multi-product inventory routing problem with split deliveries,MIRPSD),提出一种基于最小化库存持有成本、运输成本和车辆使用总成本的车辆路径优化模型。同时考虑每个客户的交货计划及每种货物的运输数量。设计混合遗传算法进行求解,引入扰动策略以提高搜索效率,并通过实验选取合适的参数。探讨了平均日需求量与车辆载重量的比值、单位库存持有成本对需求拆分策略及总配送成本的影响。多组算例试验表明,本文提出的模型和算法可有效解决该问题。当需求量服从正态分布且平均日需求量为车辆载重量的55%时,采用需求拆分策略的效果最佳。本研究拓展了库存路径问题的相关理论,既可为解决MIRPSD问题提供一种新思路,也可为物流企业的相关决策提供理论依据。To address the multi-product inventory routing problem with split deliveries(MIRPSD),a vehicle routing optimization model is established for minimizing inventory holding cost,transportation cost and vehicle usage cost.The delivery schedule and the transported quantity of each product for each customer are also considered in the model.A hybrid genetic algorithm(HGA)is proposed to solve this problem,incorporating a perturbation strategy to improve the search efficiency.Experiments are conducted to select appropriate parameters.Furthermore,the ratio of average daily demand to vehicle capacity and unit inventory holding cost are analyzed to investigate their impact on the split delivery strategy and total delivery cost.Multiple test instances demonstrate that the proposed model and algorithm can effectively solve the problem.When the demand follows a normal distribution and the ratio of average daily demand to vehicle capacity is 0.55,the split delivery strategy can reach the best result.The study extends the theoretical framework of the inventory routing problem(IRP),providing a new perspective for solving MIRPSD and offering theoretical support for relevant decisions of logistics enterprises.
关 键 词:车辆路径问题 库存路径问题 多品种 需求拆分 混合遗传算法 扰动策略
分 类 号:U492.22[交通运输工程—交通运输规划与管理] F406.14[交通运输工程—道路与铁道工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7