Zhun Fan

The Hierarchical Fair Competition (HFC) Framework for Sustainable Evolutionary Algorithms

Many current Evolutionary Algorithms (EAs) suffer from a tendency to converge prematurely or stagnate without progress for complex problems. This may be due to the loss of or failure to discover certain valuable genetic material or the loss of the capability to discover new genetic material before convergence has limited the algorithms ability to search widely. In this paper, the Hierarchical Fair Competition (HFC) model, including several variants, is proposed as a generic framework for sustainable evolutionary search by transforming the convergent nature of the current EA framework into a non-convergent search process. That is, the structure of HFC does not allow the convergence of the population to the vicinity of any set of optimal or locally optimal solutions. The sustainable search capability of HFC is achieved by ensuring a continuous supply and the incorporation of genetic material in a hierarchical manner, and by culturing and maintaining, but continually renewing, populations of individuals of intermediate fitness levels. HFC employs an assembly-line structure in which subpopulations are hierarchically organized into different fitness levels, reducing the selection pressure within each subpopulation while maintaining the global selection pressure to help ensure the exploitation of the good genetic material found. Three EAs based on the HFC principle are tested - two on the even-10-parity genetic programming benchmark problem and a real-world analog circuit synthesis problem, and another on the HIFF genetic algorithm (GA) benchmark problem. The significant gain in robustness, scalability and efficiency by HFC, with little additional computing effort, and its tolerance of small population sizes, demonstrates its effectiveness on these problems and shows promise of its potential for improving other existing EAs for difficult problems. A paradigm shift from that of most EAs is proposed: rather than trying to escape from local optima or delay convergence at a local optimum, HFC allows the emergence of new optima continually in a bottom-up manner, maintaining low local selection pressure at all fitness levels, while fostering exploitation of high-fitness individuals through promotion to higher levels.

Toward a unified and automated design methodology for multi-domain dynamic systems using bond graphs and genetic programming

Abstract This paper suggests a unified and automated design methodology for synthesizing designs for multi-domain systems, such as mechatronic systems. A multi-domain dynamic system includes a mixture of electrical, mechanical, hydraulic, pneumatic, and/or thermal components, making it difficult use a single design tool to design a system to meet specified performance goals. The multi-domain design approach is not only efficient for mixed-domain problems, but is also useful for addressing separate single-domain design problems with a single tool. Bond graphs (BGs) are domain independent, allow free composition, and are efficient for classification and analysis of models, allowing rapid determination of various types of acceptability or feasibility of candidate designs. This can sharply reduce the time needed for analysis of designs that are infeasible or otherwise unattractive. Genetic programming is well recognized as a powerful tool for open-ended search. The combination of these two powerful methods is therefore an appropriate target for a better system for synthesis of complex multi-domain systems. The approach described here will evolve new designs (represented as BGs) with ever-improving performance, in an iterative loop of synthesis, analysis, and feedback to the synthesis process. The suggested design methodology has been applied here to three design examples. The first is a domain-independent eigenvalue placement design problem that is tested for some sample target sets of eigenvalues. The second is in the electrical domain––design of analog filters to achieve specified performance over a given frequency range. The third is in the electromechanical domain––redesign of a printer drive system to obtain desirable steady-state position of a rotational load.

Knowledge interaction with genetic programming in mechatronic systems design using bond graphs

This paper describes a unified network synthesis approach for the conceptual stage of mechatronic systems design using bond graphs. It facilitates knowledge interaction with evolutionary computation significantly by encoding the structure of a bond graph in a genetic programming tree representation. On the one hand, since bond graphs provide a succinct set of basic design primitives for mechatronic systems modeling, it is possible to extract useful modular design knowledge discovered during the evolutionary process for design creativity and reusability. On the other hand, design knowledge gained from experience can be incorporated into the evolutionary process to improve the topologically open-ended search capability of genetic programming for enhanced search efficiency and design feasibility. This integrated knowledge-based design approach is demonstrated in a quarter-car suspension control system synthesis and a MEMS bandpass filter design application.

An External Archive Guided Multiobjective Evolutionary Algorithm Based on Decomposition for Combinatorial Optimization

Domination-based sorting and decomposition are two basic strategies used in multiobjective evolutionary optimization. This paper proposes a hybrid multiobjective evolutionary algorithm integrating these two different strategies for combinatorial optimization problems with two or three objectives. The proposed algorithm works with an internal (working) population and an external archive. It uses a decomposition-based strategy for evolving its working population and uses a domination-based sorting for maintaining the external archive. Information extracted from the external archive is used to decide which search regions should be searched at each generation. In such a way, the domination-based sorting and the decomposition strategy can complement each other. In our experimental studies, the proposed algorithm is compared with a domination-based approach, a decomposition-based one, and one of its enhanced variants on two well-known multiobjective combinatorial optimization problems. Experimental results show that our proposed algorithm outperforms other approaches. The effects of the external archive in the proposed algorithm are also investigated and discussed.

Service robots for hospitals: A case study of transportation tasks in a hospital

In this paper, the need for automated transportation systems for hospitals is investigated. Among other alternatives, mobile robots stand out as the most prominent means of automation of transportation tasks in hospitals. Existing transportation routines of a hospital are analyzed in order to verify the need for automation and identify possible areas of improvement. The analysis shows that most of the existing transportation is carried out manually, and hospitals can greatly benefit from automated transportation. Based on the results of the analysis, three alternatives are derived for implementing mobile service robots for transportation tasks in hospitals.

Improved Differential Evolution Based on Stochastic Ranking for Robust Layout Synthesis of MEMS Components

This paper introduces an improved differential evolution (DE) algorithm for robust layout synthesis of microelectromechanical system components subject to inherent geometric uncertainties. A case study of the layout synthesis of a comb-driven microresonator shows that the approach proposed in this paper can lead to design results that meet the target performance and are less sensitive to geometric uncertainties than the typical designs. It is also demonstrated that the algorithm proposed in this paper cannot only obtain better results than the standard DE algorithm but also outperform some other state-of-the-art algorithms in constrained optimization.

A Novel Evolutionary Engineering Design Approach for Mixed-Domain Systems

This paper presents an approach to engineering design of mixed-domain dynamic systems. The approach aims at system-level design and has two key features: first, it generates engineering designs that satisfy predefined specifications in an automatic manner; second, it can design systems belonging to different or mixed physical domains, such as electrical, mechanical, hydraulic, pneumatic, thermal systems and/or a mixture of them. Two important tools are used in this approach, namely, bond graphs and genetic programming. Bond graphs are useful because they are domain independent, amenable to free structural composition, and are efficient for classification and analysis, allowing rapid determination of various types of acceptability or feasibility of candidate designs. Genetic programming, on the other hand, is a powerful tool for open-ended topological search. To prevent the premature convergence often encountered in evolutionary computation, a hierarchical fair competition model is adopted in this work. Examples of an analog filter design and an MEM filter design illustrate the application of the approach.

A novel memetic algorithm based on invasive weed optimization and differential evolution for constrained optimization

This paper presents a novel memetic algorithm, named as IWO_DE, to tackle constrained numerical and engineering optimization problems. In the proposed method, invasive weed optimization (IWO), which possesses the characteristics of adaptation required in memetic algorithm, is firstly considered as a local refinement procedure to adaptively exploit local regions around solutions with high fitness. On the other hand, differential evolution (DE) is introduced as the global search model to explore more promising global area. To accommodate the hybrid method with the task of constrained optimization, an adaptive weighted sum fitness assignment and polynomial distribution are adopted for the reproduction and the local dispersal process of IWO, respectively. The efficiency and effectiveness of the proposed approach are tested on 13 well-known benchmark test functions. Besides, our proposed IWO_DE is applied to four well-known engineering optimization problems. Experimental results suggest that IWO_DE can successfully achieve optimal results and is very competitive compared with other state-of-art algorithms.

A low energy intelligent clustering protocol for wireless sensor networks

LEACH (low-energy adaptive clustering hierarchy) is a well-known self-organizing, adaptive clustering protocol of wireless sensor networks. However it has some shortcomings when it faces such problems as the cluster construction and energy management. In this paper, LEICP (low energy intelligent clustering protocol), an improvement of the LEACH protocol is proposed to overcome the shortcomings of LEACH. LEICP aims at balancing the energy consumption in every cluster and prolonging the network lifetime. A fitness function is defined to balance the energy consumption in every cluster according to the residual energy and positions of nodes. In every round the node called auxiliary cluster-head calculates the position of the cluster-head using Bacterial Foraging Optimization Algorithm (BFOA). After aggregating the data received, the cluster-head node decides whether to choose another cluster-head as the next hop for delivering the messages or to send the data to the base station directly, using Dijkstra algorithm to compute an optimal path. The performance of LEICP is compared with that of LEACH. Simulation results demonstrate that LEICP can prolong the lifetime of the sensor network by about 62.28% compared with LEACH and acquire uniform number of cluster-heads and messages in the network.

An evolutionary approach for robust layout synthesis of MEMS

The paper introduces a robust design method for layout synthesis of MEM resonators subject to inherent geometric uncertainties such as the fabrication error on the sidewall of the structure. The robust design problem is formulated as a multi-objective constrained optimisation problem after certain assumptions and treated with multiobjective genetic algorithm (MOGA), a special type of evolutionary computing approaches. Case study based on layout synthesis of a comb-driven MEM resonator shows that the approach proposed in this paper can lead to design results that meet the target performance and are less sensitive to geometric uncertainties than typical designs