This thesis is part of a broader research project aimed at developing a mathematical model that integrates two NP-hard problems: the Service Network Design (SND) and the Bin Packing Problem (BPP). The goal is to analyse the economic and logistical benefits of such integration. The existing literature includes only a limited number of studies on the integration of the Scheduled Service Network Design (SSND) with the Bin Packing Problem (BPP), leaving a significant gap. Recent contributions have begun to explore the impact of demand loading rules on vehicles and packing constraints in intermodal transport (Kienzle et al., 2024; Morganti et al., 2020), as well as the challenges and advantages of integrating such constraints into network capacity planning (Bruni et al., 2023).