|   | 
Details
   web
Records
Author Moreno, S.; Pereira, J.; Yushimito, W.
Title A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution Type
Year 2020 Publication Annals Of Operations Research Abbreviated Journal Ann. Oper. Res.
Volume 286 Issue 1-2 Pages 87-117
Keywords Territorial design; Clustering; K-means; Integer programming; Case study
Abstract The objective of territorial design for a distribution company is the definition of geographic areas that group customers. These geographic areas, usually called districts or territories, should comply with operational rules while maximizing potential sales and minimizing incurred costs. Consequently, territorial design can be seen as a clustering problem in which clients are geographically grouped according to certain criteria which usually vary according to specific objectives and requirements (e.g. costs, delivery times, workload, number of clients, etc.). In this work, we provide a novel hybrid approach for territorial design by means of combining a K-means-based approach for clustering construction with an optimization framework. The K-means approach incorporates the novelty of using tour length approximation techniques to satisfy the conditions of a pork and poultry distributor based in the region of Valparaiso in Chile. The resulting method proves to be robust in the experiments performed, and the Valparaiso case study shows significant savings when compared to the original solution used by the company.
Address [Moreno, Sebastian; Pereira, Jordi; Yushimito, Wilfredo] Univ Adolfo Ibanez, Fac Engn & Sci, Av Padre Hurtado 750, Vina Del Mar, Chile, Email: sebastian.moreno@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:000511564300005 Approved
Call Number UAI @ eduardo.moreno @ Serial 1105
Permanent link to this record
 

 
Author Barrera, J.; Carrasco, R.A.; Mondschein, S.; Canessa, G.; Rojas-Zalazar, D.
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 Barrera, J.; Moreno, E.; Varas, S.
Title A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case Type
Year 2020 Publication Annals Of Operations Research Abbreviated Journal Ann. Oper. Res.
Volume 286 Issue 1-2 Pages 545-557
Keywords Income taxes; Markov processes; Networks; Algorithms
Abstract Income tax systems with “pass-through” entities transfer a firm's income to shareholders, which are taxed individually. In 2014, a Chilean tax reform introduced this type of entity and changed to an accrual basis that distributes incomes (but not losses) to shareholders. A crucial step for the Chilean taxation authority is to compute the final income of each individual given the complex network of corporations and companies, usually including cycles between them. In this paper, we show the mathematical conceptualization and the solution to the problem, proving that there is only one way to distribute income to taxpayers. Using the theory of absorbing Markov chains, we define a mathematical model for computing the taxable income of each taxpayer, and we propose a decomposition algorithm for this problem. This approach allows us to compute the solution accurately and to efficiently use computational resources. Finally, we present some characteristics of Chilean taxpayers' network and the computational results of the algorithm using this network.
Address [Barrera, Javiera; 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 0254-5330 ISBN Medium
Area Expedition Conference
Notes WOS:000511564300023 Approved
Call Number UAI @ eduardo.moreno @ Serial 1102
Permanent link to this record
 

 
Author Espinoza, D.; Goycoolea, M.; Moreno, E.; Newman, A.
Title MineLib: a library of open pit mining problems Type
Year 2013 Publication Annals Of Operations Research Abbreviated Journal Ann. Oper. Res.
Volume 206 Issue 1 Pages 93-114
Keywords Mine scheduling; Mine planning; Open pit production scheduling; Surface mine production scheduling; Problem libraries; Open pit mining library
Abstract Similar to the mixed-integer programming library (MIPLIB), we present a library of publicly available test problem instances for three classical types of open pit mining problems: the ultimate pit limit problem and two variants of open pit production scheduling problems. The ultimate pit limit problem determines a set of notional three-dimensional blocks containing ore and/or waste material to extract to maximize value subject to geospatial precedence constraints. Open pit production scheduling problems seek to determine when, if ever, a block is extracted from an open pit mine. A typical objective is to maximize the net present value of the extracted ore; constraints include precedence and upper bounds on operational resource usage. Extensions of this problem can include (i) lower bounds on operational resource usage, (ii) the determination of whether a block is sent to a waste dump, i.e., discarded, or to a processing plant, i.e., to a facility that derives salable mineral from the block, (iii) average grade constraints at the processing plant, and (iv) inventories of extracted but unprocessed material. Although open pit mining problems have appeared in academic literature dating back to the 1960s, no standard representations exist, and there are no commonly available corresponding data sets. We describe some representative open pit mining problems, briefly mention related literature, and provide a library consisting of mathematical models and sets of instances, available on the Internet. We conclude with directions for use of this newly established mining library. The library serves not only as a suggestion of standard expressions of and available data for open pit mining problems, but also as encouragement for the development of increasingly sophisticated algorithms.
Address [Espinoza, Daniel] Univ Chile, Dept Ind Engn, Santiago Ctr, Santiago, Chile, Email: daespino@dii.uchile.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:000320694000006 Approved
Call Number UAI @ eduardo.moreno @ Serial 290
Permanent link to this record
 

 
Author Gonzalez, E.; Epstein, L.D.; Godoy, V.
Title Optimal number of bypasses: minimizing cost of calls to wireless phones under Calling Party Pays Type
Year 2012 Publication Annals Of Operations Research Abbreviated Journal Ann. Oper. Res.
Volume 199 Issue 1 Pages 179-191
Keywords Communications; Telephony; Wireless bypasses; Calling Party Pays; Rental situations; Inventory models
Abstract In telecommunications, Calling Party Pays is a billing formula that prescribes that the person who makes the call pays its full cost. Under CPP land-line to wireless phone calls have a high cost for many organizations. They can reduce this cost at the expense of installing wireless bypasses to replace land-line to wireless traffic with wireless-to-wireless traffic, when the latter is cheaper than the former. Thus, for a given time-horizon, the cost of the project is a trade-off between traffic to-wireless and the number of bypasses. We present a method to determine the number of bypasses that minimizes the expected cost of the project. This method takes into account hourly varying traffic intensity. Our method takes advantage of parallels with inventory models for rental items. Examples illustrate the economic value of our approach.
Address [Gonzalez, Eduardo; Epstein, Leonardo D.; Godoy, Veronica] Univ Adolfo Ibanez, Fac Ingn & Ciencias, Santiago, Chile, Email: eduardo.gonzalez@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:000308548500011 Approved
Call Number UAI @ eduardo.moreno @ Serial 238
Permanent link to this record
 

 
Author de Mateo, F.; Coelli, T.; O'Donnell, C.
Title Optimal paths and costs of adjustment in dynamic DEA models: with application to chilean department stores Type
Year 2006 Publication Annals Of Operations Research Abbreviated Journal Ann. Oper. Res.
Volume 145 Issue 1 Pages 211-227
Keywords cost of adjustment; dynamic DEA; path of adjustment
Abstract In this paper we propose a range of dynamic data envelopment analysis (DEA) models which allow information on costs of adjustment to be incorporated into the DEA framework. We first specify a basic dynamic DEA model predicated on a number or simplifying assumptions. We then outline a number of extensions to this model to accommodate asymmetric adjustment costs, non-static output quantities, non-static input prices, and non-static costs of adjustment, technological change, quasi-fixed inputs and investment budget constraints. The new dynamic DEA models provide valuable extra information relative to the standard static DEA models-they identify an optimal path of adjustment for the input quantities, and provide a measure of the potential cost savings that result from recognising the costs of adjusting input quantities towards the optimal point. The new models are illustrated using data relating to a chain of 35 retail department stores in Chile. The empirical results illustrate the wealth of information that can be derived from these models, and clearly show that static models overstate potential cost savings when adjustment costs are non-zero.
Address Univ Adolfo Ibanez, Recreo, Vina Del Mar, Chile, Email: fdemateo@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:000241281800014 Approved
Call Number UAI @ eduardo.moreno @ Serial 16
Permanent link to this record