Self-Adaptive Discrete Cuckoo Search Algorithm for the Service Routing Problem with Time Windows and Stochastic Service Time  

作　　者：ZHANG Guoyun WU Meng LI Wujing OU Xianfeng XIE Wenwu 

机构地区：[1]School of Information Science and Engineering,Hunan Institute of Science and Technology,Yueyang 414006,China

出　　处：《Chinese Journal of Electronics》2023年第4期920-931,共12页电子学报（英文版）

基　　金：This work was supported by the Scientific Research Fund of Education Department of Hunan Province(22A0471);the Hunan Provincial Natural Science Foundation(2020JJ5218);the Engineering Research Center on 3D Reconstruction and Intelligent Application Technology of Hunan Province(2019-430602-73-03-006049);the Science and Technology Program of Hunan Province(2019TP1014).

摘　　要：Making house calls is very crucial to deal with the competitive pressures of the service business and to improve service quality.We design a model called service routing problem with time windows and stochastic service time(SRPTW-SST)that is based on vehicle routing problem with time windows.A self-adaptive discrete cuckoo search algorithm with genetic mechanism(sDCSGM)is proposed for the model SRPTW-SST.Moreover,we design a selection mechanism to improve the logicality of the algorithm based on the strong randomness of the Lévy flight.We introduce a genetic mechanism and design a neighborhood search mechanism for improving the robustness of the algorithm.In addition,an adaptive parameter adjustment method is designed to eliminate the impact of fixed parameters.The experimental results show that the sDCS-GM algorithm is more robust and effective than the state-of-the-art methods.

关 键 词：Service routing problem with time window Stochastic service time Cuckoo search Vehicle routing problem with time window Lévy flight 

分 类 号：U492.22[交通运输工程—交通运输规划与管理] TP18[交通运输工程—道路与铁道工程]