Zarządzanie Innowacyjne w Gospodarce i Biznesie nr 2(43)/2026

ISSN 2391-5129


Jan Fudali https://orcid.org/0000-0002-7061-154X University of Lodz

e-mail: janfudali.poczta@gmail.com


Optimizing cargo space utilization in road transport with non time-dependent constraints

Optymalizacja wykorzystania przestrzeni ładunkowej w transporcie drogowym

z uwzględnieniem ograniczeń niezależnych od czasu

https://doi.org/10.25312/ziwgib.900


Abstract

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 al- gorithm maximizes freight value by consolidating compatible addi- tional 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 Ma- drid (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 Eu- ro-pallets with the nearest neighbour algorithm (Travelling Sales- person Problem, TSP) to identify the shortest route. Economic per- formance 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 prof- itability to 1.22 EUR/km, representing a 22% improvement over the baseline value of 1.00 EUR/km. The findings confirm that inte- grating Knapsack and TSP algorithms under structural vehicle con- straints can improve transport profitability and resource efficiency without fleet expansion.

Keywords: road transport, cargo space optimization, transport management, sustainable logistics


Streszczenie

Celem badania jest ocena skuteczności dwuetapowego algorytmu optymalizacyjnego wspomagającego planowanie przestrzeni ładun- kowej w międzynarodowym transporcie drogowym z uwzględnie- niem fizycznych ograniczeń niezależnych od czasu. Algorytm mak- symalizuje wartość przewożonego frachtu poprzez konsolidację kompatybilnych ładunków dodatkowych w granicach limitów masy i objętości oraz wyznacza optymalną kolejność dostaw. Zastosowa- no podejście teoretyczno-empiryczne oparte na studium przypadku przewozu z Madrytu (Hiszpania) do Warszawy (Polska). Metodolo- gia łączy wielowymiarowy problem plecakowy (Knapsack Problem), służący do wyboru dopuszczalnych ładunków przy maksymalnej ładowności 24 ton i pojemności 33 europalet, z algorytmem naj- bliższego sąsiada (problem komiwojażera – TSP) wyznaczającym najkrótszą trasę. Efektywność ekonomiczną oceniono za pomocą wskaźnika EUR/km. Wyniki wykazały, że algorytm skutecznie eli- minuje ryzyko przeciążenia i zjawiska „cubing out”, osiągając wy- korzystanie 97% objętości oraz 64,5% ładowności. Optymalny wa- riant zwiększył rentowność do 1,22 EUR/km, czyli o 22% względem wartości bazowej 1,00 EUR/km. Uzyskane wyniki potwierdzają, że integracja algorytmów problemu plecakowego i TSP zwiększa rentowność transportu oraz efektywność wykorzystania zasobów bez konieczności rozbudowy floty.

Słowa kluczowe: transport drogowy, optymalizacja przestrzeni ła- dunkowej, zarządzania transportem, logistyka zrównoważona


Introduction

Road freight transport remains the indispensable backbone of European supply chains, yet the sector operates under unprecedented economic and environmental pressures. Fluctuating fuel costs, chronic driver shortages, and tightening regulatory frameworks aimed at reducing greenhouse gas emissions – such as the European Green Deal – force transport enterprises to seek internal operational reserves (Piecyk, McKinnon, 2010; The European Green Deal. Communication from the Commission to the European Parlia- ment, the European Council, the Council, the European Economic and Social Committee and the Committee of the Regions, COM(2019) 640 final, 2019). Maximizing the uti- lization of existing transport assets has emerged as one of the most effective strategies to protect profit margins and meet sustainability targets without requiring capital-intensive fleet expansions (Fajczak-Kowalska, Tokarski, 2023).

While temporal requirements often dictate the rhythm of modern supply chains, the ul- timate limits of transport efficiency are rigidly defined by physical and spatial boundaries (McKinnon et al., 2015). In road freight operations, ignoring non time-dependent con- straints – such as weight limits, volumetric capacity, cargo geometry, and stackability – frequently leads to the phenomenon of “cubing out” (running out of space before reaching the weight limit) or overloading.


In everyday operational practice, particularly within the Less-than-Truckload (LTL) and partial load segments, dispatchers frequently rely on intuition, manual calcula- tions, and heuristic experience to match base loads with supplementary freight. However, human-driven consolidation processes struggle to process multidimensional variables efficiently (Crainic, Laporte, 1997). This often results in suboptimal vehicle fill rates, unutilized cargo space, and missed revenue opportunities, inadvertently contributing to the high percentage of empty or partially empty miles in European transport networks (Savy, Burnham, 2013).

The optimization of cargo space without the strict pressure of delivery time windows shifts the operational focus from scheduling to advanced multi-dimensional space man- agement, which has become a critical element in the sustainable development of modern manufacturing and logistics enterprises (Tokarski, Łuczak, 2023). In this context, deci- sion-makers face a variation of the classic Knapsack Problem, where the objective is to maximize the total freight value by consolidating compatible additional loads, strictly within the legal and technical limits of the vehicle (Martello, Toth, 1990; Crainic, 2000). This paper addresses the challenge of maximizing the utilization of standard heavy goods vehicles (HGV) by applying algorithmic selection of partial loads based on weight, Euro-pallet (EP) volume, and subsequent route sequencing to minimize the total distance. By combining a multi-dimensional Knapsack algorithm with the Travelling Salesperson Problem (TSP), this study provides a practical, data-driven framework that bridges the gap between theoretical operations research and daily dispatching tasks, proving that relatively simple mathematical models can yield significant economic and environmental dividends.


Methodology

The methodological foundations, including the basic optimization model and the research environment, have been thoroughly presented in the first part of this study (Fudali, 2026). Therefore, this section directly introduces the extension of the model to account for non time-dependent constraints, such as vehicle weight capacity and spatial dimensions.

The optimization process in this phase is divided into two distinct algorithms:

  1. The Selection Phase (Multi-dimensional Knapsack Problem): The algorithm evaluates a pool of potential partial loads. The objective is to maximize the total financial value of the cargo (ci), subject to the absolute constraints of the vehicle’s maximum payload (Wmax) and volumetric capacity (Qmax). For a standard Europe- an semi-trailer, the constraints are defined as Wmax = 24 tons and Qmax = 33 EP. The selection is mathematically governed by the following conditions:

    �

    � ��𝑥𝑥� → max

    ���

    �

    � ��𝑥𝑥� � �max

    ���

    (1)


    (2)


    �

    � ��𝑥𝑥� � � max

    ���


    (3)


    (where wi is the weight, qi is the volume in EP, and xi {0,1} is the binary decision variable).

  2. The Routing Phase (Travelling Salesperson Problem – TSP): Once the optimal set of loads is selected, the algorithm determines the shortest possible sequence connecting the loading and unloading points (Dantzig, Fulkerson, Johnson, 1954). Because time windows are ignored in this variant, the routing sequence is heavily influenced by physical cargo handling constraints, particularly the LIFO (Last In, First Out) rule, to minimize the need to unload and reload cargo during transit.

    The integration of these two phases creates a comprehensive decision-support framework. While the selection phase guarantees that the vehicle’s structural and le- gal boundaries are not breached, the routing phase ensures the operational feasibility of the transport task. Ultimately, the effectiveness of this combined approach is assessed using the freight-to-distance profitability indicator (EUR/km), which serves as the primary metric for comparing the optimized consolidation against a baseline single-load scenario in the subsequent analysis.


    Results

    The application of the two-stage algorithm to the empirical dataset yielded significant operational improvements. The algorithm evaluated a diverse pool of clients and identified an optimal consolidation variant that included the main load (Gerber) and supplementary loads (Lello, Jardin, Parmentier, Europalleten), rejecting loads that would violate physical constraints (e.g., Multiusos, which alone required 24 t and 33 EP). The detailed selection process is presented in table 1.


    Tab. 1. Logistics parameters and optimization results for main and supplementary loads

    Client

    Order value (€)

    Weight (t)

    Volume (EP)

    Selection status

    Lello

    1000

    5.0

    4

    Selected (1)

    Getafe

    1200

    8.0

    18

    Rejected (0)

    Multiusos

    2500

    24.0

    33

    Rejected (0)

    Reze

    1000

    15.0

    15

    Rejected (0)

    Jardin

    400

    2.0

    5

    Selected (1)

    Parmentier

    650

    1.0

    10

    Selected (1)

    Europalleten

    300

    1.5

    5

    Selected (1)

    Aegi

    500

    9.0

    9

    Rejected (0)

    Nasser

    750

    12.0

    13

    Rejected (0)

    Posnania

    200

    8.0

    10

    Rejected (0)


    Client

    Order value (€)

    Weight (t)

    Volume (EP)

    Selection status

    Aurora

    400

    4.0

    7

    Rejected (0)

    ABC

    400

    13.0

    15

    Rejected (0)

    Gerber (Main)

    2875

    6.0

    8

    Selected (1)

    TOTAL / LIMIT

    5225

    15.5 / 24.0 t

    32 / 33 EP

    Constraints met

    Source: own elaboration.


    The consolidation process resulted in the following utilization metrics:


extended the total route distance to 4273 km, the final profitability indicator im- proved significantly to 1.22 EUR/km.


Tab. 4. Comparison of economic efficiency indicators before and after optimization

Scenario

Total revenue (€)

Total distance (km)

Profitability indicator (€/km)

Baseline (main

load only)

2875

2875

1.00

Optimized (with

additional loads)

5225

4273

1.22

Source: own elaboration.


This 22% increase in revenue per kilometre clearly demonstrates that the marginal cost of extending the route (additional distance) is vastly outweighed by the margin- al revenue generated by filling the previously empty cargo space. Specifically, an anal- ysis of the marginal values reveals that the additional 1398 kilometres driven to collect the supplementary loads generated an extra 2350 EUR. This translates to an impressive marginal profitability of 1.68 EUR/km for the diverted segments alone, which strongly pulls up the average profitability of the entire route.

Furthermore, this consolidation strategy significantly improves the absorption of fixed transport costs, such as driver wages, vehicle depreciation, and insurance, distributing them over a substantially larger revenue pool. Beyond the direct financial gains, maximizing the volumetric and weight fill rates directly reduces the carbon footprint per ton-kilometre. By preventing the dispatch of additional, partially empty vehicles to collect these supple- mentary loads, the optimized scenario strongly aligns with the principles of sustainable logistics and European environmental directives.


Conclusion

The findings of this study confirm that optimizing cargo space utilization through the rig- orous application of non time-dependent constraints generates substantial economic benefits. By focusing on the structural limits of the vehicle (weight and volume) rather than delivery schedules, transport companies can significantly increase their revenue per kilometre without expanding their fleets. Specifically, the empirical case study demon- strated a 22% improvement in the core profitability indicator, elevating the average rev- enue from the baseline 1.00 EUR/km to 1.22 EUR/km, while successfully maximizing the volumetric fill rate to 97%.

The algorithmic approach successfully prevents operational errors, such as exceeding the legal Gross Vehicle Weight (GVW) or miscalculating pallet space, which are common in manual dispatching. Furthermore, the analysis highlights that in typical consumer goods transport, volume (cube) is exhausted much faster than weight, emphasizing the need for tools that evaluate both parameters simultaneously. Additionally, by explicitly incor- porating physical cargo handling principles – such as the LIFO rule – during the routing


phase, the model eliminates inefficient mid-transit reloading, thereby reducing labor costs, loading dock times, and the risk of cargo damage.

Ultimately, integrating Knapsack and TSP algorithms into Transportation Management Systems (TMS) allows logistics operators to transition from intuition-based planning to da- ta-driven profitability, directly supporting both enterprise margins and the broader goals of resource efficiency and sustainable transport (Ivanov, Dolgui, Sokolov, 2019; Tokarski, Bielecki, 2024). This digital transition is fully aligned with the evolving logistics paradigms of industrial revolutions, where e-logistics tools become mandatory for operational survival (Bielecki, Galińska, Tokarski, 2024). From a managerial perspective, automating these complex, multidimensional calculations relieve dispatchers from tedious manual tasks, empowering them to focus on higher-value activities such as strategic network planning, exception management, and proactive customer relations.

Despite the significant operational improvements demonstrated, this study acknowl- edges certain limitations that outline avenues for future research. The current model operates under deterministic assumptions and assumes static spatial constraints (standard Euro-pallets). Future studies should aim to integrate the non time-dependent physical constraints explored in this paper (weight, volume, LIFO) with the time-dependent vari- ables analysed in the previous phase of this research (strict delivery windows), creating a holistic Vehicle Routing Problem with Time Windows and 3D Loading Constraints (3L-CVRPTW) (Iori, Salazar-González, Vigo, 2007; Gendreau et al., 2008). Furthermore, incorporating stochastic elements – such as real-time order variations, fluctuating traffic conditions, or non-standard cargo geometries – would further bridge the gap between the- oretical operations research and the dynamic reality of modern supply chains (Ritzinger, Puchinger, Hartl, 2016).


References

Bielecki M., Galińska B., Tokarski D. (2024), Determinants and trends of logistics paradigms in industrial revolutions, “Economics and Environment”, vol. 90(3), pp. 1–14, https://doi. org/10.34659/eis.2024.90.3.780

Crainic T.G. (2000), Service network design in freight transportation, “European Jour- nal of Operational Research”, vol. 122(2), pp. 272–288, https://doi.org/10.1016/S0377- 2217(99)00233-7

Crainic T.G., Laporte G. (1997), Planning models for freight transportation, “European Journal of Operational Research”, vol. 97(3), pp. 409–438, https://doi.org/10.1016/S0377- 2217(96)00298-6

Dantzig G., Fulkerson R., Johnson S. (1954), Solution of a large-scale traveling-salesman problem, “Journal of the Operations Research Society of America”, vol. 2(4), pp. 393–410, https://doi.org/10.1287/opre.2.4.393

The European Green Deal. Communication from the Commission to the European Parlia- ment, the European Council, the Council, the European Economic and Social Committee and the Committee of the Regions, COM(2019) 640 final (2019).


Fajczak-Kowalska A., Tokarski D. (2023), Analysis of transport efficiency in Poland on the example of cargo transport, “Scientific Papers of Silesian University of Technology. Organization and Management Series”, vol. 188, pp. 57–73, https://doi.org/10.29119/1641- 3466.2023.188.5

Fudali J. (2026), Optimizing cargo space utilization in road transport with time-dependent constraints, “Zarządzanie Innowacyjne w Gospodarce i Biznesie”, nr 1(42), pp. 129–141, https://doi.org/10.25312/ziwgib.867

Gendreau M., Iori M., Laporte G., Martello S. (2008), A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints, “Networks”, vol. 51(1), pp. 4–18, https://doi.org/10.1002/net.20192

Iori M., Salazar-González J.J., Vigo D. (2007), An exact approach for the vehicle routing problem with two-dimensional loading constraints, “Transportation Science”, vol. 41(2),

pp. 253–264, https://doi.org/10.1287/trsc.1060.0169

Ivanov D., Dolgui A., Sokolov B. (2019), The impact of digital technology and Industry 4.0 on the ripple effect and supply chain risk analytics, “International Journal of Production Re- search”, vol. 57(3), pp. 829–846, https://doi.org/10.1080/00207543.2018.1488086

Martello S., Toth P. (1990), Knapsack problems: Algorithms and computer implementations, Chichester: John Wiley & Sons Ltd.

McKinnon A., Browne M., Whiteing A., Piecyk M. (2015), Green logistics: Improving the environmental sustainability of logistics, London: Kogan Page.

Piecyk M.I., McKinnon A.C. (2010), Forecasting the carbon footprint of road freight transport in 2020, “International Journal of Production Economics”, vol. 128(1), pp. 31–42, https://doi. org/10.1016/j.ijpe.2009.08.027

Ritzinger U., Puchinger J., Hartl R.F. (2016), A survey on dynamic and stochastic vehicle routing problems, “International Journal of Production Research”, vol. 54(1), pp. 215–231, https://doi.org/10.1080/00207543.2015.1043403

Savy M., Burnham J. (2013), Freight transport and the modern economy, New York: Routledge

Tokarski D., Bielecki M. (2024), Conditions and possibilities of using e-logistics in ma- nufacturing enterprises, “Economics and Environment”, vol. 88(1), pp. 1–11, https://doi. org/10.34659/eis.2024.88.1.725

Tokarski D., Łuczak Ł. (2023), Optimization of logistics processes in the sustainable develop- ment of manufacturing enterprises, “Scientific Papers of Silesian University of Technology. Organization and Management Series”, vol. 178, pp. 683–692, https://doi.org/10.29119/1641- 3466.2023.178.37


About the Author

Jan Fudali – holds a master’s degree in logistics in the economy from the Faculty of Economics and Sociology, University of Lodz.


O autorze

Jan Fudali – absolwent studiów magisterskich na kierunku logisty- ka w gospodarce, na Wydziale Ekonomiczno-Socjologicznym Uni- wersytetu Łódzkiego.


Ten utwór jest dostępny na licencji Creative Commons Uznanie autorstwa-Na tych samych warunkach 4.0 Międzynarodowe.

  137