Designing optical glasses by machine learning coupled with a genetic algorithm

Engineering new glass compositions have experienced a sturdy tendency to move forward from (educated) trial-and-error to data- and simulation-driven strategies. In this work, we developed a computer program that combines data-driven predictive models (in this case, neural networks) with a genetic algorithm to design glass compositions with desired combinations of properties. First, we induced predictive models for the glass transition temperature (T_g) using a dataset of 45,302 compositions with 39 different chemical elements, and for the refractive index (n_d) using a dataset of 41,225 compositions with 38 different chemical elements. Then, we searched for relevant glass compositions using a genetic algorithm informed by a design trend of glasses having high n_d (1.7 or more) and low T_g (500 °C or less). Two candidate compositions suggested by the combined algorithms were selected and produced in the laboratory. These compositions are significantly different from those in the datasets used to induce the predictive models, showing that the used method is indeed capable of exploration. Both glasses met the constraints of the work, which supports the proposed framework. Therefore, this new tool can be immediately used for accelerating the design of new glasses. These results are a stepping stone in the pathway of machine learning-guided design of novel glasses.     

基于改进D?Lite遗传算法路径规划研究

针对遗传算法在移动机器人路径规划中易产生早熟现象和收敛速度慢的问题,提出了改进的D~* Lite遗传算法。该算法将D~* Lite算法和遗传算法相结合,通过引入碰撞系数和可视检测技术以提高路径安全性,寻找最短路径。在遗传算法设计中加入动态调整交叉与变异概率,以解决算法在路径规划中因陷入局部最优值而不能到达目标点的问题。最后,通过实验仿真可知:与蚁群算法和免疫遗传算法相比,改进的D~* Lite遗传算法执行效率高,可以快速规划出全局最优路径。     

Automatic generation of variants depending on changes of product properties in a flexible manufacturing environment

Competition forces manufacturing systems to be flexible and to increase product variety and process complexity. These tasks depend on the flexible design of a bill of materials (BOM), one of the most important inputs in manufacturing planning and control systems. Product variety forces systems to generate BOMs with regard to product properties through a BOM pattern. A variant bill of materials provides a structure to manage product variability. In this study, an algorithm is designed to build a BOM pattern using computer-aided design and computer-aided manufacturing (CAD/CAM) data, and another algorithm is designed to generate variants with regard to product specifications. Genetic algorithm is used to generate new products to provide high product variability for testing algorithms. After the test, both algorithms are applied to a real industry problem. The BOM pattern is built automatically using CAD/CAM data, and variants are generated with regard to the pattern, and the results are discussed.     

Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes

This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances.     

Multi-objective particle swarm optimisation based integrated production inventory routing planning for efficient perishable food logistics operations

Sustainable and efficient food supply chain has become an essential component of one’s life. The model proposed in this paper is deeply linked to people's quality of life as a result of which there is a large incentive to fulfil customer demands through it. This proposed model can enhance food quality by making the best possible food quality accessible to customers, construct a sustainable logistics system considering its environmental impact and ensure the customer demand to be fulfilled as fast as possible. In this paper, an extended model is examined that builds a unified planning problem for efficient food logistics operations where four important objectives are viewed: minimising the total expense of the system, maximising the average food quality along with the minimisation of the amount of CO₂ emissions in transportation along with production and total weighted delivery lead time minimisation. A four objective mixed integer linear programming model for intelligent food logistics system is developed in the paper. The optimisation of the formulated mathematical model is proposed using a modified multi-objective particle swarm optimisation algorithm with multiple social structures: MO-GLNPSO (Multi-Objective Global Local Near-Neighbour Particle Swarm Optimisation). Computational results of a case study on a given dataset as well as on multiple small, medium and large-scale datasets followed by sensitivity analysis show the potency and effectiveness of the introduced method. Lastly, there has been a scope for future study displayed which would lead to the further progress of these types of models.     

Evolutionary collective behavior decomposition model for time series data mining

In this research, we propose a novel framework referred to as collective game behavior decomposition where complex collective behavior is assumed to be generated by aggregation of several groups of agents following different strategies and complexity emerges from collaboration and competition of individuals. The strategy of an agent is modeled by certain simple game theory models with limited information. Genetic algorithms are used to obtain the optimal collective behavior decomposition based on history data. The trained model can be used for collective behavior prediction. For modeling individual behavior, two simple games, the minority game and mixed game are investigated in experiments on the real-world stock prices and foreign-exchange rate. Experimental results are presented to show the effectiveness of the new proposed model.     

Comparative evaluation of different statistical tools for the prediction of uniaxial compressive strength of rocks

In this study, uniaxial compressive strength (UCS), unit weight (UW), Brazilian tensile strength (BTS), Schmidt hardness (SHH), Shore hardness (SSH), point load index (Is₅₀) and P-wave velocity (V_p) properties were determined. To predict the UCS, simple regression (SRA), multiple regression (MRA), artificial neural network (ANN), adaptive neuro-fuzzy inference system (ANFIS) and genetic expression programming (GEP) have been utilized. The obtained UCS values were compared with the actual UCS values with the help of various graphs. Datasets were modeled using different methods and compared with each other. In the study where the performance indice PI_at was used to determine the best performing method, MRA method is the most successful method with a small difference. It is concluded that the mean PI_at equal to 2.46 for testing dataset suggests the superiority of the MRA, while these values are 2.44, 2.33, and 2.22 for GEP, ANFIS, and ANN techniques, respectively. The results pointed out that the MRA can be used for predicting UCS of rocks with higher capacity in comparison with others. According to the performance index assessment, the weakest model among the nine model is P7, while the most successful models are P2, P9, and P8, respectively.     

A simulation study of reduction kinetics for sponge iron production in a rotary hearth furnace

ABSTRACT

A mathematical model has been developed by coupling genetic algorithm (GA) with heat and material balance equations to estimate rate parameters and solid-phase evolution related to the reduction of iron ore-coal composite pellets in a multi-layer bed Rotary hearth Furnace (RHF). The present process involves treating iron ore-coal composite pellets in a crucible over the hearth in RHF. The various solid phases evolved at the end of the process are estimated experimentally, and are used in conjunction with the model to estimate rate parameters. The predicted apparent activation energy for the wustite reduction step is found to be lower than those of the reduction of higher oxides. The thermal efficiency is found to decrease significantly with an increase in the carbon content of the pellet. Thermal efficiency was also found to increase mildly up to three layers. Multilayer bed remains as a potential design parameter to increase thermal efficiency.     

Genetic algorithm and self organizing map based fuzzy hybrid intelligent method for color image segmentation

The grouping of pixels based on some similarity criteria is called image segmentation. In this paper the problem of color image segmentation is considered as a clustering problem and a fixed length genetic algorithm (GA) is used to handle it. The effectiveness of GA depends on the objective function (fitness function) and the initialization of the population. A new objective function is proposed to evaluate the quality of the segmentation and the fitness of a chromosome. In fixed length genetic algorithm the chromosomes have same length, which is normally set by the user. Here, a self organizing map (SOM) is used to determine the number of segments in order to set the length of a chromosome automatically. An opposition based strategy is adopted for the initialization of the population in order to diversify the search process. In some cases the proposed method makes the small regions of an image as separate segments, which leads to noisy segmentation. A simple ad hoc mechanism is devised to refine the noisy segmentation. The qualitative and quantitative results show that the proposed method performs better than the state-of-the-art methods.     

Genetic diversity by AFLP analysis within Jatropha curcas L. populations in the State of São Paulo,Brazil

The genetic diversity of 5 populations of Jatropha curcas L. (Euphorbiaceae), a species cultivated in tropical countries and used in biodiesel production, was analyzed by amplified fragment length polymorphism (AFLP). Plants from distinct populations found in the State of São Paulo, Brazil, had their genetic diversity characterized by using three primer combinations. The number of polymorphic bands obtained reached 184 and the base pair length of bands ranged from 75 to 350, with average PIC values of 0.418. Accessions from the Aguas de Santa Barbara population presented the highest percentage of polymorphic loci (89.76%), followed by the populations of Catanduva (84.24%), Jales (80.98%), Jurucê (78.80%) and Taquaritinga (70.65%). Plants collected from the populations of Taquaritinga and Jales presented the smallest and highest genetic diversities, respectively, measured by using both Nei's genetic variability index (h = 0.2242 and 0.2973) and Shannon's index (I = 0.3359 and 0.4319). The results obtained indicated that 73.1% of genetic variability corresponds to intrapopulational variation and 26.8% to variation among populations. The clustering dendrogram using Jacquard showed four clusters. Three clusters with low genetic diversity grouped most of individuals collected in distinct regions (63.3% JU, 47.0% JA and 82.5% TA) and the fourth with the higher genetic diversity was composed with basically individuals collected in CA and AS, but it also had samples collected in JU, JA and TA, where it is possible to select individuals to be included in breeding programs.