Ponencia de congreso
URI permanente para esta colección
Examinar
Envíos recientes
Ítem Solo Metadatos Impact of COVID-19 on the GHG emissions of the Peruvian Interconnected Electrical System(Institute of Electrical and Electronics Engineers Inc., 2020)The COVID-19 pandemic has had an impact on the economy, industry, health, and key sectors in almost every country in the world. Electricity generation has been one of the sectors highly impacted by the national measures taken due to the pandemic. In Peru, a mandatory social quarantine was decreed that strongly impacted the demand and generation of electricity in the country.This paper studied the impact of social isolation measures, adopted by the COVID-19 pandemic, on greenhouse gas emissions (CO2, CH4, N2O) associated with the generation of electricity from the interconnected electricity system (SEIN) From Peru. A reduction in greenhouse gases of 1,599,285 tCO2e, equivalent to 60% with respect to the reference scenario, was estimated. © 2020 IEEE.Ítem Solo Metadatos Comparing predictive machine learning algorithms in Fit for Work occupational health assessments(Springer, 2020)Some studies have tried to develop predictors for fitness for work (FFW). This study assessed the question whether factors used in the occupational medical practice could predict an individual fit for work result. We used a Peruvian occupational medical examination dataset of 33347 participants. We obtained a reduced dataset of 2650. It was split into two subsets, a training dataset and a test dataset. Using the training dataset, logistic regression, decision tree, random forest, and support vector machine models were fitted, and important variables of each model were identified. Hyperparameter tuning was an important part in these non-parametric models. Also, the Area Under the Curve (AUC) metric was used for Model Selection with a 5-fold cross validation approach. The results shows the Logistic Regression as the most powerful predictor (AUC = 60.44%, Accuracy = 68.05%). It is important to notice the best variables analysis in fitness to work evaluation by a Random Forest approach. Thus, the best model was logistic regression. This also reveals that the criteria associated with the workplace and occupational clinical criteria have a low level of prediction. Further studies should be done with imbalanced data to process bigger datasets, in consequence to obtain more robust models. © Springer Nature Switzerland AG 2020.Ítem Solo Metadatos An assessment of DC/AC renewable energy microgrids for electrification of the peruvian amazonia using cluster analysis and GIS(Institute of Electrical and Electronics Engineers Inc., 2020)Peruvian Amazonia is one of the regions with the highest lack of access to electricity in the country. The inhabitants of this region either do not have access to electricity or are supplied by isolated thermal plants because the National Interconnected Electric System (SEIN) of Peru does not have coverage in this part of the country. Current rural electrification projects consist of expanding the grid, or implementing thermal plants or small PV systems. These systems are not economically feasible or do not provide reliable electricity to promote productive activities. Microgrids with high penetration of renewable energy are today technologically and operationally ready to provide these kinds of communities with electricity services. In this paper the economic feasibility of microgrids for electrification in the Peruvian Amazonia was studied by using the levelized cost of electricity (LCOE) as indicator. To study the technical and economic feasibility, communities were identified using georeferenced information; then, communities were classified using a clustering algorithm based on energy demand. The microgrids were sized for each of the 12 clusters obtained considering the characteristics of the country. Finally, the LCOE calculations of the microgrids were performed and compared with the LCOE of current thermal plants and photovoltaic systems. The LCOE obtained for the microgrids was around 210-240 USD / MWh, lower than the LCOE of current thermal plants (-300 USD / MWh) and small photovoltaic systems (210-574 USD / MWh). © 2020 IEEEÍtem Solo Metadatos Design of a mobile application for the vaccination registry of children under 5 years(Institute of Physics, 2022)Information and Communication Technologies are allowing to improve the development of certain processes optimizing the management of information for users, as in the case of the vaccination control process to digitize the use of the vaccination card, being very important for the registration of the administration of vaccines to the child during his five years. This information should be easily accessible and available to parents and health personnel during each stage of vaccination. In the present work we developed a mobile application called Children's Vaccine, with the purpose of registering and storing vaccine data (type, date and place of vaccination), as well as relevant information for the management of vaccines, the prototype developed was implemented in the health Center: Juan Pablo II Maternal and Child Center located in the District of Villa el Salvador, in Lima, Peru, in order to improve the quality of the service of attention. We present the results as performance tests to measure the influence of the application, this evaluation was carried out through an observation sheet with the comparison of records before and after the use of the application called "pre-test"and "post-test". This application is applicable and scalable for various health centers. © Published under licence by IOP Publishing Ltd.Ítem Solo Metadatos Effects of climate change on the surface waters of the Santa River, La Rinconada - Ancash – Peru(IOP Publishing Ltd, 2021)The effect of climate change on the surface waters of the Santa River, the town center la Rinconada, Ancash, Peru, was assessed. Climate change was modeled between 2006 - 2015, through temperature, precipitation, and historical evapotranspiration versus surface waters based on water availability, and the best regression equations were selected. A validated survey of users of the Rinconada Irrigation Commission (CRR) was also taken. The best equation was exponential type for surface water and average precipitation. In contrast, for surface water and climate change the most appropriate was multiple linear regression. In relation to the survey, 83.33% strongly agree that they are concerned about climate change, and 81.37% agree that they are fully prepared for climate change caused by high temperatures. 27.5 % strongly disagree that the amount of water available in the canals has decreased because of climate change. It is concluded that it is possible to predict water availability in the face of the presence of climate change by applying regression users equations, and that there is concern of CRR users, in the face of the presence of climate change. © Published under licence by IOP Publishing Ltd.Ítem Acceso Abierto Binary harmony search algorithm for solving set-covering problem(Springer Verlag, 2016) Salas, J.; Crawford, B.; Soto, R.; Rubio Á.G.; Jaramillo, A.; Mansilla Villablanca, S.; Olguín, E.This paper is intended to generate solutions to Set Covering Problem (SCP) through the use of a metaheuristic. The results were obtained using a variation of Harmony Search called Binary Global-Best Harmony Search Algorithm. To measure the effectiveness of the technique against other metaheuristics, Weasly benchmark was used. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto A black hole algorithm for solving the set covering problem(Springer Verlag, 2016) Soto, R.; Crawford, B.; Figueroa, I.; Niklander, S.; Olguín, E.The set covering problem is a classical optimization benchmark with many industrial applications such as production planning, assembly line balancing, and crew scheduling among several others. In this work, we solve such a problem by employing a recent nature-inspired metaheuristic based on the black hole phenomena. The core of such a metaheuristic is enhanced with the incorporation of transfer functions and discretization methods to handle the binary nature of the problem. We illustrate encouraging experimental results, where the proposed approach is capable to reach various global optimums for a well-known instance set from the Beasley’s OR-Library. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto A firefly algorithm to solve the manufacturing cell design problem(Springer Verlag, 2016) Soto, R.; Crawford, B.; Lama, J.; Paredes, F.The Manufacturing Cell Design Problem (MCDP) consists in creating an optimal design of production plants, through the creation of cells grouping machines that process parts of a given product. The goal is to reduce costs and increase productivity by minimizing movements and exchange of material between these cells. In this paper, we present a Firefly Algorithm (FA) to tackle this problem. The FA is a recent bio-inspired metaheuristic based on the mating behavior of fireflies that employ its flashing capabilities to communicate with each other or attract potential prey.We incorporate efficient transfer and discretization methods in order to suitable handle the binary domains of the problem. Interesting experimental results are illustrated where several global optimums are reached for a set of 90 well-known MCDP instances. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto Creativity in agile software development methods(Springer Verlag, 2015) Crawford, B.; Crawford, K.; Soto, R.; de la Barra, C.L.Creativity is an inherent aspect to the development of new products, therefore a critical capacity for software development. Indicators to measure creativity are grouped into two main areas: (1) those related to the creative result itself and its quality (including novelty and usefulness) and (2) those related to the creative team itself (considering indicators such as individual and group satisfaction, development of cognitive skills, group interaction,…). From this perspective, the aim of this work is to introduce some ideas for assesing the creativity of software products. © Springer International Publishing Switzerland 2015.Ítem Acceso Abierto A software project management problem solved by firefly algorithm(Springer Verlag, 2016) Crawford, B.; Soto, R.; Johnson, F.; Misra, S.; Olguín, E.In software project management there are several problems to deal, one of those is the Software Project Scheduling Problem (SPSP). This problem requires to assign a set of resources to tasks for a given project, trying to decrease the duration and cost of the whole project. The workers and their skills are the main resources in the project. In this paper we present the SPSP as a combinatorial optimization problem and a novel approach to solve SPSP by a Firefly algorithm. Firefly algorithm is a new metaheuristic based on the behaviour of the firefly. We present the design of the resolution model to solve the SPSP using an algorithm of fireflies and we illustrate some experimental results in order to demonstrate the viability and soundness of our approach. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto A filtering technique for helping to solve sudoku problems(Springer Verlag, 2015) Soto, R.; Crawford, B.; Galleguillos, C.; Crawford, K.; Paredes, F.This paper highlights the current usability issues when solving Sudoku problems. This problem is a well-known puzzle game which consists in assigning numbers in a game board, commonly of 9 × 9 size. The board of the game is composed of 9 columns, 9 rows and 9 3 × 3 sub-grids; each one containing 9 cells with distinct integers from 1 to 9. A game is completed when all cells have a value assigned, and the previous constraints are satisfied. Some instances are very difficult to solve, to tackle this issue, we have used a filtering technique named Arc Consistency 3 (AC3) from the Constraint Programming domain. This algorithm has revealed which is much related to the strategies employed by users in order to solve the Sudoku instances, but in contrast, this technique is executed in a short time, offering a good resolution guide to the users. In general, filtering techniques make easier solving Sudoku puzzles, providing good information to users for this. © Springer International Publishing Switzerland 2015.Ítem Acceso Abierto A beam-search approach to the set covering problem(Springer Verlag, 2016) Reyes, V.; Araya, I.; Crawford, B.; Soto, R.; Olguín, E.In this work we present a beam-search approach applied to the Set Covering Problem. The goal of this problem is to choose a subset of columns of minimal cost covering every row. Beam Search constructs a search tree by using a breadthfirst search strategy, however only a fixed number of nodes are kept and the rest are discarded. Even though original beam search has a deterministic nature, our proposal has some elements that makes it stochastic. This approach has been tested with a well-known set of 45 SCP benchmark instances from OR-Library showing promising results. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto Algoritmos Murciélago Binarios para el problema de cobertura de conjuntos [Binary bat algorithms for the set covering problem](Institute of Electrical and Electronics Engineers Inc., 2015) Crawford, B.; Soto, R.; Olea C.; Johnson, F.; Paredes, F.In the present paper, we resolve the Set Covering Problem using the recently presented meta-heuristic named Binary Bat Algorithm. We use two variations of this algorithm. The Binary Bat Algorithm algorithm was created observing how the bats evade obstacles and find preys to eat, the use of echo-localization is how they do it. We made some changes using two different transfer and two discretization techniques to solve the problem. © 2015 AISTI.Ítem Acceso Abierto A XOR-based ABC algorithm for solving set covering problems(Springer Verlag, 2016) Soto, R.; Crawford, B.; Lizama, S.; Johnson, F.; Paredes, F.The set covering problem is a classical problem in the subject of combinatorial optimization that consists in finding a set of solutions that cover a range of needs at the lowest possible cost. The literature reports various techniques to solve this problem, ranging from exact algorithms to approximate methods. In this paper, we present a new XOR-based artificial bee colony algorithm for solving set covering problems. We integrate a XOR operator to binarize the solution construction in order to cope with the binary nature of set covering problems. We also incorporate pre-processing phases and dynamic ABC parameters so as to improve solving time. We report interesting and competitive experimental results on a set of 65 benchmarks from the Beasley’s OR-Library. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto A choice functions portfolio for solving constraint satisfaction problems: A performance evaluation(IEEE Computer Society, 2016) Soto, R.; Crawford, B.; Olivares, R.Constraint Programming (CP) allows to solve constraint satisfaction and optimization problems by building and then exploring a search tree of potential solutions. Potential solutions are generated by firstly selecting a variable and then a value from the given problem, phase known as enumeration. In this context, Autonomous Search (AS) that is a particular case of adaptive systems, enables the problem solver to control and adapt its internal configuration during solving time, based on performance metrics in order to be more efficient. The goal is to provide a mechanism for CP solvers, integrating a component able to evaluate the solving performance process. In particular, we employ a classic decision making method called Choice Function (CF). In this paper, we present an evaluation of different choice functions, based on performance exhibited in a indicators set. The results are promising and show that it is feasible to solve constraint satisfaction problems with this new technique. © 2015 IEEE.Ítem Acceso Abierto Estrategias de enumeración para resolver problemas de satisfacción de restricciones: evaluación de desempeño [Enumeration strategies to solve constraint satisfaction problems: performance evaluation](Institute of Electrical and Electronics Engineers Inc., 2015) Soto, R.; Crawford, B.; Olivares R.; Herrera R.; Johnson, F.; Paredes, F.In constraint programming, efficiency in the resolution process can be affected by the order in which the variables of the problem and the domain values are selected. This activity is known as enumeration. At the beginning, it is difficult to determine the best choice variable-value pair that can generate potential solutions for constraint satisfaction problems. In this paper, we present an evaluation of different enumeration strategies, based on performance exhibited in a set indicators. These strategies solve different instances of constraint problems satisfactions. The results show that it is feasible to solve constraint satisfaction with at least one strategy enumeration. © 2015 AISTI.Ítem Acceso Abierto An artificial fish swarm optimization algorithm to solve set covering problem(Springer Verlag, 2016) Crawford, B.; Soto, R.; Olguín, E.; Villablanca S.M.; Rubio Á.G.; Jaramillo, A.; Salas, J.The Set Covering Problem (SCP) consists in finding a set of solutions that allow to cover a set of necessities with the minor possible cost. There are many applications of this problem such as rolling production lines or installation of certain services like hospitals. SCP has been solved before with different algorithms like genetic algorithm, cultural algorithm or firefly algorithm among others. The objective of this paper is to show the performance of an Artificial Fish Swarm Algorithm (AFSA) in order to solve SCP. This algorithm, simulates the behavior of a fish shoal inside water and it uses a population of points in space to represent the position of a fish in the shoal. Here we show a study of its simplified version of AFSA in a binary domain with its modifications applied to SCP. This method was tested on SCP benchmark instances from OR-Library website. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto An binary black hole algorithm to solve set covering problem(Springer Verlag, 2016) Rubio Á.G.; Crawford, B.; Soto, R.; Jaramillo, A.; Villablanca S.M.; Salas, J.; Olguín, E.The set covering problem (SCP) is one of the most representative combinatorial optimization problems and it has multiple applications in different situations of engineering, sciences and some other disciplines. It aims to find a set of solutions that meet the needs defined in the constraints having lowest possible cost. In this paper we used an existing binary algorithm inspired by Binary Black Holes (BBH), to solve multiple instances of the problem with known benchmarks obtained from the OR-library. The presented method emulates the behavior of these celestial bodies using a rotation operator to bring good solutions. After tray this algorithm, we implemented some improvements in certain operators, as well as added others also inspired by black holes physical behavior, to optimize the search and exploration to improving the results. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto An approach to solve the Set Covering Problem with the Soccer League Competition algorithm(Springer Verlag, 2016) Jaramillo, A.; Crawford, B.; Soto, R.; Misra, S.; Olguín, E.; Rubio Á.G.; Salas, J.; Villablanca S.M.The Soccer League Competition algorithm (SLC) is a new nature-based metaheuristic approach to solve optimization problems. It gets its basis model from the interaction between soccer teams and their players in a soccer league competition, where each player (feasible solution) compete for victory and be the best player. This paper presents a review of the underlaying SLC model and a practical approach to solve the Set Covering Problem using SLC and Python as programming language and tested over a widely OR-Library SCP benchmarks to obtain convergence capability and effectiveness of the implementation. © Springer International Publishing Switzerland 2016.Ítem Acceso Abierto Cat swarm optimization with different binarization methods for solving set covering problems(Springer Verlag, 2016) Crawford, B.; Soto, R.; Berrios N.; Olguín, E.In this paper, we present a Binary cat swarm optimization for solving the Set covering problem. The Set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the behaviour of discrete cats. Domestic cats show the ability to hunt and are curious about moving objects. The cats have two modes of behavior: seeking mode and tracing mode. Moreover, eight different transfer functions and five discretization techniques are considered for solving the binary problem. We illustrate this approach with 65 instances of the problem and select the best transfer function and discretization technique to solve this problem. © Springer International Publishing Switzerland 2016.