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 ZHANG Guoyun;WU Meng;LI Wujing;OU Xianfeng;XIE Wenwu

作者机构：School of Information Science and Engineering Hunan Institute of Science and Technology 

出 版 物：《Chinese Journal of Electronics》 (电子学报(英文))

年 卷 期：2023年第32卷第4期

页      面：920-931页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 081104[工学-模式识别与智能系统] 08[工学] 082303[工学-交通运输规划与管理] 0835[工学-软件工程] 082302[工学-交通信息工程及控制] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 0823[工学-交通运输工程] 

基　　金：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) 

主　　题：Adaptation models Vehicle routing Stochastic processes Routing Search problems Genetics Robustness 

摘      要：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.