scispace - formally typeset
Search or ask a question

Showing papers by "Eduardo Álvarez-Miranda published in 2021"


Journal ArticleDOI
TL;DR: This work proposes a new problem (the parallel station assembly line balancing problem or PSALBP) in which the objective is to minimise the number of parallel stations required to obtain the maximum theoretical efficiency of the assembly process.
Abstract: The simple assembly line balancing problem (SALBP) considers work division among different workstations of a serially arranged assembly process to maximise its efficiency under workload (cumulative...

11 citations


Journal ArticleDOI
15 Oct 2021
TL;DR: In this paper, the authors used machine learning models over two Chilean universities to predict first-year engineering student dropout over enrolled students, and to analyze the variables that affect the probability of dropout.
Abstract: Student dropout, defined as the abandonment of a high education program before obtaining the degree without reincorporation, is a problem that affects every higher education institution in the world. This study uses machine learning models over two Chilean universities to predict first-year engineering student dropout over enrolled students, and to analyze the variables that affect the probability of dropout. The results show that instead of combining the datasets into a single dataset, it is better to apply a model per university. Moreover, among the eight machine learning models tested over the datasets, gradient-boosting decision trees reports the best model. Further analyses of the interpretative models show that a higher score in almost any entrance university test decreases the probability of dropout, the most important variable being the mathematical test. One exception is the language test, where a higher score increases the probability of dropout.

8 citations


Journal ArticleDOI
TL;DR: In this paper, a generalized reserve set covering problem with connectivity and buffer requirements is introduced, and a solution framework based on Integer Linear Programming and branch-and-cut is developed.

7 citations


Journal ArticleDOI
13 May 2021
TL;DR: A decision-support system designed for the prioritization of surgical waiting lists based on biopsychosocial criteria that outperforms the previous prioritization method quantitatively and qualitatively and allows a decrease in the average number of days in the waiting list.
Abstract: Currently, in Chile, more than a quarter-million of patients are waiting for an elective surgical intervention. This is a worldwide reality, and it occurs as the demand for healthcare is vastly superior to the clinical resources in public systems. Moreover, this phenomenon has worsened due to the COVID-19 sanitary crisis. In order to reduce the impact of this situation, patients in the waiting lists are ranked according to a priority. However, the existing prioritization strategies are not necessarily systematized, and they usually respond only to clinical criteria, excluding other dimensions such as the personal and social context of patients. In this paper, we present a decision-support system designed for the prioritization of surgical waiting lists based on biopsychosocial criteria. The proposed system features three methodological contributions; first, an ad-hoc medical record form that captures the biopsychosocial condition of the patients; second, a dynamic scoring scheme that recognizes that patients’ conditions evolve differently while waiting for the required elective surgery; and third, a methodology for prioritizing and selecting patients based on the corresponding dynamic scores and additional clinical criteria. The designed decision-support system was implemented in the otorhinolaryngology unit in the Hospital of Talca, Chile, in 2018. When compared to the previous prioritization methodology, the results obtained from the use of the system during 2018 and 2019 show that this new methodology outperforms the previous prioritization method quantitatively and qualitatively. As a matter of fact, the designed system allowed a decrease, from 2017 to 2019, in the average number of days in the waiting list from 462 to 282 days.

7 citations


Journal ArticleDOI
TL;DR: The study reveals that the exact solution algorithms are up to 500 times faster compared to previous exact approaches and instances with up to 125 vertices can be solved to optimality within a timelimit of 1800 seconds.

5 citations


Journal ArticleDOI
01 Aug 2021-Energy
TL;DR: In this article, a decision aid framework based on mixed integer programming is presented for supporting long-term decision-making when planning (the expansion of existing) energy systems, which relies on heuristically solving an optimization problem coined as the Generation, transmission and storage location and sizing of operation-aware sustainable power system design problem.

5 citations


Journal ArticleDOI
04 Sep 2021
TL;DR: This study proposes a novel hybrid method to solve the simple version of the assembly line balancing problem in which the number of stations is fixed, a problem known as SALBP-2.
Abstract: The assembly line balancing problem is a classical optimisation problem whose objective is to assign each production task to one of the stations on the assembly line so that the total efficiency of the line is maximized. This study proposes a novel hybrid method to solve the simple version of the problem in which the number of stations is fixed, a problem known as SALBP-2. The hybrid differs from previous approaches by encoding individuals of a genetic algorithm as instances of a modified problem that contains only a subset of the solutions to the original formulation. These individuals are decoded to feasible solutions of the original problem during fitness evaluation in which the resolution of the modified problem is conducted using a dynamic programming based approach that uses new bounds to reduce its state space. Computational experiments show the efficiency of the method as it is able to obtain several new best-known solutions for some of the benchmark instances used in the literature for comparison purposes.

5 citations


Journal ArticleDOI
02 Apr 2021
TL;DR: In this paper, the influence of the political profile of candidates and their campaign effort (characterized by electoral expenditure and by territorial deployment strategies retrieved from social networks activity) on the electoral results was analyzed by using three of the most frequent data analyitcs algorithms.
Abstract: In recent years, a wide range of techniques has been developed to predict electoral results and to measure the influence of different factors in these results. In this paper, we analyze the influence of the political profile of candidates (characterized by personal and political features) and their campaign effort (characterized by electoral expenditure and by territorial deployment strategies retrieved from social networks activity) on the electoral results. This analysis is carried out by using three of the most frequent data analyitcs algorithms in the literature. For our analysis, we consider the 2017 Parliamentary elections in Chile, which are the first elections after a major reform of the electoral system, that encompassed a transition from a binomial to a proportional system, a modification of the districts’ structure, an increase in the number of seats, and the requirement of gender parity in the lists of the different coalitions. The obtained results reveal that, regardless of the political coalition, the electoral experience of candidates, in particular in the same seat they are running for (even when the corresponding district is modified), is by large the most influential factor to explain the electoral results. However, the attained results show that the influence of other features, such as campaign expenditures, depends on the political coalition. Additionally, by means of a simulation procedure, we show how different levels of territorial deployment efforts might impact on the results of candidates. This procedure could be used by parties and coalitions when planning their campaign strategies.

2 citations