EUVIMEDEUVIMED entdecken
Open Access · CC BY-SA 4.0

Comparison Vehicle Routing Optimization Algorithm: A Case of e-Grocery Delivery in Malaysia

Khoong Tai Wai, Tan Xin Hui, Bryan Yee Man Kit, Yap Jing Yong, Lee Ruo Qi, Chow Poh Ling, Kumara Adji Kusuma

JOIV : International Journal on Informatics Visualization · 30.03.2026 · 10 (2) · 588

DOI: 10.62527/joiv.10.2.3532 ↗

Kurz gefasst

Fachartikel in der Zeitschrift JOIV : International Journal on Informatics Visualization, online erschienen am 30.03.2026. Verfasst von Khoong Tai Wai und 6 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The Malaysian e-grocery market is estimated to reach revenue of US$2.15 billion in 2024, and it faces challenges in last-mile delivery logistics. The core challenges of the vehicle routing problem (VRP) arise from changes in the distribution of delivery destinations, time-slot constraints, and the need for temperature-controlled transportation. Inefficient routing leads to prolonged transit times, increased fuel consumption, higher operational costs, and customer dissatisfaction. Thus, the research objective is to optimize vehicle routing for an e-grocer company in Malaysia by applying and comparing the genetic algorithm (GA) and nearest neighbor (NN) algorithm. This research utilizes a total of 11 customer dataset delivery locations from an e-grocer retailer. The GA iteratively generates and evaluates different sequences of delivery destinations based on fitness scores for algorithm time and distance. Besides, the NN algorithm follows a heuristic approach of iteratively visiting the nearest unvisited destination. Python was used to create algorithms. The finding revealed that the GA (Generation 51) yields a route with an algorithm unit total time of 3.15 hours and a distance of 146.31 km, while the NN algorithm outperforms it with a total time of 2.94 hours and a distance of 135.15 km. Hence, the NN algorithm is the preferred route optimization choice. This study extends the algorithm theory contribution to e-grocery last-mile delivery. This study contributes to the development of practical solutions to last-mile delivery challenges in the Malaysian e-grocery context by considering actual geographic distances and a real-world case. The findings have significant implications for operational efficiency and customer satisfaction in the e-grocery industry.

Zitieren

APA

Wai, K. T., Hui, T. X., Kit, B. Y. M., Yong, Y. J., Qi, L. R., Ling, C. P., & Kusuma, K. A. (2026). Comparison Vehicle Routing Optimization Algorithm: A Case of e-Grocery Delivery in Malaysia. JOIV : International Journal on Informatics Visualization, 10(2), 588. https://doi.org/10.62527/joiv.10.2.3532

Vancouver

Wai KT, Hui TX, Kit BYM, Yong YJ, Qi LR, Ling CP, et al. Comparison Vehicle Routing Optimization Algorithm: A Case of e-Grocery Delivery in Malaysia. JOIV : International Journal on Informatics Visualization. 2026;10(2):588. doi:10.62527/joiv.10.2.3532

BibTeX
@article{Wai2026,
  author = {Wai, Khoong Tai and Hui, Tan Xin and Kit, Bryan Yee Man and Yong, Yap Jing and Qi, Lee Ruo and Ling, Chow Poh and Kusuma, Kumara Adji},
  title = {Comparison Vehicle Routing Optimization Algorithm: A Case of e-Grocery Delivery in Malaysia},
  journal = {JOIV : International Journal on Informatics Visualization},
  year = {2026},
  volume = {10},
  number = {2},
  pages = {588},
  doi = {10.62527/joiv.10.2.3532}
}
Kostenlos starten →