Vehicle routing problems with time windows based on the improved hybrid fish swarm-ant colony algorithm-Reference-Cited by-同舟云学术

Vehicle routing problems with time windows based on the improved hybrid fish swarm-ant colony algorithm

Published:2022-07-07 Issue: Volume: Page:
ISSN:1955-2513
Container-title:International Journal on Interactive Design and Manufacturing (IJIDeM)
language:en
Short-container-title:Int J Interact Des Manuf

Author:

Zhang Jun,Zhang Jing,Qin Zhentao,Jia Yan

Publisher

Springer Science and Business Media LLC

Subject

Industrial and Manufacturing Engineering,Modeling and Simulation

Link

https://link.springer.com/content/pdf/10.1007/s12008-022-00953-7.pdf

Reference20 articles.

1. Papadimitriou, C.H.: The Euclidean travelling salesman problem is NP-complete. Theor. Comput. Sci. 4(3), 237–244 (1977)

2. Hang, Z., Luo, Z.L., Huang, S.W.: Applica-tion research of hybrid ant colony algorithm in vehicle routing problem with time windows. Acta Scientiarum Naturali-um Universitatis Sunyatseni 54(1), 41–46 (2015)

3. Pang, Y., Luo, H.L., Xing, L.N., et al.: A survey of vehicle routing optimization problems and solution methods. Control Theory Appl. 36(10), 1573–1584 (2019)

4. Li, G.M., Li, J.H.: Stochastic vehicle routing problem based on hybrid tabu search algorithm. Control Decis. 36(09), 2161–2169 (2021)

5. He, M.L., Wei, Z.X., Wu, X.H., Peng, Y.T.: An improved ant colony based algorithm for solving vehicle path problems with soft time windows.Computer Integrated ManufacturingSystems:1–14[2021–09–09].https://kns.cnki.net/kcms/detail/11.5946.TP.20210723.1749.012.html.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. CLUSTER-BASED CLONAL SELECTION ALGORITHM FOR VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS;Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi;2023-12-31