Solving dynamic vehicle routing problem with time windows by ant colony system with bipartite graph matching
Egyptian Informatics Journal · 2024-03 · 25 · 100421
DOI: 10.1016/j.eij.2023.100421 ↗Kurz gefasst
Fachartikel in der Zeitschrift Egyptian Informatics Journal, 2024-03. Verfasst von Yi Teng und 4 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 52 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Guangdong Province.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Natural Science Foundation of Guangdong Province
Zitieren
APA
Teng, Y., Chen, J., Zhang, S., Wang, J., & Zhang, Z. (2024). Solving dynamic vehicle routing problem with time windows by ant colony system with bipartite graph matching. Egyptian Informatics Journal, 25, 100421. https://doi.org/10.1016/j.eij.2023.100421
Vancouver
Teng Y, Chen J, Zhang S, Wang J, Zhang Z. Solving dynamic vehicle routing problem with time windows by ant colony system with bipartite graph matching. Egyptian Informatics Journal. 2024;25:100421. doi:10.1016/j.eij.2023.100421
BibTeX
@article{Teng2024,
author = {Teng, Yi and Chen, Jinbiao and Zhang, Shiyuan and Wang, Jiahai and Zhang, Zizhen},
title = {Solving dynamic vehicle routing problem with time windows by ant colony system with bipartite graph matching},
journal = {Egyptian Informatics Journal},
year = {2024},
volume = {25},
pages = {100421},
doi = {10.1016/j.eij.2023.100421}
}
EUVIMED