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.     

A modified particle swarm optimization with multiple subpopulations for multimodal function optimization problems

In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations.     

Teaching and Learning Electrochemistry

Numerous conceptual difficulties and misconceptions have been reported in the science and chemistry education literature about electrochemistry concepts such as electrolytes, redox equations, and about electrochemical (galvanic and electrolytic) cells. Other studies have considered teaching approaches aimed at improving learning and at overcoming misconceptions. This paper reviews these studies and considers strategies and approaches for the effective teaching of electrochemistry. Then, the review focuses on problem solving in equilibrium electrochemistry, especially problems involving the Nernst equation. The main findings of four studies with Greek university chemistry students, dealing with: (i) algorithmic problem‐solving ability; (ii) practice on problem solving; (iii) the effect of the format of a problem; and (iv) the construction and evaluation of a website devoted to electrochemistry problem solving, are reported.     

Control theory for stochastic distributed parameter systems,an engineering perspective

The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

A globally convergent BFGS method for pseudo-monotone variational inequality problems

In this paper, we propose a globally convergent BFGS method to solve Variational Inequality Problems (VIPs). In fact, a globalization technique on the basis of the hyperplane projection method is applied to the BFGS method. The technique, which is independent of any merit function, is applicable for pseudo-monotone problems. The proposed method applies the BFGS direction and tries to reduce the distance of iterates to the solution set. This property, called Fejer monotonicity of iterates with respect to the solution set, is the basis of the convergence analysis. The method applied to pseudo-monotone VIP is globally convergent in the sense that subproblems always have unique solutions, and the sequence of iterates converges to a solution to the problem without any regularity assumption. Finally, some numerical simulations are included to evaluate the efficiency of the proposed algorithm.     

Multiple Empirical Kernel Learning with Majority Projection for imbalanced problems

Traditional Multiple Empirical Kernel Learning (MEKL) expands the expressions of the sample and brings better classification ability by using different empirical kernels to map the original data space into multiple kernel spaces. To make MEKL suit for the imbalanced problems, this paper introduces a weight matrix and a regularization term into MEKL. The weight matrix assigns high misclassification cost to the minority samples to balanced misclassification cost between minority and majority class. The regularization term named Majority Projection (MP) is used to make the classification hyperplane fit the distribution shape of majority samples and enlarge the between-class distance of minority and majority class. The contributions of this work are: (i) assigning high cost to minority samples to deal with imbalanced problems, (ii) introducing a new regularization term to concern the property of data distribution, (iii) and modifying the original PAC-Bayes bound to test the error upper bound of MEKL-MP. Through analyzing the experimental results, the proposed MEKL-MP is well suited to the imbalanced problems and has lower generalization risk in accordance with the value of PAC-Bayes bound.     

The generalized discrete ‐centroid problem

The ‐centroid problem or leader–follower problem is generalized considering different customer choice rules where a customer may use facilities belonging to different firms, if the difference in travel distance (or time) is small enough. Assuming essential goods, some particular customer choice rules are analyzed. Linear programming formulations for the generalized ‐medianoid and ‐centroid problems are presented and an exact solution approach is applied. Some computational examples are included.     

Semirigid inclusions in elastic bodies: Mechanical interplay and optimal control

The paper concerns an analysis of an equilibrium problem for 2D elastic body with two semirigid inclusions. It is assumed that inclusions have a joint point, and we investigate a junction problem for these inclusions. The existence of solutions is proved, and different equivalent formulations of the problem are proposed. We investigate a convergence to infinity of a rigidity parameter of the semirigid inclusion. It is proved that in the limit, we obtain an equilibrium problem for the elastic body with a rigid inclusion and a semirigid one. A parameter identification problem is investigated. In particular, the existence of a solution to a suitable optimal control problem is proved.     

Experimental optimization of power-function-shaped drive pulse for stick-slip piezo actuators

Motion of a stick-slip piezo actuator is generally controlled by the parameters related to its mechanical design and characteristics of the driving pulses applied to piezoceramic shear plates. The goal of the proposed optimization method is to find the driving pulse parameters leading to the fastest and the most reliable actuator operation. In the paper the method is tested on a rotary stick-slip piezo actuating system utilized in an atomic force microscope.The optimization is based on the measurement of the actuator response to driving pulses of different shapes and repetition frequencies at various load forces. To provide it, a computer controlled testing system generating the driving pulses, and detecting and recording the corresponding angular motion response of the actuator by a position sensitive photo detector (PSPD) in real time has been developed. To better understand and interpret the experimental results, supportive methods based on a simple analytical model and numerical simulations were used as well.In this way the shapes of the single driving pulses and values of the load force providing the biggest actuator steps were determined. Generally, the maximal steps were achieved for such a combination of the pulse shapes and load forces providing high velocities at the end of the sticking mode of the actuator motion and, at the same time, lower decelerations during the slipping mode.As for the multiple driving pulses, the pulse shapes and values of repetition frequency ensuring the sticking mode of the actuator motion during the pulse rise time together with the maximum average angular rotor velocity were specified. In this way the effective and stable operation conditions of the actuator were provided.In principle, the presented method can be applied for the testing and optimization of any linear or angular stick-slip actuator.