Multi-product multi-chance-constraint stochastic inventory control problem with dynamic demand and partial back-ordering: A harmony search algorithm

In this paper, a multiproduct inventory control problem is considered in which the periods between two replenishments of the products are assumed independent random variables, and increasing and decreasing functions are assumed to model the dynamic demands of each product. Furthermore, the quantities of the orders are assumed integer-type, space and budget are constraints, the service-level is a chance-constraint, and that the partial back-ordering policy is taken into account for the shortages. The costs of the problem are holding, purchasing, and shortage. We show the model of this problem is an integer nonlinear programming type and to solve it, a harmony search approach is used. At the end, three numerical examples of different sizes are given to demonstrate the applicability of the proposed methodology in real world inventory control problems, to validate the results obtained, and to compare its performances with the ones of both a genetic and a particle swarm optimization algorithms.     

Optimal pricing, lot-sizing and marketing planning in a capacitated and imperfect production system

In the classical economic production quantity (EPQ) problem demand is considered to be known in advance. However, in the real-world, demand of a product is a function of factors such as product’s price, its quality, and marketing expenditures for promoting the product. Quality level of the product and specifications of the adopted manufacturing process also affect the unit product’s cost. Therefore, in this paper we consider a profit maximizing firm who wants to jointly determine the optimal lot-sizing, pricing, and marketing decisions along with manufacturing requirements in terms of flexibility and reliability of the process. Geometric programming (GP) technique is proposed to address the resulting nonlinear optimization problem. Using recent advances in optimization techniques we are able to optimally solve the developed, highly nonlinear, mathematical model. Finally, using numerical examples, we illustrate the solution approach and analyze the solution under different conditions.     

Genetic application in a facility location problem with random demand within queuing framework

In many service and industrial applications of the facility location problem, the number of required facilities along with allocation of the customers to the facilities are the two major questions that need to be answered. In this paper, a facility location problem with stochastic customer demand and immobile servers is studied. Two objectives considered in this problem are: (1) minimizing the average customer waiting time and (2) minimizing the average facility idle-time percentage. We formulate this problem using queuing theory and solve the model by a genetic algorithm within the desirability function framework. Several examples are presented to demonstrate the applications of the proposed methodology.     

Classification of non-alcoholic beer based on aftertaste sensory evaluation by chemometric tools

Sensory evaluation is the application of knowledge and skills derived from several different scientific and technical disciplines, physiology, chemistry, mathematics and statistics, human behavior, and knowledge about product preparation practices. This research was aimed to evaluate aftertaste sensory attributes of commercial non-alcoholic beer brands (P1, P2, P3, P4, P5, P6, P7) by several chemometric tools. These attributes were bitter, sour, sweet, fruity, liquorice, artificial, body, intensity and duration. The results showed that the data are in a good consistency. Therefore, the brands were statistically classified in several categories. Linear techniques as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) were performed over the data that revealed all types of beer are well separated except a partial overlapping between zones corresponding to P4, P6 and P7. In this research, for the confirmation of the groups observed in PCA and in order to calculate the errors in calibration and in validation, PLS-DA technique was used. Based on the quantitative data of PLS-DA, the classification accuracy values were ranked within 49-86%. Moreover, it was found that the classification accuracy of LDA was much better than PCA. It shows that this trained sensory panel can discriminate among the samples except an overlapping between two types of beer. Also, two types of artificial networks were used: Probabilistic Neural Networks (PNN) with Radial Basis Functions (RBF) and FeedForward Networks with Back Propagation (BP) learning method. The highest classification success rate (correct predicted number over total number of measurements) of about 97% was obtained for RBF followed by 94% for BP. The results obtained in this study could be used as a reference for electronic nose and electronic tongue in beer quality control.     

Stores clustering using a data mining approach for distributing automotive spare-parts to reduce transportation costs

Clustering of retail stores in a distribution network with specific geographical limits plays an important and effective role in distribution and transportation costs reduction. In this paper, the relevant data and information for an established automotive spare-parts distribution and after-sales services company (ISACO) for a 3-year period have been analyzed. With respect to the diversity and lot size of the available information such as stores location, order, goods, transportation vehicles and road and traffic information, three effecting factors with specific weights have been defined for the similarity function: 1. Euclidean distance, 2. Lot size 3. Order concurrency. Based on these three factors, the similarity function has been examined through 5 steps using the Association Rules principles, where the clustering of the stores is performed using k-means algorithm and similar stores are allocated to the clusters. These steps include: 1. Similarity function based on the Euclidean distances, 2. Similarity function based on the order concurrency, 3. Similarity function based on the combination of the order concurrency and lot size, 4. Similarity function based on the combination of these three factors and 5. Improved similarity function. The above mentioned clustering operation for each 5 cases addressed in data mining have been carried out using R software and the improved combinational function has been chosen as the optimal clustering function. Then, trend of each retail store have been analyzed using the improved combinational function and along with determining the priority of the depot center establishment for every cluster, the appropriate distribution policies have been formulated for every cluster. The obtained results of this study indicate a significant cost reduction (32%) in automotive spare-parts distribution and transportation costs.     

Development of a Virtual Reality Structural Analysis System

This paper discusses the development of virtual structural analysis program (VSAP). This is a virtual environment (VE) based structural analysis system developed through a collaborative effort between the School of Architecture + Design and the Department of Computer Science at Virginia Polytechnic Institute and State Univ. (Virginia Tech). The VSAP was developed by linking a visualization routine using the simple VE library and a structural analysis software, the PC-SAP4. Details of the design of four user interfaces for the VSAP are presented. These user interfaces are: the immersive pen and tablet interface, the desktop interface, the portable immersive interface, and the cave automatic VE immersive interface. Usability studies for each interface were conducted. Results of these studies indicated that the users of VSAP were highly satisfied with the experience. In addition, all the developed interfaces were found to be successful for their specific application.     

Parametric meshless Galerkin method

In meshless methods, generation of meshless shape functions is usually a complicated and time‐consuming task. In this paper, a new meshless method called parametric meshless Galerkin method (PMGM) is presented. In this method, meshless shape functions are constructed on meshless parametric domains (MPD), before running to solve the problem. For modelling the new problems, MPDs are mapped to the physical space. Therefore the shape functions constructing time can be saved. Mapping is simply performed by defining a linear function. Also, the integration grids are defined in the MPD and it is not necessary to create background integration grids separately for each problem. The method is described for two‐dimensional problems, but it can be applied to three‐dimensional problems in the same way. It is shown that using the PMGM, a time saving as much as 21% is achieved with respect to the element‐free Galerkin method for the numerical examples and the obtained results show efficiency and convergence of the method. Copyright © 2005 John Wiley & Sons, Ltd.     

Robust matrix 𝒟U‐stability analysis

In this paper, the problem of robust matrix root‐clustering is addressed. The studied matrices are subject to both polytopic and unstructured uncertainties. An original point is the large choice of clustering regions enabled by the proposed approach since these regions can be unions of possibly disjoint and non‐symmetric subregions of the complex plane. The precise purpose is, considering a specified polytope, to determine the greatest robustness bound on the unstructured uncertainty such that robust matrix root‐clustering is ensured. To reduce conservatism in the derivation of the bound, the reasoning relies on a framework based upon parameter‐dependent Lyapunov functions. The bound value is computed by solving an ?? ?? ? problem. Copyright © 2003 John Wiley & Sons, Ltd.     

Design, manufacture and evaluation of a new and simple mechanism for transmission of power between intersecting shafts up to 135 degrees (Persian Joint)

This paper introduces a new mechanism which is designed for the transmission of power between two intersecting shafts. The mechanism consists of one drive shaft and one driven shaft, six guide arms, and three connecting arms. The intersecting angle between the input shaft and the output shaft can be varied up to 135° while the velocity ratio between the two shafts remains constant. The research also includes a kinematic analysis and a simulation using Visual NASTRAN, Autodesk Inventor Dynamic and COSMOS Motion. The softwares showed that this mechanism can transmit constant velocity ratios at all angles between two shafts. By comparing the graphs of analytical analysis and simulation analysis, validity of equations was proved. Finally, by fabrication and evaluation of the mechanism it was shown that this mechanism can transmit constant velocity practically.