Search

We know that SARS-Cov2 produces the new COVID-19 disease, which is one of the most dangerous pandemics of modern times. This pandemic has critical health and economic consequences, and even the health services of the large, powerful nations may be saturated. Thus, forecasting the number of infected persons in any country is essential for controlling the situation. In the literature, different forecasting methods have been published, attempting to solve the problem. However, a simple and accurate forecasting method is required for its implementation in any part of the world. This paper presents a precise and straightforward forecasting method named SVR-ESAR (Support Vector regression hybridized with the classical Exponential smoothing and ARIMA). We applied this method to the infected time series in four scenarios, which we have taken for the Github repository: the Whole World, China, the US, and Mexico. We compared our results with those of the literature showing the proposed method has the best accuracy. [ABSTRACT FROM AUTHOR]

The Job Shop Scheduling Problem (JSSP) arises in the context of high-performance computing and belongs to the NP-hard combinatorial optimization problems. The purpose of JSSP is to find the order of execution of a set of jobs on a group of machines, subject to certain precedence and resource availability constraints. The objective in this problem is minimizing the makespan that is the time elapsed from the starting time of the first job until the completion time of the last job. In this paper, a novel hybrid algorithm named AntGenSA for solving JSSP is proposed. AntGenSA uses Ant Colony System (ACS), Simulated Annealing (SA), and Genetic Algorithm (GA). To assess the performance of this algorithm, it is executed in a parallel computer, using a set of instances proposed by Fisher-Thompson, Yamada-Nakano, Taillard, Lawrence, and Applegate-Cook. The evaluation of this algorithm was performed mainly by the quality of the solution but the execution time was measuring as well. The experimental results show that the performance of the parallel execution of AntGenSA is highly competitive with the state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

This paper addresses the linear ordering problem, which has been solved using different metaheuristics approaches. These algorithms have the common problem of finding a proper balance of the intensification and diversification processes; in this work we propose an iterated local search in which it is incorporated a Becker heuristic strategy for constructing the initial solution, and a search strategy as perturbation process, achieving a better balance between intensification and diversification. The proposed algorithm obtained an improvement greater than 90%, decreasing the average percentage error respect the state of art ILS algorithm. The Wilcoxon nonparametric statistical test shows that the proposed algorithm significantly outperforms the iterated local search solution of the state of the art, ranking it among the top five solutions of the state of the art for the linear ordering problem. [ABSTRACT FROM AUTHOR]