Full text

Turn on search term navigation

© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.

Abstract

This study compares time-based and quantity-based consolidation strategies within the Vehicle Routing Problem (VRP) framework to optimize supplier profitability and logistical efficiency. The time-based model consolidates deliveries at fixed intervals, offering predictable routes, reduced customer wait times, and cost efficiency in stable markets. Conversely, the quantity-based model dynamically adjusts delivery volumes to meet fluctuating demand, providing flexibility in dynamic environments but potentially increasing long-term costs due to logistical complexity. Using a mixed-integer linear programming (MILP) model, sensitivity analyses, and scenario-based experiments, the study demonstrates that the time-based model excels in stable conditions, while the quantity-based model performs better in highly variable demand scenarios. These findings provide actionable insights for selecting consolidation strategies that optimize delivery operations and enhance supply chain performance based on market dynamics.

Details

Title
Data-Driven Order Consolidation with Vehicle Routing Optimization
Author
Yang, Changhee 1 ; Lee, Yongjin 1   VIAFID ORCID Logo  ; Lee, Chulung 2   VIAFID ORCID Logo 

 Department of Industrial and Management Engineering, Korea University, 145 Anam-ro, Seongbuk-gu, Seoul 02841, Republic of Korea 
 School of Industrial and Management Engineering, Korea University, 145 Anam-ro, Seongbuk-gu, Seoul 02841, Republic of Korea 
First page
848
Publication year
2025
Publication date
2025
Publisher
MDPI AG
e-ISSN
20711050
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
3165907731
Copyright
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.