|   | 
Details
   web
Records
Author Wanke, P.; Leiva, V.
Title Exploring the Potential Use of the Birnbaum-Saunders Distribution in Inventory Management Type
Year 2015 Publication Mathematical Problems In Engineering Abbreviated Journal Math. Probl. Eng.
Volume Issue Pages 9 pp
Keywords
Abstract Choosing the suitable demand distribution during lead-time is an important issue in inventory models. Much research has explored the advantage of following a distributional assumption different from the normality. The Birnbaum-Saunders (BS) distribution is a probabilistic model that has its genesis in engineering but is also being widely applied to other fields including business, industry, and management. We conduct numeric experiments using the R statistical software to assess the adequacy of the BS distribution against the normal and gamma distributions in light of the traditional lot size-reorder point inventory model, known as (Q, r). The BS distribution is well-known to be robust to extreme values; indeed, results indicate that it is a more adequate assumption under higher values of the lead-time demand coefficient of variation, thus outperforming the gamma and the normal assumptions.
Address [Wanke, Peter] Univ Fed Rio de Janeiro, COPPEAD Grad Sch Business, BR-21941 Rio De Janeiro, Brazil, Email: victorleivasanchez@gmail.com
Corporate Author Thesis
Publisher Hindawi Publishing Corp Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title (up) Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1024-123x ISBN Medium
Area Expedition Conference
Notes WOS:000364740300001 Approved
Call Number UAI @ eduardo.moreno @ Serial 538
Permanent link to this record
 

 
Author Contreras, J.P.; Bosch, P.; Varas, M.; Basso, F.
Title A New Genetic Algorithm Encoding for Coalition Structure Generation Problems Type
Year 2020 Publication Mathematical Problems In Engineering Abbreviated Journal Math. Probl. Eng.
Volume 2020 Issue Pages 13 pp
Keywords
Abstract Genetic algorithms have proved to be a useful improvement heuristic for tackling several combinatorial problems, including the coalition structure generation problem. In this case, the focus lies on selecting the best partition from a discrete set. A relevant issue when designing a Genetic algorithm for coalition structure generation problems is to choose a proper genetic encoding that enables an efficient computational implementation. In this paper, we present a novel hybrid encoding, and we compare its performance against several genetic encoding proposed in the literature. We show that even in difficult instances of the coalition structure generation problem, the proposed approach is a competitive alternative to obtaining good quality solutions in reasonable computing times. Furthermore, we also show that the encoding relevance increases as the number of players increases.
Address [Contreras, Juan Pablo] Univ Adolfo Ibanez, Fac Ingn & Ciencias, Santiago, Chile, Email: ju.contreras@alumnos.uai.cl;
Corporate Author Thesis
Publisher Hindawi Ltd Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title (up) Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1024-123x ISBN Medium
Area Expedition Conference
Notes WOS:000530379800011 Approved
Call Number UAI @ eduardo.moreno @ Serial 1141
Permanent link to this record