DCS算法求解带软时间窗的送取货一体化VRP  

DCS Algorithm for Solving Integrated Pickup and Delivery Vehicle Routing Problem with Soft Time Windows

作　　者：周明龙[1] ZHOU Minglong(Anhui Technical College of Mechanical and Electrical Engineering,241000,Wuhu,Anhui,China)

机构地区：[1]安徽机电职业技术学院,安徽芜湖241000

出　　处：《淮北师范大学学报（自然科学版）》2024年第2期56-62,共7页Journal of Huaibei Normal University：Natural Sciences

基　　金：安徽省自然科学研究重点项目(2023AH052698);芜湖市重点研究发与成果转化项目(2023yf124);安徽省中青年教师培养行动学科(专业)带头人培育项目(DTR2023101)。

摘　　要：为求解带软时间窗的送取货一体化车辆路径问题,提出一种离散布谷鸟(DCS)搜索算法。该算法在基本布谷鸟搜索算法基础之上,对莱维飞行获取新鸟巢和以一定概率抛弃鸟巢的迭代公式进行重新定义;同时设计客户序列和车辆序列双倍体鸟巢,并对客户序列采用交换、逆序、插入操作和对每辆车的访问路线采用2-Opt操作。通过5个算例的仿真实验和相关文献比较,结果表明所提DCS算法行之有效。To solve the integrated pickup and delivery vehicle routing problem with soft time windows,A Dis⁃crete Cuckoo Search(DCS)algorithm is proposed.The algorithm is based on the basic cuckoo search algo⁃rithm and redefines the iteration formula for obtaining new bird nests and abandoning nests with a certain probability in the Lévy flight.In addition,we design double-haploid bird nests for both customer sequences and vehicle sequences,and use swap,inversion,and insertion operations for the customer sequence,and use 2-Opt operation for the access route of each vehicle.Through simulation experiments on five cases and com⁃parisons with relevant literature,the results show that the proposed DCS algorithm is effective.

关 键 词：车辆路径问题 同时送取货 软时间窗 布谷鸟搜索算法 

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