Search

Friction is an inherent nonlinear disturbance that can lead to creeping, jitter, and decreased tracking precision in an electro-hydraulic servo system. In this paper, the LuGre friction model is used to describe the dynamic and static characteristics of the friction force of a servo system comprehensively. Accurate identification of model parameters is key to implementing friction compensation. However, traditional genetic identification algorithms have the shortcomings of a premature solution, slow convergence, and poor accuracy. To address these shortcomings, this paper proposes an improved adaptive genetic identification algorithm. The proposed algorithm selects evolutionary processes adaptively according to the population concentration in the initial stage of population evolution. Moreover, it adjusts the crossover probability and the mutation probability to identify a local optimum accurately and converge to the global optimum rapidly. During the late stage of population evolution, the accuracy of the global optimal solution can be improved by reducing the search range of identification parameters. The simulation results show that the relative error of the model parameter values identified by the proposed algorithm is reduced to less than 1% and the convergence speed is faster. Compared with the existing traditional genetic algorithm and adaptive genetic algorithm, the overall performance of the proposed method is better. This study provides a feasible and highly accurate identification method for parameter identification of friction models used in electro-hydraulic servo systems. [ABSTRACT FROM AUTHOR]

Dynamic linear functions on the boolean hypercube are functions which assign to each bit a positive weight, but the weights change over time. Throughout optimization, these functions maintain the same global optimum, and never have defecting local optima. Nevertheless, it was recently shown [Lengler, Schaller, FOCI 2019] that the (1 + 1) -Evolutionary Algorithm needs exponential time to find or approximate the optimum for some algorithm configurations. In this experimental paper, we study the effect of larger population sizes for dynamic binval, the extreme form of dynamic linear functions. We find that moderately increased population sizes extend the range of efficient algorithm configurations, and that crossover boosts this positive effect substantially. Remarkably, similar to the static setting of monotone functions in [Lengler, Zou, FOGA 2019], the hardest region of optimization for (μ + 1) -EA is not close the optimum, but far away from it. In contrast, for the (μ + 1) -GA, the region around the optimum is the hardest region in all studied cases.Kindly check and confirm the inserted city name is correctly identified.Correct. [ABSTRACT FROM AUTHOR]

This paper investigates the use of Oracle PL/SQL and Genetic Algorithms for performing bulk resource scheduling tasks. To achieve this current theory and information from literature were examined, in order to select a suitable set of methods and algorithms. The findings of this paper are that PL/SQL and Genetic Algorithms when combined with knowledge bases provides an acceptable level of accuracy and speed when scheduling multiple of constrained resources. [ABSTRACT FROM AUTHOR]

The main focus of this paper is on the family of evolutionary algorithms and their real-life applications. We present the following algorithms: genetic algorithms, genetic programming, differential evolution, evolution strategies, and evolutionary programming. Each technique is presented in the pseudo-code form, which can be used for its easy implementation in any programming language. We present the main properties of each algorithm described in this paper. We also show many state-of-the-art practical applications and modifications of the early evolutionary methods. The open research issues are indicated for the family of evolutionary algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel memetic algorithm (MA) for the solution of the resource leveling problem (RLP). The evolutionary framework of the MA is based on integration of a genetic algorithm and simulated annealing methods along with a resource leveling heuristic. The main objective of the proposed algorithm is to integrate complementary strengths of different optimization methods and incorporate the individual learning as a separate process for achieving a successful optimization method for the RLP. The performance of the MA is compared with the state-of-the-art leveling methods. For small instances up to 30 activities, mixed-integer linear models are presented for two leveling metrics to provide a basis for performance evaluation. The computational results indicate that the new integrated framework of the MA outperforms the state-of-the-art leveling heuristics and meta-heuristics and provides a successful method for the RLP. The limitations of popular commercial project management software are also illustrated along with the improvements achieved by the MA to reveal potential contributions of the proposed integrated framework in practice. [ABSTRACT FROM AUTHOR]

The study of optimization methods for reliability-redundancy allocation problems is a constantly changing field. New algorithms are continually being designed on the basis of observations of nature, wildlife, and humanity. In this paper, we review eight major evolutionary algorithms that emulate the behavior of civilization, ants, bees, fishes, and birds (i.e., genetic algorithms, bee colony optimization, simulated annealing, particle swarm optimization, biogeography-based optimization, artificial immune system optimization, cuckoo algorithm and imperialist competitive algorithm). We evaluate the mathematical formulations and pseudo-codes of each algorithm and discuss how these apply to reliability-redundancy allocation problems. Results from a literature survey show the best results found for series, series-parallel, bridge, and applied case problems (e.g., over-speeding gas turbine benchmark). Review of literature from recent years indicates an extensive improvement in the algorithm reliability performance. However, this improvement has been difficult to achieve for high-reliability applications. Insights and future challenges in reliability-redundancy allocation problems optimization are also discussed in this paper. [ABSTRACT FROM AUTHOR]

This paper investigates a methodology for adaptation of the mutation factor within an evolutionary algorithm by means of measuring the improvement differential between successive generations. When no improvement is obtained in an evolutionary algorithm and it has not located the global optimum, it is an indication that the algorithm may have become trapped within a local minimum or maximum. Mutation is a tool within the algorithm that is designed to assist in escaping from these local extremes. It is therefore the premise of this paper that if the preset value for mutation probability is proving insufficient to release the algorithm from entrapment in a local minima or maxima, then a temporary increase in this mutation probability may assist in freeing the algorithm and therefore increasing its chances of ultimately converging on a global optimum. In order to determine when to implement the increase in mutation probability our algorithm measures the fitness improvement between successive generations in the algorithm. When no improvement is detected for a number of successive generations the probability is increased. The design structure matrix (DSM), a scheduling tool that has previously been optimized via the application of evolutionary algorithms, has been used as a practical implementation of differential adaptation to investigate its effectiveness in solving real world problems. Solutions provided by Todd, D. (Multiple criteria genetic algorithms in engineering design and operation, PhD thesis, Department of Marine Technology, University of Newcastle, 1997), are used to benchmark the algorithm's effectiveness. [ABSTRACT FROM AUTHOR]

Network function virtualization can increase the versatility of computing and network platforms, enabling them to provide more flexible services. In terms of a softwaredefined network and network function virtualization environment, this paper explores the joint virtual network function (VNF) deployment and traffic routing in multisource multicast for VNF service chain deployment to minimize the deployment overhead, transmission delay. Firstly, a multi-objective optimization model, which minimizes the deployment overhead and transmission delay, is established to tackle this challenge problem. Then, a highly efficient coding scheme, crossover, and mutation operators are designed. Based on these, an improved genetic algorithm in multi-objective evolutionary algorithm based on decomposition (MOEA/D) framework (GA-MOEA/D) is proposed to solve this multi-objective problem. Finally, simulation experiments are conducted using two widely used network topologies in order to demonstrate the performance of the proposed algorithm. The simulation results demonstrate that the proposed algorithm can obtain the smaller deployment overhead, transmission delay, load degree and energy consumption 5.2%-15.61%, 11.2%-26.4%, 8.3%-17.6% and 7.8%-14.4% than that of the compared algorithm, respectively. [ABSTRACT FROM AUTHOR]

Purpose: This paper aims at making a comparison of three optimization algorithms – standard Genetic Algorithm and its two modifications: Extended Compact Genetic Algorithm and Population-based Incremental Learning. Design/methodology/approach: To reach the objectives of the paper the solver based on algorithms was developed. Certain test functions were applied to test them and evaluate their performance. Findings: Modifications of Genetic Algorithm reach optimal values faster and more precisely. Research limitations/implications: Problem of optimization of certain cost functions frequently occurs in many management problems of organizing the optimal workflow in organizations. It can be used also in engineering problems of designing optimal devices at lowest possible cost. Practical implications: One can optimize function faster using discussed algorithms than by using standard evolutionary algorithm. Originality/value: The paper shows results of comparisons of three algorithms, discusses how tuning meta parameters helps to increase their efficiency and accuracy. [ABSTRACT FROM AUTHOR]

Fault diagnosis of interconnection networks is vital to ensuring the reliability and maintenance of multiprocessor systems. Based on graph theory, diagnostic algorithms for solving the problem of fault diagnosis in interconnection networks have been widely studied. As the number of processors in multiprocessor systems has increased in recent years, fault diagnosis algorithms based on graph theory cannot meet the current diagnosis requirements of some interconnection networks, such as t-diagnosable systems. In this paper, we use the evolution diagnosis approach to study fault diagnosis in t-diagnosable systems under the PMC model. First, for a t-diagnosable system G with a syndrome σ , we use a simple centralized algorithm to generate its simplified diagnosis graph G f , which contains all the faulty nodes in G. Based on the graph, we prove that the faulty node set in G is the minimum cover set of G f . Next, we prove that the problem of computing the minimum cover set for G f is equivalent to the problem of computing the optimal solution of a zero-one integer program. Using this result, we propose a novel genetic algorithm to solve the problem of the zero-one integer program. The simulation results show that the diagnostic accuracy of our proposed algorithm is equal to or greater than 96% and that the proposed algorithm outperforms its competitors in terms of diagnostic accuracy, number of iterations and running time. [ABSTRACT FROM AUTHOR]

Most genetic operators use random mating selection strategy and fixed rate crossover operator to solve various optimization problems. In order to improve the convergence and diversity of the algorithm, an adaptive adjacent maximum distance crossover operator is proposed in this paper. A new mating selection strategy (distance-based mating selection strategy) and an adaptive mechanism (adaptive crossover strategy based on population convergence) are adopted. Distance-based mating selection strategy purposefully selects parents to produce better offspring. Adaptive crossover strategy based on population convergence increases the convergence speed of the algorithm by controlling the crossover probability. The proposed crossover strategy is evaluated on the simulated binary crossover operators of non-dominated sorting genetic algorithm II and multi-objective evolutionary algorithm based on decomposition. The performance of the algorithm is verified on a series of standard test problems. Finally, the optimization results of the improved algorithm using adaptive adjacent maximum distance crossover operator and the standard algorithm are compared and analyzed. The experimental results show that the algorithm using adaptive adjacent maximum distance crossover operator has better optimization results. [ABSTRACT FROM AUTHOR]

This paper aims to design a reliable filter that can transform the actual motion of a flight simulator maneuver into a logical and understandable movement for its workspace. Motion cueing algorithms are used in scaling maneuvers to improve the user's perception of real-world motion. As a unique algorithm, the washout-filter algorithm reduces the real motions where the user cannot understand the difference between the actual and simulated maneuvers. To design a proper washout filter, first, apply the inner ear model where humans can feel the motion to design a proper filter. The Otolith and semicircular systems were represented by two parts in this model. Second, an evolutionary theory based on a genetic algorithm is used to design a structure that minimizes human perception error and workspace boundaries. The issue is determining the coefficients in the model in order to create a high-performance flight simulator. The filtering algorithm, based upon the human vestibular model, compares human perception with flight simulator motion knowledge. The findings demonstrate an objective function that minimizes user perception error, and the flight simulator motion range can prepare a reliable washout filter for motion cueing. [ABSTRACT FROM AUTHOR]

With the development of neural network technology and the rapid growth of China's tourism economic income at this stage, the research on the comprehensive evaluation of tourism resources has gradually emerged. Based on this, this paper studies the neural network comprehensive evaluation model based on multispecies evolutionary genetic algorithm and designs the neural network analysis system of influencing factors of tourism resources based on multispecies evolutionary genetic algorithm. The collection and acquisition of data information are realized from the aspects of resource income status, tourism development investment, and sustainability evaluation in the tourism area. The multispecies evolutionary genetic algorithm is used for comprehensive analysis and evaluation. The algorithm can realize the complex analysis and comprehensive evaluation of the core influencing factors of neural network. Accurate analysis and evaluation were carried out according to the different characteristics of tourism resources and the current situation of tourism income. The results show that the neural network comprehensive evaluation model based on multispecies evolutionary genetic algorithm has the advantages of high practicability, good sorting effect of variable ratio, and good data integration. It can effectively analyze and compare the comprehensive evaluation factors affecting tourism resources in different ratios. [ABSTRACT FROM AUTHOR]

In a preference-based multi-objective optimization task, the goal is to find a subset of the Pareto-optimal set close to a supplied set of aspiration points. The reference point based non-dominated sorting genetic algorithm (R-NSGA-II) was proposed for such problem-solving tasks. R-NSGA-II aims to finding Pareto-optimal points close, in the sense of Euclidean distance in the objective space, to the supplied aspiration points, instead of finding the entire Pareto-optimal set. In this paper, R-NSGA-II method is modified using recently proposed Karush–Kuhn–Tucker proximity measure (KKTPM) and achievement scalarization function (ASF) metrics, instead of Euclidean distance metric. While a distance measure may not produce desired solutions, KKTPM-based distance measure allows a theoretically-convergent local or global Pareto solutions satisfying KKT optimality conditions and the ASF measure allows Pareto-compliant solutions to be found. A new technique for calculating KKTPM measure of a solution in the presence of an aspiration point is developed in this paper. The proposed modified R-NSGA-II methods are able to solve as many as 10-objective problems as effectively or better than the existing R-NSGA-II algorithm. [ABSTRACT FROM AUTHOR]

As a new model of networked manufacturing services, cloud manufacturing (CMfg) aims to allocate enterprise manufacturing resources, realize rational utilization of manufacturing resources, and adapt to increasingly complex user needs. However, previous studies on service composition and optimal selection (SCOS) in CMfg environments do not incorporate carbon emissions into the quality of service (QoS) evaluation indicators. Therefore, a SCOS model for CMfg under a low-carbon environment is firstly proposed in this paper. Secondly, based on the Non-dominated Sorting Genetic Algorithm (NSGA-II) algorithm, a hybrid multi-objective evolutionary algorithm, named the NSGA-II-SA algorithm, is proposed to solve the model and obtain the Pareto optimal solution set. Then, an algorithm result optimization strategy combining subjective and objective is proposed to filter the Pareto optimal solution set, so as to make the final decision. Finally, taking natural gas cylinder head production as an example, the proposed algorithm is compared with other algorithms, and the results show that the proposed algorithm can obtain more non-dominated solutions, and the quality of the solutions in the four dimensions is better than the other. Therefore, it is proved that the proposed algorithm has better comprehensive performance in SCOS under a low-carbon environment. [ABSTRACT FROM AUTHOR]

Convergence and diversity are interdependently handled during the evolutionary process by most existing many-objective evolutionary algorithms (MaOEAs). In such a design, the degraded performance of one would deteriorate the other, and only solutions with both are able to improve the performance of MaOEAs. Unfortunately, it is not easy to constantly maintain a population of solutions with both convergence and diversity. In this paper, an MaOEA based on two independent stages is proposed for effectively solving many-objective optimization problems (MaOPs), where the convergence and diversity are addressed in two independent and sequential stages. To achieve this, we first propose a nondominated dynamic weight aggregation method by using a genetic algorithm, which is capable of finding the Pareto-optimal solutions for MaOPs with concave, convex, linear and even mixed Pareto front shapes, and then these solutions are employed to learn the Pareto-optimal subspace for the convergence. Afterward, the diversity is addressed by solving a set of single-objective optimization problems with reference lines within the learned Pareto-optimal subspace. To evaluate the performance of the proposed algorithm, a series of experiments are conducted against six state-of-the-art MaOEAs on benchmark test problems. The results show the significantly improved performance of the proposed algorithm over the peer competitors. In addition, the proposed algorithm can focus directly on a chosen part of the objective space if the preference area is known beforehand. Furthermore, the proposed algorithm can also be used to effectively find the nadir points. [ABSTRACT FROM AUTHOR]

As most of Multi-Objective Evolutionary Algorithms (MOEAs) scale quite poorly when the number of objective functions increases, new strategies have been proposed to face this limitation. Considered one of the most well-succeeded examples of such new strategies, the third version of Non-dominated Sorting Genetic Algorithm (NSGA-III) uses a set of reference points placed on a normalized hyperplane to solve Many Objective Optimization Problems (MaOPs). Despite the good results of NSGA-III, the shape of the hypersurface can influence the algorithm's performance and it has not been deeply explored in the recent literature. This work aims therefore at proposing a new hybrid algorithm and investigating nonlinear transformations applied to the NSGA-III hyperplane. We categorize our proposed approach as a hybrid MOEA (Indicator- and Pareto-based), and analyze the influence of the modified set of reference points on the proposed algorithm while solving MaOPs. The paper presents as its main contributions: (i) the proposal of a greedy indicator-based variant of NSGA-III that uses math transformations on a subset of chosen reference points; (ii) the use of Vector Guided Adaptation procedure to modify original NSGA-III hyperplane at every few iterations. A set of experiments addressing several benchmark problems is performed to evaluate the performance of the original and adapted NSGA-III versions, and also to compare them with two well known MOEAs, observing both, convergence and diversity of the final Pareto fronts. Based on the analysis of statistical tests, we conclude that the proposed approach is competitive and can provide an interesting alternative to the original NSGA-III conception. [ABSTRACT FROM AUTHOR]

The objective of a fixed-cost transportation problem (FCTP) is to minimize the total transportation cost (or to maximize the total profit). FCTPs become more complex due to the presence of uncertain factors like suppliers' capacity, customers' demand, fixed cost and amount of goods transported. In order to deal with its complexity, three mathematical models, namely the expected value, chance-constrained and measure chance models, are basically available in the literature. This paper aims to solve the crisp equivalent models of an uncertain two-echelon FCTP by employing a robust hybrid evolutionary algorithm. The framework of the designed algorithm comprises of parameter-free Jaya algorithm and the efficient quadratic approximation operator. Initially, its efficiency is validated on the 24 constrained benchmark functions from CEC 2006 (Liang et al. in Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization, 2006) and 30 unconstrained benchmark functions (Rao in Int J Ind Eng Comput 7:19–34, 2016). Friedman rank test and Iman–Davenport test are conducted for both constrained and unconstrained test instances. Additionally, five real-life engineering design problems are solved to further analyze the flexibility of the proposed algorithm. The computational results and convergence graphs justify the robustness of the designed algorithm over state-of-the-art algorithms. Finally, its application is demonstrated on chance-constrained and measure chance two-echelon FCTP models. Near-optimal results are contradicted by genetic algorithm and particle swarm optimization in solving both these models. Further, a few large-scale instances of FCTP are solved by the proposed algorithm. [ABSTRACT FROM AUTHOR]

In order to meet the edge services placement demand for multiobjective optimization of Power Internet of Things, an edge services placement strategy based on an improved strength Pareto evolutionary algorithm (SPEA2) is proposed in this paper. Firstly, we model the delay, resource utilization, and energy consumption. Then, a multiobjective optimization is proposed. Finally, an enhanced genetic algorithm is used to derive the decision candidate set. Moreover, the optimal solution in the candidate set is selected to be utilized in the iteration of the multicriteria decision and the superior-inferior solution distance method. Numerical results and analysis show that the proposed strategy is more effective in reducing system delay, improving resource utilization, and saving energy consumption than the other two benchmark algorithms. [ABSTRACT FROM AUTHOR]

Evolutionary algorithms are generally a suitable approach for optimization problems, having more than one conflicting objectives. For many complicated engineering optimization problems, multi-objective formulations are treated as realistic models. The paper presents and implements a Pareto-optimal image encryption algorithm that uses coupled map lattice (CML) chaos function and deoxyribonucleic acid (DNA) combination to encrypt an image. The discussed work uses multi-objective genetic algorithm (MOGA) to get the optimized results. The proposed two-step algorithm uses pseudo-random number generators, the chaotic method CML and DNA to create an initial population of DNA masks in its initial stage. The MOGA is applied in the second stage to obtain the best mask for encrypting the given plain image. The focus is on the generation of Pareto fronts by using the Pareto generation method of multi-objective optimization. The paper evaluates the performance of the implemented work using standard metrics like key sensitivity, secret key space, number of pixel change rate, unified average changed intensity, entropy, histogram and correlation coefficient. It also discusses the impact of using a genetic algorithm that uses more than one fitness function as the objective for encrypting images. [ABSTRACT FROM AUTHOR]

In this data-driven era, where a large number of attributes are often publicly available, redundancy becomes a major problem, which leads to large storage and computational resource requirement. Feature selection is a method for reducing the dimensionality of the data by removing such redundant or misleading attributes. This leads to a selection of optimal feature subsets that can be used for further computation like the classification of data. Learning algorithms, when fitted on such optimal subsets of reduced dimensions, perform more efficiently and storing data also becomes easier. However, there exists a trade-off between the number of features selected and the accuracy obtained and the requirement for different tasks may vary. Thus, in this paper, a hybrid filter multi-objective evolutionary algorithm (HFMOEA) has been proposed based on the nondominated sorting genetic algorithm (NSGA-II) coupled with filter-based feature ranking methods for population initialization to obtain an optimal trade-off solution set to the problem. The two competing objectives for the algorithm are the minimization of the number of selected features and the maximization of the classification accuracy. The filter ranking methods used for population initialization help in faster convergence of the NSGA-II algorithm to the PF. The proposed HFMOEA method has been evaluated on 18 UCI datasets and 2 deep feature sets (features extracted from image datasets using deep learning models) to justify the viability of the approach with respect to the state-of-the-art. [ABSTRACT FROM AUTHOR]

This paper reports the use of many-objective optimization for water distribution system (WDS) design or rehabilitation problems. The term many-objective optimization refers to optimization with four or more objectives. The increase in the number of objectives brings new challenges for both optimization and visualization. This study uses a multiobjective evolutionary algorithm termed the epsilon Nondominated Sorted Genetic Algorithm II (-NSGAII) and interactive visual analytics to reveal and explore the tradeoffs for the Anytown network problem. The many-objective formulation focuses on a suite of six objectives, as follows: (1) capital cost, (2) operating cost, (3) hydraulic failure, (4) leakage, (5) water age, and (6) fire-fighting capacity. These six objectives are optimized based on decisions related to pipe sizing, tank siting, tank sizing, and pump scheduling under five different loading conditions. Solving the many-objective formulation reveals complex tradeoffs that would not be revealed in a lower-dimensional optimization problem. Visual analytics are used to explore these complex tradeoffs and identify solutions that simultaneously improve the overall WDS performance but with reduced capital and operating costs. This paper demonstrates that a many-objective visual analytics approach has clear advantages and benefits in supporting more informed, transparent decision-making in the WDS design process. [ABSTRACT FROM AUTHOR]

Analog CMOS integrated circuits (ICs) designs depend typically on designer knowledge and experience, as such problems are multivariate and multiobjective, presenting many combinations of input variables to be investigated in order to meet the required specifications. Nowadays, the a posteriori approach is widely used to perform the optimization processes of analog CMOS ICs using evolutionary algorithms. However, these techniques are not totally able to explore potential solutions in specific regions of the Pareto front. Designers then have difficulty in choosing the best solution capable of achieving all desired specifications simultaneously among all the ones found. In this context, the a priori approach using fitness functions has become an important alternative method to overcome these issues of the a posteriori methodology. This paper aims to compare different fitness function profiles used in the a priori optimization processes to boost the effectiveness of the search processes in relation to robustness, accuracy, and yield in analog CMOS ICs designs. We show that the Gaussian profile, proposed here, applied to the lower limit, center value, and upper limit fitness functions is able to improve all the a priori optimization evolutionary techniques investigated, including the genetic, imperialist competitive, and shuffled frog leaping algorithms. [ABSTRACT FROM PUBLISHER]

It is our pleasure to introduce this special issue on the recent advances in the theoretical foundations of evolutionary computation (EC). While in the early days of this field, theoretical analyses inevitably focused on simplified models of evolutionary algorithms (EAs), the continuous progress made in the development of suitable mathematical techniques for the analysis now allows to derive proven statements regarding the performance of off-the-shelf metaheuristics, such as standard generational and steady-state genetic algorithms with no algorithmic simplifications. Comparisons between the performance of a given EA with the best possible one can also be made nowadays, allowing to assess whether a given algorithm may be improved upon or whether its performance is optimal for a given class of problems. Such understanding often provides insights for the design of new EAs which provably have better performance for given problems. We are glad that examples of results of this kind are present within this special issue. A total of 27 papers were submitted which were the subject of at least three independent reviews, and six manuscripts of the highest quality were selected for publication in the special issue. In the following, we provide a brief summary of these manuscripts. [ABSTRACT FROM AUTHOR]

The multi-locomotion robot (MLR), including bionic insect microrobot, bionic animal robot and so on, should choose different locomotion modes according to the obstacles it faces. However, under different locomotion modes, the power consumption, moving speed, and falling risk of MLR are different, and in most cases, they are mutually exclusive. This paper proposes a path planning algorithm for MLR based on a multi-objective genetic algorithm with elitist strategy (MLRMOEGA), which has four optimization objectives: power consumption, time consumption, path falling risk, and path smoothness. We propose two operators: a map analysis operator and a population diversity expansion operator, to improve the global search ability of the algorithm and solve the problem so that it is easy to fall into the local optimal solution. We conduct simulations on MATLAB, and the results show that the proposed algorithm can effectively optimize the objective function value compared with the traditional genetic algorithm under the equal weight of the four optimization objectives, and, under alternative weights, the proposed algorithm can effectively generate the corresponding path of the decision maker's intention under the weight of preference. Compared with the traditional genetic algorithm, the global search ability is improved effectively. [ABSTRACT FROM AUTHOR]

Recent studies show that the performance of Evolutionary Algorithms often depends on choosing appropriate parameter configurations. Thus, researchers have generally tuned these parameters either looking at the similar research areas in the literature or manually, e.g. Grid Search. However, searching the parameter manually is laborious and timeconsuming; therefore, meta-optimization techniques have become commonly used methods to adjust parameters of an algorithm. These techniques can be classified in two widespread manners: off-line, tuning parameters of an algorithm before the algorithm initiates, and on-line, tuning the parameters while it is working. In this paper, Bipolar Matching Tendency (BMT) algorithm has been chosen as the selection method of a Genetic Algorithm (GA). The new obtained algorithm is named GA-BMT and has been used for the first time as an online metaoptimizer. In addition, the paper utilizes two search algorithms (Grid Search, Coarse to Fine Search) with three meta-optimization methods (Standard GA, Particle Swarm Optimization, GA-BMT) to investigate the best parameter settings of the Standard GA for 17 test functions, and offers a comparative work by comparing their results. Furthermore, non-parametric statistical tests, Friedman and Wilcoxon Signed Rank, were performed to demonstrate the significance of the results. Based on the all results that achieved, GA-BMT presents a reasonable achievement. [ABSTRACT FROM AUTHOR]

The first cooperative co-evolutionary algorithm (CCEA) was proposed by Potter and De Jong in 1994 and since then many CCEAs have been proposed and successfully applied to solving various complex optimization problems. In applying CCEAs, the complex optimization problem is decomposed into multiple subproblems, and each subproblem is solved with a separate subpopulation, evolved by an individual evolutionary algorithm (EA). Through cooperative co-evolution of multiple EA subpopulations, a complete problem solution is acquired by assembling the representative members from each subpopulation. The underlying divide-and-conquer and collaboration mechanisms enable CCEAs to tackle complex optimization problems efficiently, and hence CCEAs have been attracting wide attention in the EA community. This paper presents a comprehensive survey of these CCEAs, covering problem decomposition, collaborator selection, individual fitness evaluation, subproblem resource allocation, implementations, benchmark test problems, control parameters, theoretical analyses, and applications. The unsolved challenges and potential directions for their solutions are discussed. [ABSTRACT FROM AUTHOR]

In most real-world settings, designs are often gradually adapted and improved over time. Consequently, there exists knowledge from distinct (but possibly related) design exercises, which have either been previously completed or are currently in-progress, that may be leveraged to enhance the optimization performance of a particular target optimization task of interest. Further, it is observed that modern day design cycles are typically distributed in nature, and consist of multiple teams working on associated ideas in tandem. In such environments, vast amounts of related information can become available at various stages of the search process corresponding to some ongoing target optimization exercise. Successfully exploiting this knowledge is expected to be of significant value in many practical settings, where solving an optimization problem from scratch may be exorbitantly costly or time consuming. Accordingly, in this paper, we propose an adaptive knowledge reuse framework for surrogate-assisted multiobjective optimization of computationally expensive problems, based on the novel idea of multiproblem surrogates. This idea provides the capability to acquire and spontaneously transfer learned models across problems, facilitating efficient global optimization. The efficacy of our proposition is demonstrated on a series of synthetic benchmark functions, as well as two practical case studies. [ABSTRACT FROM AUTHOR]

With the rapid economic development, consumers' demand for diversified products has become increasingly prominent. It's of great significance for the manufacturing enterprises to make effective flow shop scheduling (FSS) in saving costs and enhancing competitiveness. Based on the flexible job shop environment, this paper proposes a coevolutionary algorithm based on genetic algorithm (GA) and simulated annealing (SA) algorithm to solve the problems in the simulation of production environment. The research results show that the co-evolution algorithm is superior to the traditional algorithm, especially for the complex problem, it has a very strong competitiveness. This research has certain practical significance for fuzzy flexible flow shop scheduling problem. [ABSTRACT FROM AUTHOR]

3D point cloud registration is a key technology in 3D point cloud processing, such as 3D reconstruction, object detection. Trimmed Iterative Closest Point algorithm is a prevalent method for registration of two partially overlapping clouds. However, it relies heavily on the initial value and is liable to be trapped in to local optimum. In this paper, we adapt the Differential Evolution algorithm to obtain global optimal solution. By design appropriate evolutionary operations, the algorithm can make the populations distributed more widely, and keep the individuals from concentrating to a local optimum. In the experiment, the proposed algorithm is compared with existing methods which are based on global optimization algorithm such as Genetic Algorithm and particle filters. And the results have demonstrated that the proposed algorithm is more robust and can converge to a good result in fewer generations. [ABSTRACT FROM AUTHOR]

Coordination is essential for improving supply chain performance, and one of the most critical factors in achieving the coordination of a supply chain is the integrated research of production and distribution. In this paper, a novel two-stage hybrid solution methodology is proposed. In the first stage, products are processed on the serial machines of multiple manufacturers located in two industrial parks. A fuzzy multi-objective scheduling optimization is performed using a modified non-dominated sorting genetic algorithm II (NSGA-II). The result obtained in the first stage is used in the second stage to optimize the distribution scheduling problem using a modified genetic annealing algorithm (GAA). Finally, simulation results verify both the feasibility and efficiency of the proposed solution methodology. [ABSTRACT FROM AUTHOR]

Evolutionary algorithms (EAs) in the repository of the evolutionary computing (EC) paradigm are simplistic and stochastic in nature. The desirable characteristic of adaptive simplicity has sustained research community's rampant curiosity in EAs. Distributed evolutionary algorithmic (DEA) framework is an instinctive extension of EAs. This paper summarizes the design and implementation of a multi-threaded DEA (MTDEA) framework. Empirical analysis between a traditional DEA framework and a simulated MTDEA is presented. The MTDEA framework was outfitted with three plug-in algorithms to handle commonly occurring faults in distributed environments. The propriety of the MTDEA framework was validated in two customary applications - Image thresholding and Image reproduction. The thresholding and reproduction problems were addressed by incorporation of the differential evolution (DE) and genetic algorithm (GA) methods respectively, into the MTDEA framework. The performances of DE and GA routines were compared with their sequential counterpart frameworks. The MTDEA framework was evaluated for reliability and scalability on a high-performance computing (HPC) system. [ABSTRACT FROM AUTHOR]

As exact algorithms are unfeasible to solve real optimization problems, due to their computational complexity, meta-heuristics are usually used to solve them. However, choosing a meta-heuristic to solve a particular optimization problem is a non-trivial task, and often requires a time-consuming trial and error process. Hyper-heuristics, which are heuristics to choose heuristics, have been proposed as a means to both simplify and improve algorithm selection or configuration for optimization problems. This paper novel presents a novel cross-domain evaluation for multi-objective optimization: we investigate how four state-of-the-art online hyper-heuristics with different characteristics perform in order to find solutions for eighteen real-world multi-objective optimization problems. These hyper-heuristics were designed in previous studies and tackle the algorithm selection problem from different perspectives: Election-Based, based on Reinforcement Learning and based on a mathematical function. All studied hyper-heuristics control a set of five Multi-Objective Evolutionary Algorithms (MOEAs) as Low-Level (meta-)Heuristics (LLHs) while finding solutions for the optimization problem. To our knowledge, this work is the first to deal conjointly with the following issues: (i) selection of meta-heuristics instead of simple operators (ii) focus on multi-objective optimization problems, (iii) experiments on real world problems and not just function benchmarks. In our experiments, we computed, for each algorithm execution, Hypervolume and IGD+ and compared the results considering the Kruskal–Wallis statistical test. Furthermore, we ranked all the tested algorithms considering three different Friedman Rankings to summarize the cross-domain analysis. Our results showed that hyper-heuristics have a better cross-domain performance than single meta-heuristics, which makes them excellent candidates for solving new multi-objective optimization problems. [ABSTRACT FROM AUTHOR]

As typical evolutionary algorithms, Artificial immune lgorithm, Genetic algorithm and Bee Colony algorithm have their own advantages. This paper introduced the basic knowledge of evolutionary algorithms, and detailed respectively descriped the characteristics of three algorithms, including how to be proposed, features and algorithm steps. Then in this paper, meta task scheduling and intelligent optimization algorithms in grid resource scheduling were as test method, under different parameters conditions analyzed and compared the performance of three algorithms. At last the comparison result was given. [ABSTRACT FROM AUTHOR]

The problem that passengers are hard to take taxis while empty driving rate is high widely exists under the traditional taxi operation mode. The implementation of taxi carpooling mode can alleviate the problem in a certain extent. The objective of this study is to optimize the taxi carpooling path. Firstly, the taxi carpooling path optimization model with single objective and its extended model with multiple objectives are built respectively. Then, the single objective path optimization model of taxi carpooling is solved based on the improved single objective genetic algorithm, and the multiple-objective path optimization model of taxi carpooling is solved based on the improved multiple-objective genetic algorithm. Finally, a case study is carried out based on a road network with 24 nodes. The case study results show the path optimization models and algorithms of taxi carpooling proposed in the paper can quickly get the taxi carpooling path, and can increase the income of taxi driver while reduce the cost for passengers. [ABSTRACT FROM AUTHOR]

Inherent part of evolutionary algorithms that are based on Darwin’s theory of evolution and Mendel’s theory of genetic heritage, are random processes since genetic algorithms and evolutionary strategies are used. In this paper, we present extended experiments (of our previous) of selected evolutionary algorithms and test functions showing whether random processes really are needed in evolutionary algorithms. In our experiments we used differential evolution and SOMA algorithms with functions 2ndDeJong, Ackley, Griewangk, Rastrigin, SineWave and StretchedSineWave. We use n periodical deterministic processes (based on deterministic chaos principles) instead of pseudo-random number generators (PRGNs) and compare performance of evolutionary algorithms powered by those processes and by PRGNs. Results presented here are numerical demonstrations rather than mathematical proofs. We propose the hypothesis that a certain class of deterministic processes can be used instead of PRGNs without lowering the performance of evolutionary algorithms. [ABSTRACT FROM AUTHOR]

Designing an efficient association rule mining (ARM) algorithm for multilevel knowledge-based transactional databases that is appropriate for real-world deployments is of paramount concern. However, dynamic decision making that needs to modify the threshold either to minimize or maximize the output knowledge certainly necessitates the extant state-of-the-art algorithms to rescan the entire database. Subsequently, the process incurs heavy computation cost and is not feasible for real-time applications. The paper addresses efficiently the problem of threshold dynamic updation for a given purpose. The paper contributes by presenting a novel ARM approach that creates an intermediate itemset and applies a threshold to extract categorical frequent itemsets with diverse threshold values. Thus, improving the overall efficiency as we no longer needs to scan the whole database. After the entire itemset is built, we are able to obtain real support without the need of rebuilding the itemset (e.g. Itemset list is intersected to obtain the actual support). Moreover, the algorithm supports to extract many frequent itemsets according to a pre-determined minimum support with an independent purpose. Additionally, the experimental results of our proposed approach demonstrate the capability to be deployed in any mining system in a fully parallel mode; consequently, increasing the efficiency of the real-time association rules discovery process. The proposed approach outperforms the extant state-of-the-art and shows promising results that reduce computation cost, increase accuracy, and produce all possible itemsets. [ABSTRACT FROM AUTHOR]

• A model was created to examine the reliability of maintenance budget allocation. • The model was applied to network-level pavement maintenance in Canada. • The impacts of algorithm selection and parameter tuning were studied. • The significance of pavement clustering in increasing reliability was highlighted. • The importance of incorporating actual pavement improvement curves was clarified. The purpose of this paper is to increase the reliability of the network-level pavement maintenance budget allocation by reducing uncertainties of algorithm selection and parameter tuning. In this paper, reliability is defined as the ability of a network-level pavement maintenance plan to improve the condition of a pavement network within a certain budget. In order to quantify reliability, the reliability index is defined as the ratio between the post-maintenance network condition and the net maintenance cost. With this purpose in mind, a two-objective optimization model was developed. To test its applicability, the model was applied to a pavement network in Canada. The model was solved using the Non-Dominated Sorting Genetic Algorithm II and the differential evolution algorithms. Finally, the reliability indices of algorithms and termination criteria were computed. The results indicated that the differential evolution algorithm recommended less frequent but more intense interventions that made the solutions expensive and less reliable. This paper contributed to the network-level pavement maintenance body of knowledge by (1) developing a multi-objective optimization model to reduce uncertainties of parameter tuning and algorithm selection; (2) increasing the reliability of budget allocation; (3) showcasing the significance of pavement clustering in increasing reliability; and (4) developing and incorporating actual pavement improvement curves. [Display omitted] [ABSTRACT FROM AUTHOR]

Intelligent machines are an important carrier of artificial intelligence, which are widely used not only in the industrial field, but also in various fields of daily life and work. Path planning is an important research direction for studying machine intelligence. The main purpose is to search for a feasible path so that the robot can walk along the searched path in a complex environment. This paper aims to study the evolutionary algorithm of intelligent machines based on artificial intelligence. On the basis of introducing the characteristics of artificial potential field algorithm, the concept and characteristics of genetic algorithm, using genetic algorithm as the framework, the artificial potential field algorithm is combined with the crossover of genetic algorithm. In the operator, the optimization performance of the crossover operator is improved. The research results show that the length of the path obtained by the improved algorithm is shorter and better than that of the genetic algorithm of the single-point crossover operator. [ABSTRACT FROM AUTHOR]

Electric vehicle production is subjected to high manufacturing cost and environmental impact. Disassembling and remanufacturing the lithium-ion power packs can highly promote electric vehicle market penetration by procuring and regrouping reusable modules as stationary energy storage devices and cut life-cycle cost and environmental impact. Disassembly efficiency is crucial for battery remanufacturing companies in reverse supply chains. However, disassembly planning suffers from high computational complexity and inferior solutions. This paper developed a multi-objective mathematical model and presented a novel hybrid genetic-firework algorithm based on the precedence graph for obtaining solutions to disassemble the electric vehicle power pack into module levels in an efficient manner. The objectives for the model include not only smoothness of working stations, cycle time, and economic returns, but also consider operation safety and energy consumption. The proposed hybrid algorithm explored the performance of the novel solution searching mechanism of combining the firework and genetic algorithms. The proposed approach is compared with the commonly used multi-objective evolutionary algorithms in the literature, showing its feasibility and effectiveness. [ABSTRACT FROM AUTHOR]

This paper addresses Very large‐scale integration (VLSI) placement optimization, which is important because of the rapid development of VLSI design technologies. The goal of this study is to develop a hybrid algorithm for VLSI placement. The proposed algorithm includes a sequential combination of a genetic algorithm and an evolutionary algorithm. It is commonly known that local search algorithms, such as random forest, hill climbing, and variable neighborhoods, can be effectively applied to NP‐hard problem‐solving. They provide improved solutions, which are obtained after a global search. The scientific novelty of this research is based on the development of systems, principles, and methods for creating a hybrid (combined) placement algorithm. The principal difference in the proposed algorithm is that it obtains a set of alternative solutions in parallel and then selects the best one. Nonstandard genetic operators, based on problem knowledge, are used in the proposed algorithm. An investigational study shows an objective‐function improvement of 13%. The time complexity of the hybrid placement algorithm is O(N2). [ABSTRACT FROM AUTHOR]

In multi-objective evolutionary algorithms (MOEAs), non-domina-ted sorting is one of the critical steps to locate efficient solutions. A large percentage of computational cost of MOEAs is on non-dominated sorting for it involves numerous comparisons. By now, there are more than ten different non-dominated sorting algorithms, but their numerical performance comparing with each other is not clear yet. It is necessary to investigate the advantage and disadvantage of these algorithms and consequently give suggestions to specific users and algorithm designers. Therefore, a comprehensively numerical study of non-dominated sorting algorithms is presented in this paper. Firstly, we design a population generator. This generator can generate populations with specific features, such as population size, number of Pareto fronts and number of points in each Pareto front. Then non-dominated sorting algorithms were tested using populations generated in certain structures, and results were compared with respect to number of comparisons and time consumption. Furthermore, In order to compare the performance of sorting algorithms in MOEAs, we embed them into a specific MOEA, dynamic sorting genetic algorithm (DSGA), and use these variations of DSGA to solve some multi-objective benchmarks. Results show that dominance degree sorting outperforms the other methods, fast non-dominance sorting performs the worst and the other sorting algorithms performs equally. [ABSTRACT FROM AUTHOR]

With day to day exponential increase in the number of vehicles, it is essential to communicate travel information for road travellers to enhance their travelling experience. One of the recent technologies that aid in real time and faster communication of information is Vehicular Ad-hoc Network (VANET). To ensure significant connectivity and continuous data flow, Road Side Units (RSU) are installed in VANET. RSUs receive the traffic information from vehicles and communicate it to other RSUs, Traffic Management Centre (TMC) or other adjacent vehicles. However, identifying the appropriate locations to deploy RSUs to maintain network connectivity and reduce cost of installation in a given area are still challenging and cannot be decided based on a single parameter. This paper proposes an Optimal RSU Distribution Planner (ORDP) using a Fusion Algorithm (FA) comprising of Evolutionary Genetic Algorithm (EGA) and D-Trimming. Further it also provides the feasibility to choose the appropriate parameter configuration based on user requirement which makes the model feasible and efficient. The scalability and efficiency of the planner are tested against simulated and realistic datasets and it is seen that ORDP has proved to deliver improved results compared with other greedy approaches. [ABSTRACT FROM AUTHOR]

In this paper we have defined a hybrid approach to divide the network in clusters. The presented research work will cover the a localization and coverage based Fuzzy-CMeans clustering algorithm to divide the whole network in smaller clusters. The main objective of the work is to defined a hybrid genetic based approach to optimize the clustering process under the geometric as well as the energy parameters. The objective of the work to analyze the network under the ratio of no of nodes per cluster. The result analysis will be performed using graphs. parameters. In this worm, a hybrid model is presented to perform the cluster head selection. This hybrid model is defined under two stages. In first stage, the fuzzy c means clustering is applied to divide the network in fixed number of clusters. Once the clusters are decided, the next work is to select the cluster head for each cluster. To perform the cluster head selection, genetic algorithm is suggested in this work. The presented approach is about to increase the network life and the network communication over the network. The presented work is about to use the genetics with sensor network effectively so that effective clustering will be performed and network life will be increased [ABSTRACT FROM AUTHOR]

Multicropping is the practice of growing two or more crops in the same space during a single growing season. Planning rules are mathematical equations that use previous experiences of a water resource system to balance the system's water supply and demand, and calculate multicrop areas in various periods. In this paper, linear and nonlinear planning rules are developed for optimal multicrop irrigation areas associated with reservoir operation policies in a reservoir-irrigation system. Reservoir operations are related to water allocations to each irrigated area by considering inflow and storage volume of the reservoir as the water supply in a monthly operation period. Evolutionary algorithms (EAs) can determine optimal multicropping patterns planning rules by considering various mathematical patterns. In this paper, three EAs, namely, (1) genetic algorithm (GA), (2) particle swarm optimization (PSO), and (3) shuffled frog leaping algorithm (SFLA) are employed and compared to maximize the total net benefit of the water resource system by supplying irrigation water for a proposed multicropping pattern over the planning horizon. Results show that the SFLA achieves the best solution, with the maximum value of the objective function in both linear and nonlinear planning rules compared to the GA and PSO. Moreover, the best yield of nonlinear rules is 45.52% better (higher) than that obtained by linear rules. [ABSTRACT FROM AUTHOR]

In this paper, we formulate and solve an Imprecise Covering Ring Star Problem (ICRSP), a generalization of the Ring Star Problem (RSP). For a given network, the objective of this problem is to find a subset of nodes that forms a cycle, and other nodes are left-out nodes. This problem minimizes the total routing cost due to the cycle itself and assignment costs from the left-out nodes assigned to their nearest concentrators (i.e., nodes on the cycle). No assigned node exceeds a predetermined covering distance from its concentrator. The covering distance and the routing and assignment costs are considered fuzzy in the proposed ICRSP. A Modified Genetic Algorithm (MGA) has been developed and used to solve this model for different confidence levels depending on the corresponding imprecise parameters, reducing it to a deterministic form with fuzzy possibility and necessity approaches. Some comparisons with TSP benchmark problems are presented to justify the algorithm's performance. As individual cases, some practical ICRSPs are also solved and presented numerically. [ABSTRACT FROM AUTHOR]

Copyright of Control Theory & Applications / Kongzhi Lilun Yu Yinyong is the property of Editorial Department of Control Theory & Applications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

A topology optimization of rotor design in switched reluctance (SR) motors based on immune algorithm and ON/OFF method to obtain practical shapes is presented in this paper. The topology optimization using evolutionary algorithms such as genetic algorithm often obtains complex shapes that are impossible to produce in engineering sense. To solve this difficulty, a filtering process is introduced in the present algorithm based on the immune algorithm. The current waveform in SR motors strongly depend on the inductance that varies by the shape of rotor. This results in high computational cost of numerical analysis to obtain the torque property. In this study, a simple estimation method to calculate the current waveform is introduced. This method enable to reduce the computational cost and perform the topology optimization in a practical time. The present method is applied to a topology optimization of SR motor. Optimization results show that feasible shapes are obtained and torque property is improved. [ABSTRACT FROM AUTHOR]

Feature selection and construction are important preprocessing techniques in data mining. They allow not only dimensionality reduction but also classification accuracy and efficiency improvement. While feature selection consists in selecting a subset of relevant feature from the original feature set, feature construction corresponds to the generation of new high-level features, called constructed features, where each one of them is a combination of a subset of original features. Based on these definitions, feature construction could be seen as a bi-level optimization problem where the feature subset should be defined first and then the corresponding (near) optimal combination of the selected features should be found. Motivated by this observation, we propose, in this paper, a bi-level evolutionary approach for feature construction. The basic idea of our algorithm, named bi-level feature construction genetic algorithm (BFC-GA), is to evolve an upper-level population for the task of feature selection, while optimizing the feature combinations at the lower level by evolving a follower population. It is worth noting that for each upper-level individual (feature subset), a whole lower-level population is optimized to find the corresponding (near) optimal feature combination (constructed feature). In this way, BFC-GA would be able to output a set of optimized constructed features that could be very informative to the considered classifier. A detailed experimental study has been conducted on a set of commonly used datasets with varying dimensions. The statistical analysis of the obtained results shows the competitiveness and the outperformance of our bi-level feature construction approach with respect to many state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Feature selection is one of the hottest machine learning topics in recent years. The main purposes of it are to simplify the original model, improve the readability of the model, and prevent over-fitting by searching for a suitable subset of features. There are many methods for this problem, including evolutionary algorithms and particle swarm optimization. Among them, the competitive swarm optimizer is a new optimization algorithm proposed in recent years, which is based on particle swarm optimization algorithm, and has achieved good results in high-dimensional feature selection problems, but it also has the problems of high computation time cost and easily being premature. Aiming at these problems, this paper proposes to add the crossover operator and mutation operator in the genetic algorithm to the competitive swarm optimization, so as to improve the generation speed of new individuals in the algorithm and prevent premature population. After testing on UC Irvine Machine Learning Repository, the new algorithm not only improves the computational efficiency, but also avoids the problem that the competitive swarm optimization algorithm is easy to fall into the local optimum, which greatly improves the calculation effect. [ABSTRACT FROM AUTHOR]