A Comparative Analysis of Heuristic and Dynamic Algorithms for Route Optimization in Johor’s Delivery Hubs

Delivery route optimization is crucial for enhancing logistics efficiency and reducing operational costs in the e-commerce industry. During the COVID-19 pandemic, Movement Control Order (MCO) in Malaysia led to a surge in online shopping as physical stores were closed. This study focuses on optimizing delivery routes between J&T hubs in Johor using three algorithms: Dynamic Programming (DP), Genetic Algorithm (GA) and Simulated Annealing (SA). The objectives include employing these algorithms to determine optimal routes, considering both distance and time and comparing GA and SA against DP as a benchmark. Data from 18 delivery hubs were analyzed using Python, with distance and travel times from Google Maps. All three optimazation methods were successfully applied to determine the optimal delivery route. The results demonstrated that DP consistently provides optimal solutions and emerged as the most effective method. The ideal departure time for both weekdays and weekends was identified as 10 p.m., with 667 minutes for weekdays and 641 minutes for weekends, respectively.In the comparison between GA and SA, GA outperformed SA in 8 out of 9 cases. However, at 6 p.m. on a weekend, SA achieved a shorter duration of 720 minutes compared to GA’s 742 minutes. These findings suggest that GA could be effectively adopted by logistics companies to optimize operations, reduce delivery times and meet the growing demands of e-commerce. Future applications could involve integrating real-time traffic data to further refine route optimization in dynamic environments. Additionally, hybrid approaches combining the strengths of DP, GA and SA could be explored to address complex logistics challenges in various regions, contributing to optimized delivery systems for congested urban areas, faster deliveries, and reduced the environmental impact.

Delivery route, E-commerce industry, Dynamic Programming, Genetic Algorithm

1. Tang, R. Q., Tan, Y. J., Tan, Z. X., Tan, Y. T., Almawad, G., & Alosaimi, A. (2022). A Study of Courier Service Quality and Customer Satisfaction. International Journal of Applied Business and International Management, 7(1). https://doi.org/10.32535/ijabim.v7i1.1447 [Google Scholar] [Crossref]

2. Zulazmi, Z. (2021). Customer Satisfaction and Customer Loyalty On Courier Service Quality In Malaysia: A Review Of Poslaju. [Google Scholar] [Crossref]

3. Fida, B. A., Ahmed, U., Al-Balushi, Y., & Singh, D. (2020). Impact of Service Quality on Customer Loyalty and Customer Satisfaction in Islamic Banks in the Sultanate of Oman. SAGE Open, 10(2). https://doi.org/10.1177/2158244020919517 [Google Scholar] [Crossref]

4. Singhal, A., & Pandey, P. (2016). TRAVELING SALESMAN PROBLEMS BY DYNAMIC PROGRAMMING ALGORITHM. International Journal of Scientific Engineering and Applied Science, 2(April). [Google Scholar] [Crossref]

5. Bhatti, A., Akram, H., Muhammad Basit, H., Khan, A., Mahwish, S., Naqvi, R., & Bilal, M. (2020). E-commerce trends during COVID-19 Pandemic. International Journal of Future Generation Communication and Networking, 13. [Google Scholar] [Crossref]

6. Kawasaki, T., Wakashima, H., & Shibasaki, R. (2022). The use of e-commerce and the COVID-19 outbreak: A panel data analysis in Japan. Transport Policy, 115, 88–100. https://doi.org/https://doi.org/10.1016/j.tranpol.2021.10.023 [Google Scholar] [Crossref]

7. Chauhan, C., Gupta, R., & Pathak, K. (2012). Survey of Methods of Solving TSP along with its Implementation using Dynamic Programming Approach. International Journal of Computer Applications, 52, 12–19. https://api.semanticscholar.org/CorpusID:6677215 [Google Scholar] [Crossref]

8. Sharma, S., & Jain, V. (2021). A Novel Approach for Solving TSP Problem Using Genetic Algorithm Problem. IOP Conference Series: Materials Science and Engineering, 1116, 012194. https://doi.org/10.1088/1757-899X/1116/1/012194 [Google Scholar] [Crossref]

9. Asih, H., Rahman, S., Usandi, K., Alwafi, Q., & Marza, A. (2023). Enhancing logistics efficiency: A case study of genetic algorithm- based route optimization in distribution problem. OPSI, 16, 208–216. https://doi.org/10.31315/opsi.v16i2.8962 [Google Scholar] [Crossref]

10. Henderson, D., Jacobson, S. H., & Johnson, A. W. (2006). The Theory and Practice of Simulated Annealing. In Handbook of Metaheuristics. https://doi.org/10.1007/0-306-48056-5_10 [Google Scholar] [Crossref]

11. Sarvepalli, S. K. (2015). Solving Travelling Salesman Problem (TSP) using Hopfield Neural Network (HNN) and Simulated Annealing (SA). https://doi.org/10.13140/RG.2.2.14124.10887/1 [Google Scholar] [Crossref]

12. Johnson, D. S., & McGeoch, L. A. (2008). The Traveling Salesman Problem: A Case Study in Local Optimization. https://api.semanticscholar.org/CorpusID:208903251 [Google Scholar] [Crossref]

• The Net Relative Run-Ratio Method (NRRR), a Foolproof Technique to Replace the Net Run Rate (NRR) Method in Evaluating the Authority of Match-Wins
• Statistical Role of CB-SEM Vs PLS-SEM in the Field of Social Science
• Predictive Modelling and Statistical Analysis of Housing Prices in Lagos State, Nigeria
• Collocational Patterns of Guru in American Business vs. Spiritual Discourse
• Comparative Analysis on Probability Proportional to Size Sampling Scheme in Estimating Population Total of Student Enrolment in Ekiti State University