Search

Purpose. The present study aimed to improve the aqueous solubility, permeability, bioavailability, and nootropic potential of standardized Emblica officinalis extract (EOE) by developing a novel phytosomal formulation. Method. Emblica officinalis extract-loaded phytosomes (EOPs) were prepared using solvent evaporation. The EOP was prepared at different molar ratios of extract and phospholipid. Herein, the effects of phospholipid extract ratio (A), temperature (B), and reaction time (C) were systematically investigated on entrapment efficiency using Box-Behnken design. In vitro and in vivo characterizations of the optimized formulation were performed. Results. Optimized EOP formulation (89.90 ± 0.24 μg/ml) exhibited improved aqueous solubility than plain EOE (11.85 ± 0.25 μg/ml). The optimized formulation’s particle size and Zeta potential were 198.4 ± 0.20 nm and −39.0 ± 0.40 mv. DSC and XRD studies confirmed the partial amorphization of EOE in phytosomes. Optimized formulation exhibited 69.82 ± 0.17% of EOE release at 12 h and followed zero-order release kinetics. Moreover, the phytosomal formulation of EOE exhibited its rationality with an improvement of bioavailability by 2.7 folds compared with pure EOE. Compared to EOE, EOP showed significantly (p

This work addresses an evolutionary algorithmic approach to reduce the surplus pieces in selective assembly to increase success rates. A novel equal area amidst unequal bin numbers (EAUB) method is proposed for classifying the parts of the ball bearing assembly by considering the various tolerance ranges of parts. The L16 orthogonal array is used for identifying the effectiveness of the proposed EAUB method through varying the number of bins of the parts of an assembly. Because of qualities such as minimal setting parameters, ease of understanding and implementation, and rapid convergence, the moth–flame optimization (MFO) algorithm is put forward in this work for identifying the optimal combination of bins of the parts of an assembly toward maximizing the percentage of the success rate of making assemblies. Computational results showed a 5.78% improvement in the success rate through the proposed approach compared with the past literature. The usage of the MFO algorithm is justified by comparing the computational results with the harmony search algorithm.

Electrochemical machining (ECM) is a preferred advanced machining process for machining Monel 400 alloys. During the machining, the toxic nickel hydroxides in the sludge are formed. Therefore, it becomes necessary to determine the optimum ECM process parameters that minimize the nickel presence (NP) emission in the sludge while maximizing the material removal rate (MRR). In this investigation, the predominant ECM process parameters, such as the applied voltage, flow rate, and electrolyte concentration, were controlled to study their effect on the performance measures (i.e., MRR and NP). A meta-heuristic algorithm, the grey wolf optimizer (GWO), was used for the multi-objective optimization of the process parameters for ECM, and its results were compared with the moth-flame optimization (MFO) and particle swarm optimization (PSO) algorithms. It was observed from the surface, main, and interaction plots of this experimentation that all the process variables influenced the objectives significantly. The TOPSIS algorithm was employed to convert multiple objectives into a single objective used in meta-heuristic algorithms. In the convergence plot for the MRR model, the PSO algorithm converged very quickly in 10 iterations, while GWO and MFO took 14 and 64 iterations, respectively. In the case of the NP model, the PSO tool took only 6 iterations to converge, whereas MFO and GWO took 48 and 88 iterations, respectively. However, both MFO and GWO obtained the same solutions of EC = 132.014 g/L, V = 2406 V, and FR = 2.8455 L/min with the best conflicting performances (i.e., MRR = 0.242 g/min and NP = 57.7202 PPM). Hence, it is confirmed that these metaheuristic algorithms of MFO and GWO are more suitable for finding the optimum process parameters for machining Monel 400 alloys with ECM. This work explores a greater scope for the ECM process with better machining performance.

Tolerance cost and machining time play crucial roles while performing tolerance allocation in complex assemblies. The aim of the proposed work is to minimize the above-said manufacturing objectives for allocating optimum tolerance to the components of complex assemblies, by considering the proper process and machine selections from the given alternatives. A novel methodology that provides a two-step solution is developed for this work. First, a heuristic approach is applied to determine the best machine for each process, and then a combined whale optimization algorithm with a univariate search method is used to allocate optimum tolerances with the best process selection for each sub-stage/operation. The efficiency of the proposed novel methodology is validated by solving two typical tolerance allocation problems of complex assemblies: a wheel mounting assembly and a knuckle joint assembly. Compared with previous approaches, the proposed methodology showed a considerable reduction in tolerance cost and machining time in relatively less computation time.

The proposed work aims to acquire the maximum number of non-linear assemblies with closer assembly tolerance specifications by mating the different bins’ components. Before that, the components are classified based on the range of tolerance values and grouped into different bins. Further, the manufacturing process of the components is selected from the given and known alternative processes. It is incredibly tedious to obtain the best combinations of bins and the best process together. Hence, a novel approach using the combination of the univariate search method and the harmony search algorithm is proposed in this work. Overrunning clutch assembly is taken as an example. The components of overrunning clutch assembly are manufactured with a wide tolerance value using the best process selected from the given alternatives by the univariate search method. Further, the manufactured components are grouped into three to nine bins. A combination of the best bins is obtained for the various assembly specifications by implementing the harmony search algorithm. The efficacy of the proposed method is demonstrated by showing 24.9% of cost-savings while making overrunning clutch assembly compared with the existing method. The efficacy of the proposed method is demonstrated by showing 24.9% of cost-savings while making overrunning clutch assembly compared with the existing method. The results show that the contribution of the proposed novel methodology is legitimate in solving selective assembly problems.

In this research work, the machinability of turning Hastelloy X with a PVD Ti-Al-N coated insert tool in dry, wet, and cryogenic machining environments is investigated. The machinability indices namely cutting force (CF), surface roughness (SR), and cutting temperature (CT) are studied for the different set of input process parameters such as cutting speed, feed rate, and machining environment, through the experiments conducted as per L27 orthogonal array. Minitab 17 is used to create quadratic Multiple Linear Regression Models (MLRM) based on the association between turning parameters and machineability indices. The Moth-Flame Optimization (MFO) algorithm is proposed in this work to identify the optimal set of turning parameters through the MLRM models, in view of minimizing the machinability indices. Three case studies by considering individual machinability indices, a combination of dual indices, and a combination of all three indices, are performed. The suggested MFO algorithm’s effectiveness is evaluated in comparison to the findings of Genetic, Grass-Hooper, Grey-Wolf, and Particle Swarm Optimization algorithms. From the results, it is identified that the MFO algorithm outperformed the others. In addition, a confirmation experiment is conducted to verify the results of the MFO algorithm’s optimal combination of turning parameters.