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

doi:10.23919/cje.2022.00.072

Volume 32 Issue 4

Jul. 2023

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Electronics > 2023 > 32(4): 920-931

ZHANG Guoyun, WU Meng, LI Wujing, et al., “Self-Adaptive Discrete Cuckoo Search Algorithm for the Service Routing Problem with Time Windows and Stochastic Service Time,” Chinese Journal of Electronics, vol. 32, no. 4, pp. 920-931, 2023, doi: 10.23919/cje.2022.00.072

Citation:

ZHANG Guoyun, WU Meng, LI Wujing, et al., “Self-Adaptive Discrete Cuckoo Search Algorithm for the Service Routing Problem with Time Windows and Stochastic Service Time,” Chinese Journal of Electronics, vol. 32, no. 4, pp. 920-931, 2023, doi: 10.23919/cje.2022.00.072

Citation:

PDF( 3328 KB)

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

doi: 10.23919/cje.2022.00.072

1.
School of Information Science and Engineering, Hunan Institute of Science and Technology, Yueyang 414006, China

Funds: 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), and the Science and Technology Program of Hunan Province (2019TP1014).

More Information

Author Bio:
Guoyun ZHANG received the M.S. degree and Ph.D. degree in control theory and control engineering from Hunan University in 2002 and 2006, respectively. His research interests include image processing, and evolutionary computing. (Email: gyzhang@hnist.edu.cn)

Meng WU received the B.S. degree from the Zunyi Normal University in 2020. He is currently pursuing the M.S. degree from the Hunan Institute of Science and Technology. His research interests include evolutionary computing, and image processing.(Email: 1794909836@qq.com)

Wujing LI received the B.S. degree in software engineering and Ph.D. degree in computer science and technology from Sichuan University, Chengdu, China, in 2007 and 2012 respectively. His research interests include image denoising, image restoration, image enhancement, and hyperspectral image processing. (Email: liwj@hnist.edu.cn)

Xianfeng OU (corresponding author) received the M.S. degre in communication and information system from Xinjiang University in 2009, the Ph.D. degree in communication and information system from Sichuan University, Chengdu, China, in 2015. His research interests include image processing and evolutionary computing. (Email: ouxf@hnist.edu.cn)

Wenwu XIE received the B.S., M.S., and Ph.D. degrees in communication engineering from the Huazhong Normal University in 2004, 2007 and 2017, respectively. His research interests include communication algorithm, internet of thing, and evolutionary computing.(Email: gavinxie@hnist.edu.cn)
Received Date: 2022-04-04
Accepted Date: 2022-09-26

Available Online: 2022-11-02

Publish Date: 2023-07-05

Abstract

Abstract

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 (sDCS-GM) 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

FullText(HTML)

References(12)

References

[1]	Y. Y. Niu, Y. P. Zhang, Z. G. Cao, et al., “MIMOA: A membrane-inspired multi-objective algorithm for green vehicle routing problem with stochastic demands,” Swarm and Evolutionary Computation, vol.60, article no.100767, 2021. doi: 10.1016/j.swevo.2020.100767
[2]	Y. N. Sun, B. Xue, M. J. Zhang, et al., “Automatically designing CNN architectures using the genetic algorithm for image classification,” IEEE Transactions on Cybernetics, vol.50, no.9, pp.3840–3854, 2020. doi: 10.1109/TCYB.2020.2983860
[3]	J. S. Liu, L. Liu, and Y. Li, “A differential evolution flower pollination algorithm with dynamic switch probability,” Chinese Journal of Electronics, vol.28, no.4, pp.737–747, 2019. doi: 10.1049/cje.2019.04.008
[4]	Y. R. Naidu and A. K. Ojha, “Solving multiobjective optimization problems using hybrid cooperative invasive weed optimization with multiple populations,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol.48, no.6, pp.821–832, 2018. doi: 10.1109/TSMC.2016.2631479
[5]	H. N. Xuan, R. C. Zhang, and S. S. Shi, “An efficient cuckoo search algorithm for system-level fault diagnosis,” Chinese Journal of Electronics, vol.25, no.6, pp.999–1004, 2016. doi: 10.1049/cje.2016.06.035
[6]	Y. Marinakis, M. Marinaki, and A. Migdalas, “A multi-adaptive particle swarm optimization for the vehicle routing problem with time windows,” Information Sciences, vol.481, pp.311–329, 2019. doi: 10.1016/j.ins.2018.12.086
[7]	D. L. Li, Q. Cao, M. Zuo, et al., “Optimization of green fresh food logistics with heterogeneous fleet vehicle route problem by improved genetic algorithm,” Sustainability, vol.12, no.5, article no.1946, 2020. doi: 10.3390/su12051946
[8]	M. Mareli and B. Twala, “An adaptive cuckoo search algorithm for optimisation,” Applied Computing and Informatics, vol.14, no.2, pp.107–115, 2018. doi: 10.1016/j.aci.2017.09.001
[9]	M. Alzaqebah, S. Jawarneh, H. M. Sarim, et al., “Bees algorithm for vehicle routing problems with time windows,” International Journal of Machine Learning and Computing, vol.8, no.3, pp.236–240, 2018. doi: 10.18178/ijmlc.2018.8.3.693
[10]	J. P. Luo, X. Li, M. R. Chen, et al., “A novel hybrid shuffled frog leaping algorithm for vehicle routing problem with time windows,” Information Sciences, vol.316, pp.266–292, 2015. doi: 10.1016/j.ins.2015.04.001
[11]	Y. Shen, M. D. Liu, J. Yang, et al., “A hybrid swarm intelligence algorithm for vehicle routing problem with time windows,” IEEE Access, vol.8, pp.93882–93893, 2020. doi: 10.1109/ACCESS.2020.2984660
[12]	B. Moradi, “The new optimization algorithm for the vehicle routing problem with time windows using multi-objective discrete learnable evolution model,” Soft Computing, vol.24, no.9, pp.6741–6769, 2020. doi: 10.1007/s00500-019-04312-9