Abstract
Optimising operations in bulk cargo ports is of great relevance due to their major participation in international trade. In inbound operations, which are critical to meet due dates, the product typically arrives by train and must be transferred to the stockyard. This process requires several machines and is subject to frequent disruptions leading to uncertain processing times. This work focuses on the scheduling problem of unloading the wagons to the stockyard, approaching both the deterministic and the stochastic versions. For the deterministic problem, we compare three solution approaches: a Mixed Integer Programming model, a Constraint Programming model and a Greedy Randomised algorithm. The selection rule of the latter is evolved by Genetic Programming. The stochastic version is tackled by dispatching rules, also evolved via Genetic Programming. The proposed approaches are validated using real data from a leading company in the mining sector. Results show that the new heuristic presents similar results to the company's algorithm in a considerably shorter computational time. Moreover, we perform extensive computational experiments to validate the methods on a wide spectrum of randomly generated instances. Finally, as managing uncertainty is fundamental for the effectiveness of these operations, distinct strategies are compared, ranging from purely predictive to completely reactive scheduling. We conclude that re-scheduling with high frequency is the best approach to avoid performance deterioration under schedule disruptions, and using the evolved dispatching rules incur fewer deviations from the original schedule.

Abstract
In the current competition environment, transportation costs continue to rise, causing a reduction in the profit margins of companies. There are several tools in the literature to support the planning of logistics activities, but individualised solutions are not yet effective. In this study, a linear programming model is proposed to jointly plan the demand fulfilment of two competing companies by encouraging the search for synergies that enhance collaboration in the use of existing resources. To demonstrate the validity of the proposed mode, a case study is carried out and the results obtained with the initiation of the collaboration are evaluated. In conclusion, the proposed model reduces the logistics costs by up to 13%, as well as decreases the carbon footprint by 37%. By focusing on optimising economic and environmental aspects, this approach serves as a guide for companies to promote collaborations and to facilitate decision making at a managerial level.

Abstract
To encourage customers to take a chance in finding the right product, retailers and marketplaces implement benevolent return policies that allow users to return items for free without a specific reason. These policies contribute to a high rate of returns, which result in high shipping costs for the retailer and a high environmental toll on the planet. This paper shows that these negative impacts can be significantly minimized if inventory is exchanged within the supplier network of marketplaces upon a return. We compare the performance of this proposal to the standard policy where items are always sent to the original supplier. Our results show that our proposal-returning to a closer supplier and using a predictive heuristic for fulfilment-can achieve a 16% cost reduction compared to the standard-returning to the original supplier and using a myopic rule for fulfilment.

Abstract
[No abstract available]

Abstract

Abstract
Data clustering combined with multiobjective optimization has become attractive when the structure and the number of clusters in a dataset are unknown. Data clustering is the main task of exploratory data mining and a standard statistical data analysis technique used in many fields, including machine learning, pattern recognition, image analysis, information retrieval, and bioinformatics. This project analyzes data to extract possible failure patterns in Solar Photovoltaic (PV) Panels. When managing PV Panels, preventive maintenance procedures focus on identifying and monitoring potential equipment problems. Failure patterns such as soiling, shadowing, and equipment damage can disturb the PV system from operating efficiently. We propose a multiobjective evolutionary algorithm that uses different distance functions to explore the conflicts between different perspectives of the problem. By the end, we obtain a non-dominated set, where each solution carries out information about a possible clustering structure. After that, we pursue a-posteriori analysis to exploit the knowledge of non-dominated solutions and enhance the fault detection process of PV panels.