带容量约束的供应链物流运输调度问题的双层变邻域蝙蝠算法

Two-Level Bat Algorithm with Variable Neighborhood Search for Capacitated Vehicle Routing Problem in Supply Chain

本文考虑了多个供应商、多个制造商和多个零售商的三级供应链物流运输调度,以最大限度地降低采购、加工和运输成本为目标,提出了带容量约束的供应链物流运输调度模型(Capacitated Vehicle Routing Problem in Supply Chain,CVRPSC).进一步地,本文构造了求解CVRPSC的双层变邻域蝙蝠算法(Two-Level Bat Algorithm with Variable Neighborhood Search,TLBAVNS).该算法提出了一种双层蝙蝠位置的定义,引入了相应的蝙蝠算法的更新操作,采用变邻域局部搜索策略加强算法的寻优能力.实验证明:TLBAVNS能在合理的时间内求解CVRPSC;在大部分测试算例中,该算法相对于对比算法均表现出了更强的寻优能力和稳定性.

Considering a two-level vehicle routing problem in a three-echelon supply chain with multiple suppliers,multiple manufacturers and multiple stockists,with the aim of minimizing the cost of purchasing,production and transportation,this paper proposes a model for the capacitated vehicle routing problem in supply chain (CVRPSC).Further,a two-level bat algorithm with variable neighborhood search (TLBAVNS) is presented to solve CVRPSC.The algorithm proposes a definition of two-level bat position and introduces the corresponding operations of the bat algorithm.In addition,a variable neighborhood local search is proposed to enhance the optimizing capability of TLBAVNS.The experiments have shown that TLBAVNS can effectively solve the instances of CVRPSC within a suitable amount of time and significantly outperforms all the other alternatives in most of the cases.