A hybrid homogeneously weighted moving average control chart for process monitoring: Discussion

The sensitivity of a monitoring scheme depends on many factors including the variance of the charting statistic which is very important in the computation of the control limits. This paper discusses the computation of the variance of the recently proposed hybrid homogeneously weighted moving average (HHWMA) $\overline{X}$ scheme which was based on an incorrect assumption. The correct variance is used to evaluate the run-length characteristics of the HHWMA $\overline{X}$ scheme. It is observed that the incorrect variance has a significant impact on the sensitivity (or performance) of the HHWMA $\overline{X}$ scheme.     

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.     

A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

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.     

Achieving Rich and Active Alkaline Hydrogen Evolution Heterostructures via Interface Engineering on 2D 1T‐MoS2 Quantum Sheets

Large‐scale production of hydrogen from water‐alkali electrolyzers is impeded by the sluggish kinetics of hydrogen evolution reaction (HER) electrocatalysts. The hybridization of an acid‐active HER catalyst with a cocatalyst at the nanoscale helps boost HER kinetics in alkaline media. Here, it is demonstrated that 1T–MoS₂ nanosheet edges (instead of basal planes) decorated by metal hydroxides form highly active ${\text{edge}}_{{\text{1T‐MoS}}_{\text{2}}}$/ ${\text{edge}}_{\text{Ni}{(\text{OH})}_{\text{2}}}$ heterostructures, which significantly enhance HER performance in alkaline media. Featured with rich ${\text{edge}}_{{\text{1T‐MoS}}_{\text{2}}}$/ ${\text{edge}}_{\text{Ni}{(\text{OH})}_{\text{2}}}$ sites, the fabricated 1T–MoS₂ QS/Ni(OH)₂ hybrid (quantum sized 1T–MoS₂ sheets decorated with Ni(OH)₂ via interface engineering) only requires overpotentials of 57 and 112 mV to drive HER current densities of 10 and 100 mA cm^?2, respectively, and has a low Tafel slope of 30 mV dec^?1 in 1 m KOH. So far, this is the best performance for MoS₂‐based electrocatalysts and the 1T–MoS₂ QS/Ni(OH)₂ hybrid is among the best‐performing non‐Pt alkaline HER electrocatalysts known. The HER process is durable for 100 h at current densities up to 500 mA cm^?2. This work not only provides an active, cost‐effective, and robust alkaline HER electrocatalyst, but also demonstrates a design strategy for preparing high‐performance catalysts based on edge‐rich 2D quantum sheets for other catalytic reactions.     

Event-triggered variable horizon Supervisory Predictive control of hybrid power plants

The supervision of a hybrid power plant, including solar panels, a gas microturbine and a storage unit operating under varying solar power profiles is considered. The Economic Supervisory Predictive controller assigns the power references to the controlled subsystems of the hybrid cell using a financial criterion. A prediction of the renewable sources power is embedded into the supervisor. Results deteriorate when the solar power is unsteady, owing to the inaccuracy of the predictions for a long-range horizon of 10 s. The receding horizon is switched between an upper and a lower value according to the amplitude of the solar power trend. Theoretical results show the relevance of horizon switching, according to a tradeoff between performance and prediction accuracy. Experimental results, obtained in a Hardware In the Loop (HIL) framework, show the relevance of the variable horizon approach. Power amplifiers allow us to simulate virtual components, such as a gas microturbine, and to blend their powers with that of real devices (storage unit, real solar panels). In this case, fuel savings, reaching 15%, obtained under unsteady operating conditions lead to a better overall performance of the hybrid cell. The overall savings obtained in the experiments amount to 12%.     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation.     

An unsupervised approach to generating generic summaries of documents

We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately.