scholarly journals Quantum-Inspired Evolutionary Algorithm for Continuous Space Optimization Based on Multiple Chains Encoding Method of Quantum Bits

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Rui Zhang ◽  
Zhiteng Wang ◽  
Hongjun Zhang
Keyword(s):  
Evolutionary Algorithms ◽  
Evolutionary Algorithm ◽  
Evolutionary Rate ◽  
Search Space ◽  
Performance Comparison ◽  
Rotational Angle ◽  
Continuous Space ◽  
Quantum Bits ◽  
Effectiveness And Efficiency ◽  
Encoding Method

This study proposes a novel quantum evolutionary algorithm called four-chain quantum-inspired evolutionary algorithm (FCQIEA) based on the four gene chains encoding method. In FCQIEA, a chromosome comprises four gene chains to expand the search space effectively and promote the evolutionary rate. Different parameters, including rotational angle and mutation probability, have been analyzed for better optimization. Performance comparison with other quantum-inspired evolutionary algorithms (QIEAs), evolutionary algorithms, and different chains of QIEA demonstrates the effectiveness and efficiency of FCQIEA.

A New Multiple Objective Evolutionary Algorithm for Reliability Optimization of Series-Parallel Systems

2012 ◽  
Vol 3 (2) ◽  
pp. 1-18 ◽  
Author(s):  
Heidi A. Taboada ◽  
David W. Coit
Keyword(s):  
Evolutionary Algorithms ◽  
Evolutionary Algorithm ◽  
Parallel Systems ◽  
Search Space ◽  
Performance Comparison ◽  
Multiple Objective ◽  
Reliability Optimization ◽  
Design Problems ◽  
Reliability Design ◽  
Handling Method

A new multiple objective evolutionary algorithm is proposed for reliability optimization of series-parallel systems. This algorithm uses a genetic algorithm based on rank selection and elitist reinsertion and a modified constraint handling method. Because genetic algorithms are appropriate for high-dimensional stochastic problems with many nonlinearities or discontinuities, they are suited for solving reliability design problems. The developed algorithm mainly differs from other multiple objective evolutionary algorithms in the crossover operation performed and in the fitness assignment. In the crossover step, several offspring are created through multi-parent recombination. Thus, the mating pool contains a great amount of diverse solutions. The disruptive nature of the proposed type of crossover, called subsystem rotation crossover, encourages the exploration of the search space. The paper presents a multiple objective formulation of the redundancy allocation problem. The three objective functions that are simultaneously optimized are the maximization of system reliability, the minimization of system cost, and the minimization of system weight. The proposed algorithm was thoroughly tested and a performance comparison of the proposed algorithm against one well-known multiple objective evolutionary algorithms that currently exists shows that the algorithm has a better performance when solving multiple objective redundant allocation problems.

Genetic Diversity as an Objective in Multi-Objective Evolutionary Algorithms

2003 ◽  
Vol 11 (2) ◽  
pp. 151-167 ◽  
Author(s):  
Andrea Toffolo ◽  
Ernesto Benini
Keyword(s):  
Genetic Diversity ◽  
Evolutionary Algorithms ◽  
Evolutionary Algorithm ◽  
Selection Pressure ◽  
Evaluation Method ◽  
State Of The Art ◽  
Search Space ◽  
Test Problems ◽  
Multi Objective ◽  
Diversity Evaluation

A key feature of an efficient and reliable multi-objective evolutionary algorithm is the ability to maintain genetic diversity within a population of solutions. In this paper, we present a new diversity-preserving mechanism, the Genetic Diversity Evaluation Method (GeDEM), which considers a distance-based measure of genetic diversity as a real objective in fitness assignment. This provides a dual selection pressure towards the exploitation of current non-dominated solutions and the exploration of the search space. We also introduce a new multi-objective evolutionary algorithm, the Genetic Diversity Evolutionary Algorithm (GDEA), strictly designed around GeDEM and then we compare it with other state-of-the-art algorithms on a well-established suite of test problems. Experimental results clearly indicate that the performance of GDEA is top-level.

scholarly journals Evolutionary Manytasking Optimization Based on Symbiosis in Biocoenosis

2019 ◽  
Vol 33 ◽  
pp. 4295-4303 ◽  
Author(s):  
Rung-Tzuo Liaw ◽  
Chuan-Kang Ting
Keyword(s):  
Evolutionary Algorithms ◽  
Evolutionary Algorithm ◽  
State Of The Art ◽  
The State ◽  
Experimental Results ◽  
Benchmark Problems ◽  
Good Estimator ◽  
Multiple Tasks ◽  
Effectiveness And Efficiency ◽  
Evolutionary Multitasking

Evolutionary multitasking is a significant emerging search paradigm that utilizes evolutionary algorithms to concurrently optimize multiple tasks. The multi-factorial evolutionary algorithm renders an effectual realization of evolutionary multitasking on two or three tasks. However, there remains room for improvement on the performance and capability of evolutionary multitasking. Beyond three tasks, this paper proposes a novel framework, called the symbiosis in biocoenosis optimization (SBO), to address evolutionary many-tasking optimization. The SBO leverages the notion of symbiosis in biocoenosis for transferring information and knowledge among different tasks through three major components: 1) transferring information through inter-task individual replacement, 2) measuring symbiosis through intertask paired evaluations, and 3) coordinating the frequency and quantity of transfer based on symbiosis in biocoenosis. The inter-task individual replacement with paired evaluations caters for estimation of symbiosis, while the symbiosis in biocoenosis provides a good estimator of transfer. This study examines the effectiveness and efficiency of the SBO on a suite of many-tasking benchmark problems, designed to deal with 30 tasks simultaneously. The experimental results show that SBO leads to better solutions and faster convergence than the state-of-the-art evolutionary multitasking algorithms. Moreover, the results indicate that SBO is highly capable of identifying the similarity between problems and transferring information appropriately.

scholarly journals A Reduced Uncertainty-Based Hybrid Evolutionary Algorithm for Solving Dynamic Shortest-Path Routing Problem

2015 ◽  
Vol 24 (05) ◽  
pp. 1550067 ◽  
Author(s):  
Huseyin Kusetogullari ◽  
Md. Haidar Sharif ◽  
Mark S. Leeson ◽  
Turgay Celik
Keyword(s):  
Evolutionary Algorithm ◽  
Shortest Path ◽  
State Of The Art ◽  
Search Space ◽  
Packet Transmission ◽  
Routing Problem ◽  
Shortest Path Routing ◽  
Hybrid Evolutionary Algorithm ◽  
Shortest Network ◽  
Encoding Method

The need of effective packet transmission to deliver advanced performance in wireless networks creates the need to find shortest network paths efficiently and quickly. This paper addresses a reduced uncertainty-based hybrid evolutionary algorithm (RUBHEA) to solve dynamic shortest path routing problem (DSPRP) effectively and rapidly. Genetic algorithm (GA) and particle swarm optimization (PSO) are integrated as a hybrid algorithm to find the best solution within the search space of dynamically changing networks. Both GA and PSO share context of individuals to reduce uncertainty in RUBHEA. Various regions of search space are explored and learned by RUBHEA. By employing a modified priority encoding method, each individual in both GA and PSO are represented as a potential solution for DSPRP. A complete statistical analysis has been performed to compare the performance of RUBHEA with various state-of-the-art algorithms. It shows that RUBHEA is considerably superior (reducing the failure rate by up to 50%) to similar approaches with increasing number of nodes encountered in the networks.

WHO: A New Evolutionary Algorithm Bio-Inspired by Wildebeests with a Case Study on Bank Customer Segmentation

2019 ◽  
Vol 33 (05) ◽  
pp. 1959017 ◽  
Author(s):  
Mohammad Mahdi Motevali ◽  
Ali Mohammadi Shanghooshabad ◽  
Reza Zohouri Aram ◽  
Hamidreza Keshavarz
Keyword(s):  
Data Mining ◽  
Evolutionary Algorithms ◽  
Evolutionary Algorithm ◽  
Banking Sector ◽  
Optimization Problems ◽  
High Mobility ◽  
Search Space ◽  
Customer Segmentation ◽  
Advantages And Disadvantages ◽  
And Migration

Numerous evolutionary algorithms have been proposed which are inspired by the amazing lives of creatures, such as animals, insects, and birds. Each inspired algorithm has its own advantages and disadvantages, and has its own way to accomplish exploration and exploitation. In this paper, a new evolutionary algorithm with novel concepts, called Wildebeests Herd Optimization (WHO), is proposed. This algorithm is inspired by the splendid life of wildebeests in Africa. Moving and migration are inseparable from wildebeests’ lives. When a wildebeest wants to choose its path during migration, it considers the best path known to itself, the location of the more mature wildebeests in the crowd, and the direction of wildebeests with high mobility. The WHO algorithm imitates these traits, and can concurrently explore and exploit the search space. For validating WHO, it is applied to optimization problems and data mining tasks. It is demonstrated that WHO outperforms other evolutionary algorithms, such as genetic algorithm (GA) and particle swarm optimization, in the assessed problems. Then, WHO is applied to the customer segmentation problem. Customer segmentation is one of the most important tasks of data mining, especially in the banking sector. In this paper, the customers of a bank with current accounts are segmented using WHO based on four aspects: profitability, cost, loyalty and credit; some of these aspects are calculated in a novel way. The results were welcome by the bank authorities.

Placement of Digital Microfluidic Biochips via a New Evolutionary Algorithm

2021 ◽  
Vol 26 (6) ◽  
pp. 1-22
Author(s):  
Chen Jiang ◽  
Bo Yuan ◽  
Tsung-Yi Ho ◽  
Xin Yao
Keyword(s):  
Evolutionary Algorithm ◽  
Resource Constraints ◽  
Scheduling Algorithm ◽  
Search Space ◽  
Placement Problem ◽  
Heuristic Scheduling ◽  
Microfluidic Biochips ◽  
Feasible Solutions ◽  
Digital Microfluidic ◽  
Operation Scheduling

Digital microfluidic biochips (DMFBs) have been a revolutionary platform for automating and miniaturizing laboratory procedures with the advantages of flexibility and reconfigurability. The placement problem is one of the most challenging issues in the design automation of DMFBs. It contains three interacting NP-hard sub-problems: resource binding, operation scheduling, and module placement. Besides, during the optimization of placement, complex constraints must be satisfied to guarantee feasible solutions, such as precedence constraints, storage constraints, and resource constraints. In this article, a new placement method for DMFB is proposed based on an evolutionary algorithm with novel heuristic-based decoding strategies for both operation scheduling and module placement. Specifically, instead of using the previous list scheduler and path scheduler for decoding operation scheduling chromosomes, we introduce a new heuristic scheduling algorithm (called order scheduler) with fewer limitations on the search space for operation scheduling solutions. Besides, a new 3D placer that combines both scheduling and placement is proposed where the usage of the microfluidic array over time in the chip is recorded flexibly, which is able to represent more feasible solutions for module placement. Compared with the state-of-the-art placement methods (T-tree and 3D-DDM), the experimental results demonstrate the superiority of the proposed method based on several real-world bioassay benchmarks. The proposed method can find the optimal results with the minimum assay completion time for all test cases.

scholarly journals Drift Analysis and Evolutionary Algorithms Revisited

2018 ◽  
Vol 27 (4) ◽  
pp. 643-666 ◽  
Author(s):  
J. LENGLER ◽  
A. STEGER
Keyword(s):  
Evolutionary Algorithms ◽  
Evolutionary Algorithm ◽  
Random Search ◽  
Optimization Algorithms ◽  
Simple Algorithm ◽  
Linear Functions ◽  
Search Point ◽  
Drift Analysis ◽  
Fixed Constant ◽  
Greedy Optimization

One of the easiest randomized greedy optimization algorithms is the following evolutionary algorithm which aims at maximizing a function f: {0,1}n → ℝ. The algorithm starts with a random search point ξ ∈ {0,1}n, and in each round it flips each bit of ξ with probability c/n independently at random, where c > 0 is a fixed constant. The thus created offspring ξ' replaces ξ if and only if f(ξ') ≥ f(ξ). The analysis of the runtime of this simple algorithm for monotone and for linear functions turned out to be highly non-trivial. In this paper we review known results and provide new and self-contained proofs of partly stronger results.

scholarly journals An automated system analysis and design tool for spacecrafts ceas space journal

2021 ◽  
Author(s):  
Manfred Ehresmann ◽  
Georg Herdrich ◽  
Stefanos Fasoulas
Keyword(s):  
Evolutionary Algorithms ◽  
Evolutionary Algorithm ◽  
Degrees Of Freedom ◽  
System Analysis ◽  
Propulsion System ◽  
Optimal System ◽  
Automated System ◽  
Processing Unit ◽  
Data Set ◽  
Analysis And Design

AbstractIn this paper, a generic full-system estimation software tool is introduced and applied to a data set of actual flight missions to derive a heuristic for system composition for mass and power ratios of considered sub-systems. The capability of evolutionary algorithms to analyse and effectively design spacecraft (sub-)systems is shown. After deriving top-level estimates for each spacecraft sub-system based on heuristic heritage data, a detailed component-based system analysis follows. Various degrees of freedom exist for a hardware-based sub-system design; these are to be resolved via an evolutionary algorithm to determine an optimal system configuration. A propulsion system implementation for a small satellite test case will serve as a reference example of the implemented algorithm application. The propulsion system includes thruster, power processing unit, tank, propellant and general power supply system masses and power consumptions. Relevant performance parameters such as desired thrust, effective exhaust velocity, utilised propellant, and the propulsion type are considered as degrees of freedom. An evolutionary algorithm is applied to the propulsion system scaling model to demonstrate that such evolutionary algorithms are capable of bypassing complex multidimensional design optimisation problems. An evolutionary algorithm is an algorithm that uses a heuristic to change input parameters and a defined selection criterion (e.g., mass fraction of the system) on an optimisation function to refine solutions successively. With sufficient generations and, thereby, iterations of design points, local optima are determined. Using mitigation methods and a sufficient number of seed points, a global optimal system configurations can be found.

Sign in / Sign up

Export Citation Format

Share Document