Abstract
DIn the digital transformation of industrial sectors, data is a high-value business asset. How companies manage data between systems within the organization or through networks of business partners impacts their competitive factor. Technological maturity may imply several adversities, such as the lack of interoperability standards for simple and transparent data exchange. This paper presents an architecture that enables secure exchanges of supply chain orders between textile and clothing companies. This architecture is based on Electronic Business (eBIZ) 4.0 and International Data Spaces (IDS) frameworks, fostering trust and widespread adoption of platforms in the industry sector, particularly when handling sensitive supply chain information. The architecture was implemented and validated in 3 use cases with Enterprise Resource Plannings (ERPs) from the same vendor, different vendors, and communication from a ERP to a Web portal. Implementing the proposed architecture impacted efficiency, transparency, and accountability within the supply chain network. The lead times for purchases, provisioning, and the number of additional information requests in the ordering were reduced. In subcontracting, a reduction in non-conformities and an overall improvement in delivery times were verified. Moreover, logistics operations and communication with subcontractors were optimized, leading to faster order reception and reducing informal contacts.

Abstract
This project was developed to improve the cost estimation process of new products within the Product Development Department of a furniture manufacturer. This work involved developing a methodology using Machine Learning (ML) models trained on products' existing data to predict the cost of new innovative ones based on similarities and given data. The ML models used were Linear Regression (LR), Light Gradient-Boosting Machine (LGBM), Random Forest (RF), and Support Vector Machine (SVM). The proposed methodology considers the estimation of the total cost of producing a product, which encompasses both material and operational costs. Throughout this project, several analyses were developed to identify and evaluate different independent variables that could explain the behaviour of these two cost components. The suitability of the different variables was studied by applying several ML models, and a set of functions that return an estimate of the cost as a function of these predictor variables was obtained. The proposed approach, which incorporates ML models into more complex variables to predict, resulted in a 19.29% reduction in estimation error.

Abstract
In online three-dimensional packing problems where items are received one by one and require immediate packing decisions without prior knowledge of upcoming items, considering the static stability constraint is crucial for safely packing each arriving item in real time. Unstable loading patterns can result in risks of potential damage to items, containers, and operators during loading/unloading operations. Nevertheless, static stability constraints have often been neglected or oversimplified in existing online heuristic methods in the literature, undermining the practical implementation of these methods in real-world scenarios. In this study, we analyze how different static stability constraints affect solutions' efficiency and cargo stability, aiming to provide valuable insights and develop heuristic algorithms for real-world online problems, thus increasing the applicability of this research field. To this end, we embedded four distinct static stability constraints in online heuristics, including full-base support, partial-base support, center-of-gravity polygon support, and novel partial-base polygon support. Evaluating the impact of these constraints on the efficiency of a wide range of heuristic methods on real instances showed that regarding the number of used bins, heuristics with polygon- based stabilities have superior performance against those under full-base and partial-base support stabilities. The static mechanical equilibriumapproach offers a necessary and sufficient condition for the cargo static stability, and we employed it as a benchmark in our study to assess the quality of the four studied stability constraints. Knowing the number of stable items under each of these constraints provides valuable managerial insight for decision-making in real-world online packing scenarios.

Abstract
In a survey of Belgian logistics service providers, the efficiency of first-mile pickup operations was identified as a key area for improvement, given the increasing number of returns in e-commerce, which has a significant impact on traffic congestion, carbon emissions, energy consumption and operational costs. However, the complexity of first-mile pickup operations, resulting from the small number of parcels to be collected at each pickup location, customer time windows, and the need to efficiently accommodate the highly heterogeneous cargo inside the vans, has hindered the development of real-world solution approaches. This article tackles this operational problem as a vehicle routing problem with time windows, time-dependent travel durations, and split pickups and integrates practical 3D container loading constraints such as vertical and horizontal stability as well as amore realistic reachability constraint to replace the classical Last In First Out (LIFO) constraint. To solve it, we propose a three-phase heuristic based on a savings constructive heuristic, an extreme point concept for the loading aspect and a General Variable Neighborhood Search as an improvement phase for both routing and packing. Numerical experiments are conducted to assess the performance of the algorithm on benchmark instances and new instances are tested to validate the positive managerial impacts oncost when allowing split pickups and on driver working duration when extending customer time windows. In addition, we show the impacts of considering the reachability constraint oncost and of the variation of speed during peak hours on schedule feasibility.

Abstract
Nowadays, the world's fishing fleet uses 20% more fuel to catch the same amount offish compared to 30 years ago. Addressing this negative environmental and economic performance is crucial due to stricter emission regulations, rising fuel costs, and predicted declines in fish biomass and body sizes due to climate change. Investment in more efficient engines, larger ships and better fuel has been the main response, but this is only feasible in the long term at high infrastructure cost. An alternative is to optimize operations such as the routing of a fleet, which is an extremely complex problem due to its dynamic (time-dependent) moving target characteristics. To date, no other scientific work has approached this problem in its full complexity, i.e., as a dynamic vehicle routing problem with multiple time windows and moving targets. In this paper, two bi-objective mixed linear integer programming (MIP) models are presented, one for the static variant and another for the time-dependent variant. The bi-objective approaches allow to trade off the economic (e.g., probability of high catches) and environmental (e.g., fuel consumption) objectives. To overcome the limitations of exact solutions of the MIP models, a greedy randomized adaptive search procedure for the multi-objective problem (MO-GRASP) is proposed. The computational experiments demonstrate the good performance of the MO-GRASP algorithm with clearly different results when the importance of each objective is varied. In addition, computational experiments conducted on historical data prove the feasibility of applying the MO-GRASP algorithm in a real context and explore the benefits of joint planning (collaborative approach) compared to a non-collaborative strategy. Collaborative approaches enable the definition of better routes that may select slightly worse fishing and planting areas (2.9%), but in exchange fora significant reduction in fuel consumption (17.3%) and time at sea (10.1%) compared to non-collaborative strategies. The final experiment examines the importance of the collaborative approach when the number of available drifting fishing aggregation devices (dFADs) per vessel is reduced.

Abstract
This study reflects the assumption that all links in a supply chain (SC) must share responsibility for socio-environmental issues. One of the main barriers to ensuring the sustainability of an SC is the difficulty in accessing partners' information, especially beyond the first tier. Due to the great geographical dispersion, large number of small companies, and, mainly, the growth of the fast fashion industry, the textile sector is recognised as a priority when it comes to social sustainability issues. Moreover, consumers are increasingly demanding information about the social footprint of products. Thus, this paper aims to contribute to a better understanding of how SC visibility can contribute to increasing the social sustainability of textile SCs. Using a longitudinal perspective and adopting mixed methods integrated into a design science strategy, we evaluate SC visibility in the context of two Portuguese textile supply chains, before and after the development of a technology-based solution.