Coordinated Truck Loading and Routing Problem: A Forestry Logistics Case Study
Journal
Mathematics
ISSN
2227-7390
Date Issued
2025-08-07
Author(s)
Type
journal-article
Abstract
<jats:p>This study addresses a real-world logistics problem in forestry operations: the distribution of plants from cultivation centers to planting sites under strict delivery time windows and limited depot resources. We introduce the Coordinated Truck Loading and Routing Problem (CTLRP), an extension of the classical Vehicle Routing Problem with Time Windows (VRPTW) that integrates routing decisions with truck loading schedules at a single depot with constrained capacity. To solve this NP-hard problem, we develop a metaheuristic algorithm based on Ant Colony Optimization (ACO), enhanced with a global memory system and a novel stochastic return rule that allows trucks to return to the depot when additional deliveries are suboptimal. Parameter calibration experiments are conducted to determine optimal values for the return probability and ant population size. The algorithm is tested on a real forestry dispatch scenario over six working days. The results show that an Ant Colony System (ACS–CTLRP) algorithm reduces total distance traveled by 23%, travel time by 22%, and the number of trucks used by 13 units, while increasing fleet utilization from 54% to 83%. These findings demonstrate that the proposed method significantly outperforms current company planning and offers a transferable framework for depot-constrained routing problems in time-sensitive distribution environments.</jats:p>
Cite this document
Oliva, C., Cepeda, M., & Muñoz-Herrera, S. (2025). Coordinated truck loading and routing problem: A forestry logistics case study. Mathematics, 13(15), 2537. https://doi.org/10.3390/math13152537