节点文献
开放式多中心需求可拆分VRP及混沌遗传模拟退火算法
Chaos Genetic Simulated Annealing Algorithm for the Open Multi-depot Split Delivery Vehicle Routing Problem
【摘要】 综合考虑客户需求量允许被拆分、配送系统拥有多个配送中心且车辆可就近返回配送中心的运输模式,建立以配送中心日均建设成本、车辆派遣成本、理货成本和油耗成本之和最小为目标的数学模型,并根据问题特征设计了混沌遗传模拟退火算法对问题进行求解。通过对不同规模以及不同类型的算例进行实验,验证了混沌遗传模拟退火算法求解本文问题的有效性。
【Abstract】 Considering the transportation mode of customer demand to be split, the distribution system with multiple depots and the vehicle can return the nearest depot, the mathematical model finding out of minimal sum of depots’ daily construction cost, vehicles’ fixed cost, tally cost and energy consumption cost is formulated. According to the characters of problem, the chaos genetic simulated annealing algorithm is designed to solve it. The effectiveness of the chaos genetic simulated annealing algorithm to solve this problem studied in this paper is verified by instances on different scale and different types.
【Key words】 vehicle routing problem; open multi-depot; split delivery; chaos genetic algorithm; simulated annealing algorithm;
- 【文献出处】 运筹与管理 ,Operations Research and Management Science , 编辑部邮箱 ,2022年01期
- 【分类号】U492.22;TP18
- 【被引频次】1
- 【下载频次】934