An experimental study of adaptive control for evolutionary algorithms

In this paper, we investigate how adaptive operator selection techniques are able to efficiently manage the balance between exploration and exploitation in an evolutionary algorithm, when solving combinatorial optimization problems. We introduce new high level reactive search strategies based on a generic algorithm's controller that is able to schedule the basic variation operators of the evolutionary algorithm, according to the observed state of the search. Our experiments on SAT instances show that reactive search strategies improve the performance of the solving algorithm.     

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.     

Complexities of digital technology use and the teaching and learning of function

Many argue that digital technologies have the potential to enhance the teaching and learning of mathematics. However, the availability of technology is not sufficient to realise this potential. The study reported takes a detailed approach to investigate the utility of the particular offerings of the available technologies in the teaching and learning of a specific area of mathematics, functions. Sixteen affordances identified in the data are described. The complexity of the process involved in resolving a situation where particular affordances would be useful so as they are perceived and enacted is detailed. Finally, a grounded theory framework arising from the data analysis from this study that can be used to explain, predict and guide action in other digital environments is presented.     

Lagrangian relaxation hybrid with evolutionary algorithm for short-term generation scheduling

Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed.     

Covariance matrix adaptation evolution strategy based design of fixed structure robust H∞ loop shaping controller

This paper proposes the application of Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in fixed structure H_∞ loop shaping controller design. Integral Time Absolute Error (ITAE) performance requirement is incorporated as a constraint with an objective of maximization of stability margin in the fixed structure H_∞ loop shaping controller design problem. Pneumatic servo system, separating tower process and F18 fighter aircraft system are considered as test systems. The CMA-ES designed fixed structure H_∞ loop-shaping controller is compared with the traditional H_∞ loop shaping controller, non-smooth optimization and Heuristic Kalman Algorithm (HKA) based fixed structure H_∞ loop shaping controllers in terms of stability margin. 20% perturbation in the nominal plant is used to validate the robustness of the CMA-ES designed H_∞ loop shaping controller. The effect of Finite Word Length (FWL) is considered to show the implementation difficulties of controller in digital processors. Simulation results demonstrated that CMA-ES based fixed structure H_∞ loop shaping controller is suitable for real time implementation with good robust stability and performance.     

Quantum computation based bundling optimization for combinatorial auction in freight service procurements

Combinatorial auction is a useful trade manner for transportation service procurements in e-marketplaces. To enhance the competition of combinatorial auction, a novel auction mechanism of two-round bidding with bundling optimization is proposed. As the recommended the auction mechanism, the shipper/auctioneer integrates the objects into several bundles based on the bidding results of first round auction. Then, carriers/bidders bid for the object bundles in second round. The bundling optimization is described as a multi-objective model with two criteria on price complementation and combination consistency. A Quantum Evolutionary Algorithm (QEA) with β-based rotation gate and the encoding scheme based on non-zero elements in complementary coefficient matrix is developed for the model solution. Comparing with a Contrast Genetic Algorithm, QEA can achieve better computational performances for small and middle size problems.     

面源红外诱饵对抗红外制导导弹干扰策略研究

面源红外诱饵使用的过程中,合理有效的干扰策略是干扰红外制导导弹的关键,针对这一问题,通过理论分析与仿真模拟相结合得到面源红外诱饵对抗红外制导导弹的干扰策略。首先以红外成像制导导弹为例,介绍红外制导导弹的仿真模型,然后将攻击过程分为锁定前与锁定后,以命中率为评价指标,得到两个阶段下的最佳干扰策略,包括诱饵的最佳释放时机、释放间隔以及载机应采取的机动动作等。     

Understanding the differences between how novice and experienced designers approach design tasks

Research was undertaken to understand how to provide the most appropriate support for novice designers in engineering design. However, how designers apply their experience and knowledge is not understood and further research in this area is required. This paper describes an observational study to understand how novice and experienced designers approach design tasks. Electronic Publication     

Micro assembly injection moulding

Injection moulding is established as one of the most common manufacturing processes of thermoplastics due to its high degree of automation and the short cycle times. Micro injection moulding is a rapidly growing technology that allows for the efficient production of very complex micro parts in high series. The “Market Analysis for Microsystems II 2002–2005” of the Nexus Task Force anticipates a yearly growth in the field of micro system technology of about 20% (Wechsung et al. 2002). This study identifies in addition to the continuous miniaturization the growing use of polymers in micro systems (Schneider et al. 2001). No other material group offers this wide range of material properties and permits to choose processing parameters and application properties according to necessities (Gächter 2000). While the production processes of micro technical components are mainly controllable, the assembly of these components to hybrid micro systems is a bottleneck to the industrial large scale production. The assembly itself represents a large fraction of the added product value and gains in importance with growing complexity and miniaturization of the systems.     

Evolutionary algorithms and de novo peptide design

One of the goals of computational chemistry is the automated de novo design of bioactive molecules. Despite significant progress in computational approaches to ligand design and efficient evaluation of binding energy, novel procedures for ligand design are required. Evolutionary computation provides a new approach to this design issue. This paper presents an automated methodology for computer-aided peptide design based on evolutionary algorithms. It provides an automatic tool for peptide de novo design, based on protein surface patches defined by user. Regarding the restrictive constrains of this problem a special emphasis has been made on the design of the evolutionary algorithms implemented.