需求可拆分的多品种库存路径优化问题

    Multi-product Inventory Routing Optimization with Split Deliveries

    • 摘要: 针对需求可拆分的多品种库存路径问题(multi-product inventory routing problem with split deliveries,MIRPSD),提出一种基于最小化库存持有成本、运输成本和车辆使用总成本的车辆路径优化模型。同时考虑每个客户的交货计划及每种货物的运输数量。设计混合遗传算法进行求解,引入扰动策略以提高搜索效率,并通过实验选取合适的参数。探讨了平均日需求量与车辆载重量的比值、单位库存持有成本对需求拆分策略及总配送成本的影响。多组算例试验表明,本文提出的模型和算法可有效解决该问题。当需求量服从正态分布且平均日需求量为车辆载重量的55%时,采用需求拆分策略的效果最佳。本研究拓展了库存路径问题的相关理论,既可为解决MIRPSD问题提供一种新思路,也可为物流企业的相关决策提供理论依据。

       

      Abstract: 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.

       

    /

    返回文章
    返回