Optimizing cargo space utilization in road transport with non time-dependent constraints
This article evaluates the effectiveness of a two-stage optimization algorithm supporting cargo space utilization in international road transport under non-time-dependent physical constraints. The algorithm maximizes freight value by consolidating compatible additional loads within weight and volume limits and then determines the optimal delivery sequence. A theoretical–empirical approach was applied using a case study of a transport operation from Madrid (Spain) to Warsaw (Poland). The methodology combines a multidimensional Knapsack Problem to select feasible loads based on a maximum payload of 24 tons and a capacity of 33 Euro-pallets with the nearest neighbour algorithm (Travelling Salesperson Problem, TSP) to identify the shortest route. Economic performance was assessed using the freight-to-distance ratio (EUR/km). The results demonstrate that the proposed approach prevents overloading and cubing out while achieving 97% volume utilization and 64.5% weight utilization. The optimal scenario increased profitability to 1.22 EUR/km, representing a 22% improvement over the baseline value of 1.00 EUR/km. The findings confirm that integrating Knapsack and TSP algorithms under structural vehicle constraints can improve transport profitability and resource efficiency without fleet expansion.
Authors
- Jan Fudali (ORCID: https://orcid.org/0000-0002-7061-154X)
Institutions
- University of Łódź (PL)
Publication Details
- Journal
- Zarządzanie Innowacyjne w Gospodarce i Biznesie
- Published
- 2026-11-16
- DOI
- https://doi.org/10.25312/ziwgib.900
- Primary Topic
- Vehicle Routing Optimization Methods
- Type
- article
- Field-Weighted Citation Impact
- 0.00