Lim, H, Lee, GM and Singgih, IK (2021) Multi-Depot Split-Delivery Vehicle Routing Problem. IEEE Access, 9. pp. 112206-112220.

Preview

Text Multi-Depot Split-Delivery Vehicle Routing Problem.pdf - Published Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (1MB) | Preview

Abstract

The rapid advancements in information technologies and globalization change the way of distributing goods to customers. Many enterprises have multiple factories, warehouses, and distribution centers and strive for competitive efficiency in the distribution operations to minimize transportation costs. This study proposed the mixed-integer programming (MIP) model for the multi-depot split-delivery vehicle routing problems (MDSDVRPs) with hetero vehicles, allowing multiple visits to a customer. A genetic algorithm (GA) with a novel two-dimensional chromosome representation has been proposed with dynamic mutation policies. The process parameters of the proposed GA are optimized using the Taguchi method. The proposed algorithms showed the benefits of split-delivery in MDSDVRPs and showed the competitive performance even for the classical single-depot vehicle routing problems with no split-delivery.

Item Type:	Article
Uncontrolled Keywords:	08 Information and Computing Sciences; 09 Engineering; 10 Technology
Subjects:	H Social Sciences > HE Transportation and Communications H Social Sciences > HF Commerce > HF5001 Business > HF5410 Marketing. Distribution of Products T Technology > T Technology (General) T Technology > T Technology (General) > T58.5 Information Technology
Divisions:	Computer Science and Mathematics
Publisher:	Institute of Electrical and Electronics Engineers (IEEE)
SWORD Depositor:	A Symplectic
Date Deposited:	10 Jan 2025 12:45
Last Modified:	10 Jan 2025 12:45
DOI or ID number:	10.1109/access.2021.3103640
URI:	https://researchonline.ljmu.ac.uk/id/eprint/25240

View Item