Search results

Purpose – The purpose of this study is to explore the concept of the economic lot sizing and the time cycle period of reordering. The stochastic demand is quite common in the real environment of a cement retailer. The study compares three methods to obtain the optimal solution of a lot-sizing ordering from the real case of the previous study where the dataset is collected from the area of some retailers at Banda Aceh Province of Indonesia.

Design/Methodology/Approach – The problem model appears when the retailer with shortage has to fulfill the lot size in the optimal condition to the stochastic demand while at the same time has the backlog condition. Moreover, when the backorder needs the time horizon for replenishment where this condition influences the holding cost at the store, many retailers try to solve this problem to minimize the holding cost, but on the other side, it should fulfill the customer demand. Three methods are explored to identify that condition: a Wagner–Whitin algorithm, the Silver–Meal heuristic, and the holding and ordering costs. The three methods are applied to the lot sizing when there is a backlog.

Findings – The results of this study show that the Wagner–Whitin algorithm outperforms the other two methods. It shows that the performance increases around 27% when compared to the two other methods in this study.

Research Limitations/Implications – All models are almost approximate and useful to determine the cycle period on stochastic demand.

Practical Implications – The calculation of the dataset with the three methods would give the simple example to the retailer when he faces the uncertainty demand models. The prediction of the calculation is done accurately than the constant calculation, which is more economic.

Social Implications – The calculation will contribute to much better predictions in many cases of uncertainty.

Originality/Value – This is a initial comparative model among other methods to achieve the optimal stock and order for a retailer

Dynamic lot sizing is the problem of determining the quantity and timing of ordering items while satisfying the demand over a finite planning horizon. This paper considers the problem with two practical considerations: minimum order size and lost sales. The minimum order size is the minimum amount of items that should be purchased and lost sales involve situations in which sales are lost because items are not on hand or when it becomes more economical to lose the sale rather than making the sale. The objective is to minimize the costs of ordering, item , inventory holding and lost sale over the planning horizon. To solve the problem, we suggest a heuristic algorithm by considering trade-offs between cost factors. Computational experiments on randomly generated test instances show that the algorithm quickly obtains near-optimal solutions.

Spam emails classification using data mining and machine learning approaches has enticed the researchers' attention duo to its obvious positive impact in protecting internet users. Several features can be used for creating data mining and machine learning based spam classification models. Yet, spammers know that the longer they will use the same set of features for tricking email users the more probably the anti-spam parties might develop tools for combating this kind of annoying email messages. Spammers, so, adapt by continuously reforming the group of features utilized for composing spam emails. For that reason, even though traditional classification methods possess sound classification results, they were ineffective for lifelong classification of spam emails duo to the fact that they might be prone to the so-called “Concept Drift”. In the current study, an enhanced model is proposed for ensuring lifelong spam classification model. For the evaluation purposes, the overall performance of the suggested model is contrasted against various other stream mining classification techniques. The results proved the success of the suggested model as a lifelong spam emails classification method.

Traditional Chinese medicine (TCM) prescriptions have always relied on the experience of TCM doctors, and machine learning(ML) provides a technical means for learning these experiences and intelligently assists in prescribing. However, in TCM prescription, there are the main (Jun) herb and the auxiliary (Chen, Zuo and Shi) herb collocations. In a prescription, the types of auxiliary herbs are often more than the main herb and the auxiliary herbs often appear in other prescriptions. This leads to different frequencies of different herbs in prescriptions, namely, imbalanced labels (herbs). As a result, the existing ML algorithms are biased, and it is difficult to predict the main herb with less frequency in the actual prediction and poor performance. In order to solve the impact of this problem, this paper proposes a framework for multi-label traditional Chinese medicine (ML-TCM) based on multi-label resampling.

In this work, a multi-label learning framework is proposed that adopts and compares the multi-label random resampling (MLROS), multi-label synthesized resampling (MLSMOTE) and multi-label synthesized resampling based on local label imbalance (MLSOL), three multi-label oversampling techniques to rebalance the TCM data.

The experimental results show that after resampling, the less frequent but important herbs can be predicted more accurately. The MLSOL method is shown to be the best with over 10% improvements on average because it balances the data by considering both features and labels when resampling.

The authors first systematically analyzed the label imbalance problem of different sampling methods in the field of TCM and provide a solution. And through the experimental results analysis, the authors proved the feasibility of this method, which can improve the performance by 10%−30% compared with the state-of-the-art methods.

Utility strikes have spawned companies specializing in providing a priori analyses of the underground. Geophysical techniques such as Ground Penetrating Radar (GPR) are harnessed for this purpose. However, analyzing GPR data is labour-intensive and repetitive. It may therefore be worthwhile to amplify this process by means of Machine Learning (ML). In this work, harnessing the ADR design science methodology, an Intelligence Amplification (IA) system is designed that uses ML for decision-making with respect to utility material type. It is driven by three novel classes of Convolutional Neural Networks (CNNs) trained for this purpose, which yield accuracies of 81.5% with outliers of 86%. The tool is grounded in the available literature on IA, ML and GPR and is embedded into a generic analysis process. Early validation activities confirm its business value.