toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Records Links
Author Cho, A.D.; Carrasco, R.A.; Ruz, G.A.; Ortiz, J.L. doi  openurl
  Title Slow Degradation Fault Detection in a Harsh Environment Type
  Year 2020 Publication IEEE Access Abbreviated Journal IEEE Access  
  Volume 8 Issue Pages 175904-175920  
  Keywords  
  Abstract The ever increasing challenges posed by the science projects in astronomy have skyrocketed the complexity of the new generation telescopes. Due to the climate and sky requirements, these high precision instruments are generally located in remote areas, suffering from the harsh environments around it. These modern telescopes not only produce massive amounts of scientific data, but they also generate an enormous amount of operational information. The Atacama Large Millimeter/submillimeter Array (ALMA) is one of these unique instruments, generating more than 50 Gb of operational data every day while functioning in conditions of extreme dryness and altitude. To maintain the array working under extreme conditions, the engineering teams must check over 130,000 monitoring points, combing through the massive datasets produced every day. To make this possible, predictive tools are needed to identify, hopefully beforehand, the occurrence of failures in all the different subsystems.

This work presents a novel fault detection scheme for one of these subsystems, the Intermediate Frequency Processors (IFP). This subsystem is critical to process the information gathered by each antenna and communicate it, reliably, to the correlator for processing. Our approach is based on echo state networks, a configuration of artificial neural networks, used to learn and predict the signal patterns. These patterns are later compared to the actual signal, to identify failure modes. Additional preprocessing techniques were also added since the signal-to-noise ratio of the data used was very low.

The proposed scheme was tested in over seven years of data from 132 IFPs at ALMA, showing an accuracy of over 70%. Furthermore, the detection was done several months earlier, on average, when compared to what human operators did. These results help the maintenance procedures, increasing reliability while reducing humans' exposure to the harsh environment where the antennas are. Although applied to a specific fault, this technique is broad enough to be applied to other types of faults and settings.
 
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 2169-3536 ISBN Medium  
  Area Expedition Conference  
  Notes Approved  
  Call Number UAI @ eduardo.moreno @ Serial 1224  
Permanent link to this record
 

 
Author Barrera, J.; Carrasco, R.A.; Moreno, E. pdf  doi
openurl 
  Title Real-time fleet management decision support system with security constraints Type
  Year 2020 Publication TOP Abbreviated Journal TOP  
  Volume 28 Issue 3 Pages 728-748  
  Keywords Fleet management; Real-time control; Data analytics; GPS tracking; Decision support system; Conflict detection and resolution  
  Abstract Intelligent transportation, and in particular, fleet management, has been a forefront concern for a plethora of industries. This statement is especially true for the production of commodities, where transportation represents a central element for operational continuity. Additionally, in many industries, and in particular those with hazardous environments, fleet control must satisfy a wide range of security restrictions to ensure that risks are kept at bay and accidents are minimum. Furthermore, in these environments, any decision support tool must cope with noisy and incomplete data and give recommendations every few minutes. In this work, a fast and efficient decision support tool is presented to help fleet managers oversee and control ore trucks, in a mining setting. The main objective of this system is to help managers avoid interactions between ore trucks and personnel buses, one of the most critical security constraints in our case study, keeping a minimum security distance between the two at all times. Furthermore, additional algorithms are developed and implemented, so that this approach can work with real-life noisy GPS data. Through the use of historical data, the performance of this decision support system is studied, validating that it works under the real-life conditions presented by the company. The experimental results show that the proposed approach improved truck and road utilization significantly while allowing the fleet manager to control the security distance required by their procedures.  
  Address [Barrera, Javiera; Carrasco, Rodrigo A.; Moreno, Eduardo] Univ Adolfo Ibanez, Fac Engn & Sci, Santiago, Chile, Email: javiera.barrera@uai.cl;  
  Corporate Author Thesis  
  Publisher Springer Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 1134-5764 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000534967700001 Approved  
  Call Number UAI @ eduardo.moreno @ Serial 1200  
Permanent link to this record
 

 
Author Baselli, G.; Contreras, F.; Lillo, M.; Marin, M.; Carrasco, R.A. doi  openurl
  Title Optimal decisions for salvage logging after wildfires Type
  Year 2020 Publication Omega-International Journal Of Management Science Abbreviated Journal Omega-Int. J. Manage. Sci.  
  Volume 96 Issue Pages 9 pp  
  Keywords Salvage logging; Forest harvesting; Wildfires; Workforce allocation  
  Abstract Strategic, tactical, and operational harvesting plans for the forestry and logging industry have been widely studied for more than 60 years. Many different settings and specific constraints due to legal, environmental, and operational requirements have been modeled, improving the performance of the harvesting process significantly. During the summer of 2017, Chile suffered from the most massive wildfires in its history, affecting almost half a million hectares, of which nearly half were forests owned by medium and small forestry companies. Some of the stands were burned by intense crown fires, which always spread fast, that burned the foliage and outer layer of the bark but left standing dead trees that could be salvage harvested before insect and decay processes rendered them unusable for commercial purposes. Unlike the typical operational programming models studied in the past, in this setting, companies can make insurance claims on part or all of the burnt forest, whereas the rest of the forest needs to be harvested before it loses its value. This problem is known as the salvage logging problem. The issue also has an important social component when considering medium and small forestry and logging companies: most of their personnel come from local communities, which have already been affected by the fires. Harvesting part of the remaining forest can allow them to keep their jobs longer and, hopefully, leave the company in a better financial situation if the harvesting areas are correctly selected. In this work, we present a novel mixed-integer optimization-based approach to support salvage logging decisions, which helps in the configuration of an operational-level harvesting and workforce assignment plan. Our model takes into account the payment from an insurance claim as well as future income from harvesting the remaining trees. The model also computes an optimal assignment of personnel to the different activities required. The objective is to improve the cash position of the company by the end of the harvest and ensure that the company is paying all its liabilities and maintaining personnel. We show how our model performs compared to the current decisions made by medium and small-sized forestry companies, and we study the specific case of a small forestry company located in Cauquenes, Chile, which used our model to decide its course of action. (C) 2019 Elsevier Ltd. All rights reserved.  
  Address [Baselli, Gianluca; Contreras, Felipe; Lillo, Matias; Marin, Magdalena; Carrasco, Rodrigo A.] Univ Adolfo Ibanez, Fac Engn & Sci, Santiago, Chile, Email: gbaselli@alumnos.uai.cl;  
  Corporate Author Thesis  
  Publisher Pergamon-Elsevier Science Ltd Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0305-0483 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000541944700003 Approved  
  Call Number UAI @ eduardo.moreno @ Serial 1186  
Permanent link to this record
 

 
Author Barrera, J.; Carrasco, R.A.; Mondschein, S.; Canessa, G.; Rojas-Zalazar, D. doi  openurl
  Title Operating room scheduling under waiting time constraints: the Chilean GES plan Type
  Year 2020 Publication Annals Of Operations Research Abbreviated Journal Ann. Oper. Res.  
  Volume 286 Issue 1-2 Pages 501-527  
  Keywords Scheduling; Operating theater; Operating room scheduling  
  Abstract In 2000, Chile introduced profound health reforms to achieve a more equitable and fairer system (GES plan). The reforms established a maximum waiting time between diagnosis and treatment for a set of diseases, described as an opportunity guarantee within the reform. If the maximum waiting time is exceeded, the patient is referred to another (private) facility and receives a voucher to cover the additional expenses. This voucher is paid by the health provider that had to do the procedure, which generally is a public hospital. In general, this reform has improved the service for patients with GES pathologies at the expense of patients with non-GES pathologies. These new conditions create a complicated planning scenario for hospitals, in which the hospital's OR Manager must balance the fulfillment of these opportunity guarantees and the timely service of patients not covered by the guarantee. With the collaboration of the Instituto de Neurocirugia, in Santiago, Chile, we developed a mathematical model based on stochastic dynamic programming to schedule surgeries in order to minimize the cost of referrals to the private sector. Given the large size of the state space, we developed an heuristic to compute good solutions in reasonable time and analyzed its performance. Our experimental results, with both simulated and real data, show that our algorithm performs close to optimum and improves upon the current practice. When we compared the results of our heuristic against those obtained by the hospital's OR manager in a simulation setting with real data, we reduced the overtime from occurring 21% of the time to zero, and the non-GES average waiting list's length from 71 to 58 patients, without worsening the average throughput.  
  Address [Barrera, Javiera; Carrasco, Rodrigo A.; Mondschein, Susana; Canessa, Gianpiero] Univ Adolfo Ibanez, Fac Engn & Sci, Santiago, Chile, Email: javiera.barrera@uai.cl;  
  Corporate Author Thesis  
  Publisher Springer Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0254-5330 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000511564300021 Approved  
  Call Number UAI @ eduardo.moreno @ Serial 1104  
Permanent link to this record
 

 
Author Carrasco, R.A.; Iyengar, G.; Stein, C. pdf  doi
openurl 
  Title Resource cost aware scheduling Type
  Year 2018 Publication European Journal Of Operational Research Abbreviated Journal Eur. J. Oper. Res.  
  Volume 269 Issue 2 Pages 621-632  
  Keywords Scheduling; Approximation algorithms; Resource aware scheduling; Speed-scaling  
  Abstract We are interested in the scheduling problem where there are several different resources that determine the speed at which a job runs and we pay depending on the amount of each resource that we use. This work is an extension of the resource dependent job processing time problem and the energy aware scheduling problems. We develop a new constant factor approximation algorithm for resource cost aware scheduling problems: the objective is to minimize the sum of the total cost of resources and the total weighted completion time in the one machine non-preemptive setting, allowing for arbitrary precedence constraints and release dates. Our algorithm handles general job-dependent resource cost functions. We also analyze the practical performance of our algorithms, showing that it is significantly superior to the theoretical bounds and in fact it is very close to optimal. The analysis is done using simulations and real instances, which are left publicly available for future benchmarks. We also present additional heuristic improvements and we study their performance in other settings. (C) 2018 Elsevier B.V. All rights reserved.  
  Address [Carrasco, Rodrigo A.] Univ Adolfo Ibanez, Fac Sci & Engn, Santiago, Chile, Email: rax@uai.cl;  
  Corporate Author Thesis  
  Publisher Elsevier Science Bv Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0377-2217 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000432502600016 Approved  
  Call Number UAI @ eduardo.moreno @ Serial 871  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: