Search

The global iron ore price is influenced by numerous factors, thus showcasing a complex interplay among them. The collective expectations of market participants over time shape the variations and trends within the iron ore price time series. Consequently, devising a robust forecasting model for the volatility of iron ore prices, as well as for other assets connected to this commodity, is critical for guiding future investments and decision-making processes in mining companies. Within this framework, the integration of artificial intelligence techniques, encompassing both technical and fundamental analyses, is aimed at developing a comprehensive, autonomous hybrid system for decision support, which is specialized in iron ore asset management. This approach not only enhances the accuracy of predictions but also supports strategic planning in the mining sector.

The Analytic Hierarchy Process (AHP) multicriteria method can be cognitively demanding for large-scale decision problems due to the requirement for the decision maker to make pairwise evaluations of all alternatives. To address this issue, this paper presents an interactive method that uses online learning to provide scalability for AHP. The proposed method involves a machine learning algorithm that learns the decision maker’s preferences through evaluations of small subsets of solutions, and guides the search for the optimal solution. The methodology was tested on four optimization problems with different surfaces to validate the results. We conducted a one factor at a time experimentation of each hyperparameter implemented, such as the number of alternatives to query the decision maker, the learner method, and the strategies for solution selection and recommendation. The results demonstrate that the model is able to learn the utility function that characterizes the decision maker in approximately 15 iterations with only a few comparisons, resulting in significant time and cognitive effort savings. The initial subset of solutions can be chosen randomly or from a cluster. The subsequent ones are recommended during the iterative process, with the best selection strategy depending on the problem type. Recommendation based solely on the smallest Euclidean or Cosine distances reveals better results on linear problems. The proposed methodology can also easily incorporate new parameters and multicriteria methods based on pairwise comparisons.

Data and information visualization have drawn an increasingly wide range of interest from several academic fields and industries. Concurrently, exploring a huge set of data to support feasible decisions needs an organized method of Multi-Criteria Decision Making (MCDM). The dramatic increasing of data producing during the past decade makes visualization necessary as a presentation layer on the top of MCDM process. This study aims to propose an integrated strategy to rank the alternatives in the dataset, by combining data, MCDM methods, and visualization layers. In fact, the well designed combination of Information Visualization and MCDM provides a more user-friendly approach than the traditional methods. We investigate a case study in bibliometric analyses, which have become an important dimension and tool for evaluating the impact and performance of researchers, departments, and universities. Hence, finding the best and most reliable papers, authors, and publishers considering diverse criteria is one of the important challenges in science world. Therefore, this text is presenting a new strategy on the bibliometric dataset as a case study and it demonstrates that this strategy can be more meaningful for the end users than the current tools. Finally, the presented simulations illustrate the performance and utilization of this combination. In other words, the researchers of this study could design and implement a tool that overcomes the biggest challenges of data analyzing and ranking via a combination of MCDM and visualization methodologies that can provide a tremendous amount of insight and information from a massive dataset in an efficient way.

Este artículo presenta una técnica híbrida para resolver la programación del mantenimiento de las unidades de generación coordinado con el despacho hidrotérmico de mediano plazo. La solución se basa en el algoritmo genético de Chu-Beasley y en la técnica de programación lineal. Tiene en cuenta no linealidades derivadas del costo de los combustibles utilizados por las centrales térmicas. La salida del algoritmo genético es una propuesta de la semana de inicio del plan de mantenimiento de cada unidad de generación que minimiza el costo del despacho hidrotérmico. Las dos principales contribuciones de este trabajo son que propone un modelo matemático que coordina dos problemas que en la literatura se han resuelto de forma separada, y que aplica un algoritmo genético especializado que aún no ha sido utilizado para resolver el problema coordinado. El sistema de prueba para validar la metodología se compone de tres centrales hidroeléctricas y dos centrales térmicas dividas en 22 unidades de generación, teniendo en cuenta el mantenimiento preventivo, en un horizonte de planeamiento de un año (52 semanas). Esta metodología combina una técnica exacta con un algoritmo genético especializado, lo que favorece la convergencia.