Distance based Sweep Nearest Algorithm to Solve Capacitated Vehicle Routing Problem
DOI: https://doi.org/10.14569/IJACSA.2019.0101036
Abstract
Keywords
How to Cite this Article
Peya, Z. J., Akhand, M. A. H., Sultana, T., & Rahman, M. M. H. (2019). Distance based Sweep Nearest Algorithm to Solve Capacitated Vehicle Routing Problem. International Journal of Advanced Computer Science and Applications, 10(10). https://doi.org/10.14569/IJACSA.2019.0101036
Peya, Zahrul Jannat, et al.. "Distance based Sweep Nearest Algorithm to Solve Capacitated Vehicle Routing Problem." International Journal of Advanced Computer Science and Applications, vol. 10, no. 10, 2019, https://doi.org/10.14569/IJACSA.2019.0101036.
@article{Peya2019,
title = {Distance based Sweep Nearest Algorithm to Solve Capacitated Vehicle Routing Problem},
journal = {International Journal of Advanced Computer Science and Applications},
volume = {10},
number = {10},
year = {2019},
publisher = {The Science and Information Organization},
author = {Zahrul Jannat Peya and M. A. H. Akhand and Tanzima Sultana and M. M. Hafizur Rahman},
doi = {10.14569/IJACSA.2019.0101036},
url = {https://doi.org/10.14569/IJACSA.2019.0101036}
}
Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.