[
[1] Yen-Chun, W., Goh, M., Chih-Hung, Y. & Shan-Huen, H. (2017). Logistics management research collaboration in Asia. The International Journal of Logistics Management 28(1), 206-223. DOI: 10.1108/IJLM-09-2013-0104.
]Search in Google Scholar
[
[2] Khalid, A.E., AbdelHadi, N.A. & AbdelMonaem F.M.A. (2008). Routing Problems: A Survey. In The 43rd Annual Conference on Statistics, Computer Sciences and Operations Research, 22-25 December 2008 (pp. 51-70). San Francisco, California: Academia Publishers.
]Search in Google Scholar
[
[3] Dahiya, C. & Sangwan, S. (2018). Literature Review on Travelling Salesman Problem. International Journal of Research 5(16), 1152-1155. Retrieved March 18, 2022, from: https://journals.pen2print.org/index.php/ijr/article/view/15490/15018
]Search in Google Scholar
[
[4] Toro, E.M., Escobar Z.A.H. & Granada E.M. (2015). Literature review on the vehicle routing problem in the green transportation. Luna Azul 15(42), 362–387. DOI: 10.17151/luaz.2016.42.21.
]Search in Google Scholar
[
[5] Liong, C.-Y., Wan, I. & Khairuddin. O. (2008). Vehicle routing problem: Models and solutions. Journal of Quality Measurement and Analysis 4(1), 205-218. Retrieved January 2008, from: https://www.researchgate.net/publication/313005083_Vehicle_routing_problem_Models_and_solutions
]Search in Google Scholar
[
[6] Braekers, K., Ramaekers, K. & Nieuwenhuyse, I. (2015). The Vehicle Routing Problem: State of the Art Classification and Review. Computers & Industrial Engineering 99, 300-313. DOI: 10.1016/j.cie.2015.12.007.
]Search in Google Scholar
[
[7] Hrablik, H., Horňáková, N. & Babčanová, D. (2015). Use of operational research methods in logistics. In Carpathian Logistics Congress, PriessnitzSpa, Jesenik, Czech Republic, EU, 4 – 6 November 2015 (pp. 307-312). Philadelphia, United States. London, United Kingdom: Web of Science.
]Search in Google Scholar
[
[8] Malhotra S. & Khandelwal, M. (16 March 2022) XpressBees Logistics Problem Using Exact and Heuristic Method. Retrieved March 16, 2022, from https://drive.google.com/file/d/130u99Z9w5GTpWVKIL1JBiW
]Search in Google Scholar
[
[9] Satyananda, D. & Wahyuningsih, S. (2019). VND in CVRP, MDVRP, and VRPTW Cases. Journal of Physics: Conference Series 19(1), 12-25. DOI: 10.1088/1742-6596/1320/1/012025.
]Search in Google Scholar
[
[10] Akhand, M.A., Peya, Z.J., Sultana, T. & Al-Mahmud (2015). Solving Capacitated Vehicle Routing Problem with route optimization using Swarm Intelligence. In 2nd International Conference on Electrical Information and Communication Technologies (EICT), 10-12 December 2015 (pp. 112-117). Manhattan, New York, U.S: Institute of Electrical and Electronics Engineers.
]Search in Google Scholar
[
[11] Gan, X., Wang, Y., Li, S. & Niu, B. (2012). Vehicle Routing Problem with Time Windows and Simultaneous Delivery and Pick-Up Service Based on MCPSO. Mathematical Problems in Engineering 12, 1–11. DOI: 10.1155/2012/104279.
]Search in Google Scholar
[
[12] Ombuki, B., Ross, B.J. & Hanshar F. (2006). Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows. Springer Science and Business 6(1), 17–30. DOI: 10.1007/s10489-006-6926-z.
]Search in Google Scholar
[
[13] Sharma, R., Patel, P., Umrigar, N. & Zala, L.B. (2018). Delay estimation at signalized intersections under heterogeneous traffic conditions. International Research Journal of Engineering and Technology 5(5), 2945-2952. DOI:10.13140/RG.2.2.16273.76644.
]Search in Google Scholar
[
[14] Adepu, R. & Molugaram, K. (2018). Evaluation of delay characteristics at signalized intersections for improvement in level of service. International journal for traffic and transport engineering 18(3), 309–19. DOI:10.7708/ijtte.2018.8(3).05.
]Search in Google Scholar
[
[15] Almash, A. & Faruq, O. (2019) Finding Shortest Path for Road Network Using Dijkstra’s Algorithm. Bangladesh Journal of Multidisciplinary Scientific Research 19(2), 41–45. DOI: 10.46281/bjmsr.v1i2.366.
]Search in Google Scholar
[
[16] Javaid, M.A. (2013). Understanding Dijkstra Algorithm. SSRN Electronic Journal 13, 1-27. DOI: 10.2139/ssrn.2340905.
]Search in Google Scholar
[
[17] Sitinjak, A.A., Pasaribu, E., Simarmata, J.E., Putra, T. & Mawengkang, H. (2018). The Analysis of Forward and Backward Dynamic Programming for Multistage Graph. In IOP Conference Series: Materials Science and Engineering, January 2018 (pp. 1-7). Bristol, England, United Kingdom: IOP publishing.
]Search in Google Scholar
[
[18] Caccetta, L., Alameen, M. & Abdul-Niby, M. (2013). An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem. Engineering, Technology & Applied Science Research 3(2), 413–415. DOI:10.48084/etasr.292.
]Search in Google Scholar
[
[19] Pichpibul, T. & Kawtummachai, R. (2013). A Heuristic Approach Based on Clarke-Wright Algorithm for Open Vehicle Routing Problem. The Scientific World Journal 13(1), 1-11. DOI: 10.1155/2013/874349.
]Search in Google Scholar
[
[20] Shankar, R.B.S., Reddy, K.D. & Venkataramaiah, P. (2018). Solution to a Capacitated Vehicle Routing Problem Using Heuristics and Firefly Algorithm. International Journal of Applied Engineering Research 13(21), 15247-15254. Retrieved 2018, from: https://www.ripublication.com/ijaer18/ijaerv13n21_59.pdf
]Search in Google Scholar
