Designing of a dynamic logistics platform for optimization of truck assignment and its route for KINZA company

Abdulhameed, O.; Ghanem, S.; Sadeq, R.; Ghamdi, R.; Mazyad, D.; Ahmed, N.

Growing Science » Decision Science Letters » Designing of a dynamic logistics platform for optimization of truck assignment and its route for KINZA company

Journals

DSL Volumes

Volume 1 (10)
- Issue 1 (5)
- Issue 2 (5)

Volume 2 (30)
- Issue 1 (5)
- Issue 2 (6)
- Issue 3 (9)
- Issue 4 (10)

Volume 3 (53)
- Issue 1 (15)
- Issue 2 (10)
- Issue 3 (19)
- Issue 4 (9)

Volume 4 (48)
- Issue 1 (10)
- Issue 2 (12)
- Issue 3 (14)
- Issue 4 (12)

Volume 5 (39)
- Issue 1 (12)
- Issue 2 (10)
- Issue 3 (8)
- Issue 4 (9)

Volume 6 (30)
- Issue 1 (8)
- Issue 2 (6)
- Issue 3 (9)
- Issue 4 (7)

Volume 7 (41)
- Issue 1 (8)
- Issue 2 (8)
- Issue 3 (8)
- Issue 4 (17)

Volume 8 (38)
- Issue 1 (8)
- Issue 2 (6)
- Issue 3 (14)
- Issue 4 (10)

Volume 9 (39)
- Issue 1 (8)
- Issue 2 (9)
- Issue 3 (14)
- Issue 4 (8)

Volume 10 (43)
- Issue 1 (7)
- Issue 2 (8)
- Issue 3 (20)
- Issue 4 (8)

Volume 11 (49)
- Issue 1 (9)
- Issue 2 (9)
- Issue 3 (14)
- Issue 4 (17)

Volume 12 (64)
- Issue 1 (12)
- Issue 2 (24)
- Issue 3 (13)
- Issue 4 (15)

Volume 13 (78)
- Issue 1 (21)
- Issue 2 (18)
- Issue 3 (19)
- Issue 4 (20)

Volume 14 (87)
- Issue 1 (21)
- Issue 2 (23)
- Issue 3 (25)
- Issue 4 (18)

Volume 15 (19)
- Issue 1 (19)

Countries

Decision Science Letters

ISSN 1929-5812 (Online) - ISSN 1929-5804 (Print) Quarterly Publication Volume 14 Issue 2 pp. 327-338 , 2025

Designing of a dynamic logistics platform for optimization of truck assignment and its route for KINZA company Pages 327-338 Download PDF

Authors: Osamah Abdulhameed, Sali Ghanem, Rafal Sadeq, Reemas Al Ghamdi, Dalal Al Mazyad, Naveed Ahmed

DOI: 10.5267/j.dsl.2025.1.005

Keywords: Supply Chain Management, Vehicle Routing Problem (VRP), Travel salesman problem (TSP), K-mean clustering

Abstract: A consideration of the integral variables of customer location, traffic flow, and road conditions to determine the best feasible delivery routes is a big challenge in Logistical operations. A poor routing strategy that delivers products places an ineffective gloss and eventually converts into high operating expenses, over-consumption of fuel, and shipment delays. The paper’s goal is to build a model for the logistics management of the company which aims for effective management of the truck allocation and vehicle routing using K-means clustering and TSP. K-means clustering is often used to classify the sites of delivery based on their closeness in space, hence simplifying the problem by reducing its dimensionality. The proposed algorithm considered customer location prioritization in deliveries, delivery task allocation, and truck allocation to enable timely delivery. Therefore, this paper presented a solution to enhance the logistics operations of beverage brand “KINZA” by optimizing its truck loading and delivery route. The model would ensure that each truck is able to travel optimally, with vehicle-routing algorithms applied in a way to avoid all unnecessary waste of time and distance. Finally, the main scope of this paper is to develop and design a dynamic logistics platform for the KINZA Company distribution network.

How to cite this paper

 Abdulhameed, O., Ghanem, S., Sadeq, R., Ghamdi, R., Mazyad, D & Ahmed, N. (2025). Designing of a dynamic logistics platform for optimization of truck assignment and its route for KINZA company.Decision Science Letters , 14(2), 327-338.

Refrences

Applegate, D., Bixby, R., Chvátal, V., & Cook, W. (1998). On the Solution of Traveling Salesman Problems. Documenta Mathematica (Extra Volume ICM 1998), 645-656.
Hoffman, K. L., Padberg, M., & Rinaldi, G. (2001). Traveling Salesman Problem: Combinatorial Optimization Approaches. In Kluwer Academic Publishers (pp. 1-40). DOI: 10.1007/1-4020-0611-X_1068.
Huang, Y., Li, J., & Wang, T. (2022). Enhancing K-means clustering performance with a K-means++ initialization approach for logistics applications. Journal of Business Research, 142, 429-439.
Johnson, D. S. (1990). Local Optimization and the Traveling Salesman Problem. AT&T Bell Laboratories, Murray Hill, NJ. SIAM Journal on Computing, 6(3), 446-478.
Kumar, A., & Singh, R. (2023). A hybrid approach for optimizing truck routes using K-means clustering and genetic algo-rithms. Journal of Transportation Management, 35(2), 29-45.
Lee, J., Kim, S., & Park, C. (2022). Evaluating clustering techniques for logistics optimization: A comparative study. Journal of Retailing and Consumer Services, 67, 102899.
Patel, S., & Desai, R. (2023). Dynamic truck assignment using K-means clustering and real-time data analysis. Transportation Research Part E: Logistics and Transportation Review, 169, 102892.
Rosenkrantz, D. J., Stearns, R. E., & Lewis, P. M. (1977). An Analysis of Several Heuristics for the Traveling Salesman Prob-lem. SIAM Journal on Computing, 6(3), 563-581.
Yadav, V., Srivastava, R., & Sharma, A. (2023). Market segmentation for logistics optimization using K-means cluster-ing. Journal of Business Research, 150, 121-135.