Abstract
Collaborative robots (cobots) are emerging in manufacturing as a response to the current mass customization production paradigm and the fifth industrial revolution. Before adopting this technology in production processes and benefiting from its advantages, manufacturers need to analyze the investment. Therefore, this study aims to develop a decision -making framework for cobot adoption, incorporating a comprehensive set of quantitative and qualitative criteria, to be used by decision -makers in manufacturing companies. To achieve that objective, a qualitative study was conducted by collecting data through interviews with key actors in the cobot (or advanced manufacturing technologies) adoption decision process in manufacturing companies. The main findings of this study include, firstly, an extensive list of decision criteria, as well as some indicators to be used by decisionmakers, some of which are new to the literature. Secondly, a decision -making framework for cobot adoption is proposed, as well as a set of guidelines to use it. The framework is based on a weighted scoring method and can be customizable by the manufacturing company depending on its specific context, needs, and resources. The main contribution of this study consists in assisting decision -makers of manufacturing companies in performing more complete and sustained decision analyses regarding cobots adoption.

Abstract
In this paper we present simulations for international kidney exchange programmes (KEPs). KEPs are organised in more than ten countries in Europe to facilitate the exchanges of immunologically incompatible donors. The matching runs are typically conducted in every three months for finding optimal exchanges using hierarchical optimisation with integer programming techniques. In recent years several European countries started to organise international exchanges using different collaboration policies. In this paper we conduct simulations for estimating the benefits of such collaborations with a simulator developed by the team of the ENCKEP COST Action. We conduct our simulations on generated datasets mimicking the practice of the three largest KEPs in Europe, the UK, Spanish and the Dutch programmes. Our main performance measure is the number of transplants compared to the number of registrations to the KEP pools over a 5-year period, however, as a novelty we also analyse how the optimisation criteria play a role in the lexicographic and weighted optimisation policies for these countries. Besides analysing the performances on a single instance, we also conduct large number of simulations to obtain robust findings on the performance of specific national programmes and on the possible benefits of international collaborations.

Abstract
This study estimates alighting stops and transfers from entry-only Automatic Fare Collection (AFC) data. The methodology adopted includes two main steps: an implementation of the Trip Chaining Method (TCM) to estimate the alighting stops from AFC records and the subsequent application of criteria for the identification of transfers. For each pair of consecutive AFC records on the same smart card, a transfer is identified considering a threshold for the walking distance, a threshold for the time required to perform an activity, and the validation of different boarding routes. This methodology was applied to the case study of Porto, Portugal, considering all trips performed by a set of 19999 smart cards over one year. The results of this methodology allied with visualization techniques allowed to study Origin-Destination (OD) patterns by type of day, seasonally, and by user frequency, each analyzed at the stop level and at the geographic area level.

Abstract
The implementation of novel regulatory and technical requirements for the distribution of vehicle axle weights in road freight transport introduces a new set of constraints on vehicle routing. Until now, axle weight distribution in determining the load plan for freight transport units has been overlooked in the vehicle routing process. Compliance with these axle weight constraints has become paramount for road freight transport companies, since noncompliance with the axle weight distribution legislation translates into heavy fines. This work aims to provide a tool capable of generating cargo loading plans and routing sequences for a palletised cargo distribution problem. The problem addressed integrates the capacitated vehicle routing problem with time window and the two-dimensional loading problem with load balance constraints. Two integrative solution approaches are proposed, one giving greater importance to the routing and the other prioritising the loading. In addition, a novel MILP model is proposed for the 2D pallet loading problem with load-balance constraints that take advantage of the standard dimension of the pallets. Extensive computational experiments were performed with a set of well-known literature benchmark instances, extended to incorporate additional features. The computational results show the effectiveness of the proposed approaches.

Abstract
Districting can reduce the complexities of delivery problems by segmenting its dimensions while facilitating drivers' familiarity with their work areas, fostering personal connections with customers, and enhancing satisfaction. This paper introduces and evaluates multiple heuristic approaches for route creation, to identify the most efficient method for intra and inter-districting routing. Out of 18 tested variants, the best-performing developed approach used a Lin-Khernigan-based heuristic, later converting it to a Shortest Hamiltonian Path in each district, creating inter-district connections to a hypothetical medoid in the next district to visit and utilizing asymmetric road distances. Although sub-optimal, the results obtained were satisfactory and the best components for route creation were identified. The models were developed and tested using real-world data from a parcel delivery company operating in the Porto metropolitan area of Portugal.

Abstract
[No abstract available]