考虑卸载时间的累计等待时间式车辆路径问题及求解  

Solving Cumulative Capacitated Vehicle Routing Problem with Unload Time

作　　者：黄戈文[1] 蔡延光[1] 

机构地区：[1]广东工业大学自动化学院,广东广州510006

出　　处：《工业控制计算机》2021年第3期36-37,41,共3页Industrial Control Computer

摘　　要：提出考虑卸载时间的累计等待时间式车辆路径问题(Cumulative Capacitated Vehicle Routing Problem with Unload Time,CCVRPUT)模型,该模型考虑货物在目的地的卸载时间,以所有车辆路径上全部客户累计等待时间之和和所有运输车辆额外运转时间支出两者为优化目标,更符合实际物流需要。针对CCVRPUT的特点,采用灰狼优化算法(Grey Wolf Optimizer,GWO)作为主体,采用实数编码和等分随机键与ROV规则结合的方法进行解码,引入2-Opt局部搜索策略,有效对CCVRPUT进行求解。最后,通过实验证明了所提出模型和算法的有效性。In this paper,a cumulative capacitated vehicle routing problem with unload time(CCVRPUT)model is proposed.This model considers the goods unloading time at each destination,and the optimization target of the CCVRPUT is set the sum of the accumulated waiting time of all customers on all vehicle paths and the extra expenditure of all transport vehicles,which is more in line with the actual logistics needs.In view of the characteristics of CCVRPUT,Grey Wolf Optimizer(GWO)is adopted as the cores,as well as real number coding and equally spaced random key method combined with ROV rules are adopted to decode the real number coding.The 2-OPT local search strategy is introduced to effectively solve CCVRPUT.Finally,the effectiveness of the proposed algorithm is proved by experiments.

关 键 词：车辆路径问题 累计等待时间式 卸载时间 灰狼优化算法 2-Opt 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] F252[自动化与计算机技术—控制科学与工程]