优先配送绿色VRP的混合启发式求解算法  

A Hybrid Heuristic Algorithm for Solving the Green VRP with Priority Delivery

作　　者：崔焕焕 官礼和 Cui Huanhuan;Guan Lihe(School of Mathematics and Statistics,Chongqing Jiaotong University,Chongqing 400074,China)

机构地区：[1]重庆交通大学数学与统计学院,重庆400074

出　　处：《系统仿真学报》2025年第2期413-423,共11页Journal of System Simulation

基　　金：国家自然科学基金(12271067);重庆市高校创新研究群体项目(CXQT21021);重庆市研究生联合培养基地建设项目(JDLHPYJD2021016);2023年重庆市研究生教育“课程思政”示范项目(YKCSZ23136)。

摘　　要：考虑物流配送中部分客户货物存在不可混装的问题,在传统同时取送绿色车辆路径问题基础上,根据客户需求将客户划分为优先配送、非优先只取不送、非优先有取有送3种类型,并建立最小化总成本的单目标非线性优化模型。基于模拟退火和自适应大邻域搜索算法设计了一种混合启发式求解方法,采用改进的节约算法构造初始解,在模拟退火算法框架中利用5种破坏算子和2种修复算子进行自适应大邻域搜索,直至稳定。仿真结果表明:所提算法能有效降低总成本和减少车辆数,且具有较快的收敛速度和较强的稳定性。This paper considers the problem that some customers'goods cannot be mixed in logistics distribution.Based on the traditional green vehicle routing problem with simultaneous pickup and delivery,customers are divided into three types:priority delivery,non-priority only pickup without delivery,and non-priority pickup with delivery.A single objective nonlinear optimization model is established to minimize the total cost.A hybrid heuristic method based on simulated annealing and adaptive large neighborhood search algorithm is designed.An improved saving algorithm is used to construct the initial solution.And 5 kinds of destruction operators and 2 kinds of repair operators are used in the simulated annealing algorithm framework for adaptive large neighborhood search,until stability is achieved.The simulation results indicate that the proposed method can effectively reduce total costs and the number of vehicles,and has fast convergence speed and strong stability.

关 键 词：绿色车辆路径问题 同时取送货 节约算法 模拟退火 自适应大邻域搜索 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]