Optimization of last-mile delivery in KSA
Industrial Engineering program, Department of Mechanical Engineering, College of Engineering, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia.
Research Article
International Journal of Science and Technology Research Archive, 2025, 08(01), 118-129.
Article DOI: 10.53771/ijstra.2025.8.1.0029
Publication history:
Received on 13 January 2024; revised on 12 March 2025 accepted on 14 March 2025
Abstract:
The last-mile delivery of e-commerce orders is a critical challenge for logistics companies in Saudi Arabia. This study has demonstrated the importance of optimizing the last-mile delivery process for logistics companies in Taif city to enhance their competitiveness and meet the growing demand to achieve customer's satisfaction. The research found that logistics companies in Saudi Arabia struggle to meet customer demand on time while maintaining cost-efficiency. A survey of logistics customers and a case study of one Logistics Company supported this conclusion. The study identified the lack of proper routing planning as the main cause of delays and developed a mathematical model and a Python program to address this issue. By implementing these solutions, we were able to find feasible solutions to the challenges faced by logistics companies, including optimizing the delivery routes and reducing transportation costs. The mathematical model and the Python program provided feasible solutions that reduced the total distance traveled by delivery vehicles by 17.21% and 162 km, respectively, resulting in significant cost and timesaving. The study demonstrates that optimizing delivery processes can significantly improve the efficiency and reliability of operations and reduce fuel costs. These findings provide valuable insights for future supply chain - management strategies and initiatives.
Keywords:
Last-mile delivery; E-commerce; Mathematical model; Vehicle Route; Python Programming
Full text article in PDF:
Copyright information:
Copyright © 2025 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution Liscense 4.0