Progressive genetic algorithm for solution of optimization problems with nonlinear equality and inequality constraints

A new approach, identified as progressive genetic algorithm (PGA), is proposed for the solutions of optimization problems with nonlinear equality and inequality constraints. Based on genetic algorithms (GAs) and iteration method, PGA divides the optimization process into two steps; iteration and search steps. In the iteration step, the constraints of the original problem are linearized using truncated Taylor series expansion, yielding an approximate problem with linearized constraints. In the search step, GA is applied to the problem with linearized constraints for the local optimal solution. The final solution is obtained from a progressive iterative process. Application of the proposed method to two simple examples is given to demonstrate the algorithm.     

An evolutionary algorithm with the partial sequential forward floating search mutation for large-scale feature selection problems

Several meta-heuristic algorithms, such as evolutionary algorithms (EAs) and genetic algorithms (GAs), have been developed for solving feature selection problems due to their efficiency for searching feature subset spaces in feature selection problems. Recently, hybrid GAs have been proposed to improve the performance of conventional GAs by embedding a local search operation, or sequential forward floating search mutation, into the GA. Existing hybrid algorithms may damage individuals’ genetic information obtained from genetic operations during the local improvement procedure because of a sequential process of the mutation operation and the local improvement operation. Another issue with a local search operation used in the existing hybrid algorithms is its inappropriateness for large-scale problems. Therefore, we propose a novel approach for solving large-sized feature selection problems, namely, an EA with a partial sequential forward floating search mutation (EAwPS). The proposed approach integrates a local search technique, that is, the partial sequential forward floating search mutation into an EA method. Two algorithms, EAwPS-binary representation (EAwPS-BR) for medium-sized problems and EAwPS-integer representation (EAwPS-IR) for large-sized problems, have been developed. The adaptation of a local improvement method into the EA speeds up the search and directs the search into promising solution areas. We compare the performance of the proposed algorithms with other popular meta-heuristic algorithms using the medium- and large-sized data sets. Experimental results demonstrate that the proposed EAwPS extracts better features within reasonable computational times.     

A niche hybrid genetic algorithm for global optimization of continuous multimodal functions

A niche hybrid genetic algorithm (NHGA) is proposed in this paper to solve continuous multimodal optimization problems more efficiently, accurately and reliably. It provides a new architecture of hybrid algorithms, which organically merges the niche techniques and Nelder–Mead's simplex method into GAs. In the new architecture, the simplex search is first performed in the potential niches, which likely contain a global optimum, to locate the promising zones within search space, quickly and reliably. Then another simplex search is used to quickly discover the global optimum in the located promising zones. The proposed method not only makes the exploration capabilities of GAs stronger through niche techniques, but also has more powerful exploitation capabilities by using simplex search. So it effectively alleviates premature convergence and improves weak exploitation capacities of GAs. A set of benchmark functions is used to demonstrate the validity of NHGA and the role of every component of NHGA. Numerical experiments show that the NHGA may, efficiently and reliably, obtain a more accurate global optimum for the complex and high-dimension multimodal optimization problems. It also demonstrates that the new hybrid architecture is potential and can be used to generate more potential hybrid algorithms.     

改进的遗传模糊聚类算法

对基于遗传算法的FCM(模糊c^-均值法)聚类算法进行了改进,能更好地把遗传算法的全局搜索能力和FCM的局部搜索能力结合起来。实验结果表明,这种改进的算法在分类正确率和稳定性上优于[1]和[3]中的方法;收敛速度和对初值的敏感性都明显优于FCM。     

Scatter Search and Genetic Algorithms for MAX-SAT Problems

In this paper, both scatter search (SS) and genetic algorithms (GAs) are studied for the NP-Hard optimization variant of the satisfiability problem, namely MAX-SAT. First, we investigate a new selection strategy based on both fitness and diversity to choose individuals to participate in the reproduction phase of a genetic algorithm. The resulting algorithm is enhanced in two ways leading to two genetic algorithm variants: the first one uses a uniform crossover. The second one uses a specific crossover operator (to MAX-SAT). The crossover operator is combined with an improved stochastic local search (SLS). The crossover operator is used to identify promising regions while the stochastic local search performs an intensified search of solutions around these regions. Secondly, we propose a scatter search variant for MAX-SAT. Both the SS and the GAs implementations share the solution selection strategy, the improved SLS method and the combination operator. Experiments on several instances from MAX-SAT libraries are performed to show and compare the effectiveness of our approaches. The computational experiments show that both (SS) and (GAs) with a stochastic local search (SLS) improvement technique outperform a classical genetic algorithm (without SLS). The two metaheuristics are able of balancing search diversification and intensification which leads to good results. In general, the specific genetic algorithm with a (SLS) improvement technique and a specific combination method provides competitive results and finds solutions of a higher quality than a scatter search.     

Fuzzy programming for multiobjective 0–1 programming problems through revised genetic algorithms

Recently, genetic algorithms (GAs), a new learning paradigm that models a natural evolution mechanism, have received a great deal of attention regarding their potential as optimization techniques for solving combinatorial optimization problems. In this paper, we focus on multiobjective 0–1 programming problems as a generalization of the traditional single objective ones. By considering the imprecise nature of human judgements, we assume that the decision maker may have fuzzy goal for each of the objective functions. After eliciting the linear membership functions through the interaction with the decision maker, we adopt the fuzzy decision of Bellman and Zadeh or minimum-operator for combining them. In order to investigate the applicability of the conventional GAs for the solution of the formulated problems, a lot of numerical simulations are performed by assuming several genetic operators. Then, instead of using the penalty function for treating the constraints, we propose three types of revised GAs which generate only feasible solutions. Illustrative numerical examples demonstrate both feasibility and efficiency of the proposed methods.     

Worst-Case Tolerance Design and Quality Assurance via Genetic Algorithms

In many engineering designs, several components are often placed together in a mechanical assembly. Due to manufacturing variations, there is a tolerance associated with the nominal dimension of each component in the assembly. The goal of worst-case tolerance analysis is to determine the effect of the smallest and largest assembly dimensions on the product performance. Furthermore, to achieve product quality and robustness, designers must ensure that the product performance variation is minimal.Recently, genetic algorithms (GAs) have gained a great deal of attention in the field of tolerance design. The main strength of GAs lies in their ability to effectively perform directed random search in a large space of design solutions and produce optimum results. However, simultaneous treatment of tolerance analysis and robust design for quality assurance via genetic algorithms has been marginal.In this paper, we introduce a new method based on GAs, which addresses both the worst-case tolerance analysis of mechanical assemblies and robust design. A novel formulation based on manufacturing capability indices allows the GA to rank candidate designs based on varying the tolerances around the nominal design parameter values. Standard genetic operators are then applied to ensure that the product performance measure exhibits minimal variation from the desired target value. The computational results in the design of a clutch assembly highlight the advantages of the proposed methodology.     

A parameter-free self-adapting boundary genetic search for pipe network optimization

Commercial application of genetic algorithms (GAs) to engineering design problems, including optimal design of pipe networks, could be facilitated by the development of algorithms that require the least number of parameter tuning. This paper presents an attempt to eliminate the need for defining a priori the proper penalty parameter in GA search for pipe networks optimal designs. The method is based on the assumption that the optimal solution of a pipe network design problem lies somewhere on, or near, the boundary of the feasible region. The proposed method uses the ratio of the best feasible and infeasible designs at each generation to guide the direction of the search towards the boundary of the feasible domain by automatically adjusting the value of the penalty parameter. The value of the ratio greater than unity is interpreted as the search being performed in the feasible region and vice versa. The new adapted value of the penalty parameter at each generation is therefore calculated as the product of its current value and the aforementioned ratio. The genetic search so constructed is shown to converge to the boundary of the feasible region irrespective of the starting value of the constraint violation penalty parameter. The proposed method is described here in the context of pipe network optimisation problems but is equally applicable to any other constrained optimisation problem. The effectiveness of the method is illustrated with a benchmark pipe network optimization example from the literature.     

A dynamic genetic algorithm based on continuous neural networks for a kind of non-convex optimization problems

This paper presents a kind of dynamic genetic algorithm based on a continuous neural network, which is intrinsically the steepest decent method for constrained optimization problems. The proposed algorithm combines the local searching ability of the steepest decent methods with the global searching ability of genetic algorithms. Genetic algorithms are used to decide each initial point of the steepest decent methods so that all the initial points can be searched intelligently. The steepest decent methods are employed to decide the fitness of genetic algorithms so that some good initial points can be selected. The proposed algorithm is motivated theoretically and biologically. It can be used to solve a non-convex optimization problem which is quadratic and even more non-linear. Compared with standard genetic algorithms, it can improve the precision of the solution while decreasing the searching scale. In contrast to the ordinary steepest decent method, it can obtain global sub-optimal solution while lessening the complexity of calculation.     

Identification of fuzzy relation models using hierarchical fair competition-based parallel genetic algorithms and information granulation

The paper is concerned with a hybrid optimization of fuzzy inference systems based on hierarchical fair competition-based parallel genetic algorithms (HFCGA) and information granulation. The process of information granulation is realized with the aid of the C-Means clustering. HFCGA being a multi-population based parallel genetic algorithms (PGA) is exploited here to realize structure optimization and carry out parameter estimation of the fuzzy models. The HFCGA becomes helpful in the context of fuzzy models as it restricts a premature convergence encountered quite often in optimization problems. It concerns a set of parameters of the model including among others the number of input variables to be used, a specific subset of input variables, and the number of membership functions. In the hybrid optimization process, two general optimization mechanisms are explored. The structural development of the fuzzy model is realized via the HFCGA optimization and C-Means, whereas to deal with the parametric optimization we proceed with a standard least square method and the use of the HFCGA technique. A suite of comparative studies demonstrates that the proposed algorithm leads to the models whose performance is superior in comparison with some other constructs commonly used in fuzzy modeling.     

水泥产品结构的综合智能优化及应用研究

根据水泥市场需求信息,运用自适应模糊推理系统对水泥产品结构需求进行系统建模,应用并行遗传算法对模型求解,得到了来年的最优水泥产品结构需求计划,为水泥企业的生产规划及其经济效益的提高提供了重要的参考价值.     

Performance Analysis of Adaptive Genetic Algorithms with Fuzzy Logic and Heuristics

In this paper, we propose some genetic algorithms with adaptive abilities and compare with them. Crossover and mutation operators of genetic algorithms are used for constructing the adaptive abilities. All together four adaptive genetic algorithms are suggested: one uses a fuzzy logic controller improved in this paper and others employ several heuristics used in conventional studies. These algorithms can regulate the rates of crossover and mutation operators during their search process. All the algorithms are tested and analyzed in numerical examples. Finally, a best genetic algorithm is recommended.     

ARMA model order and parameter estimation using genetic algorithms

A new method for simultaneously determining the order and the parameters of autoregressive moving average (ARMA) models is presented in this article. Given an ARMA (p, q) model in the absence of any information for the order, the correct order of the model (p, q) as well as the correct parameters will be simultaneously determined using genetic algorithms (GAs). These algorithms simply search the order and the parameter spaces to detect their correct values using the GA operators. The proposed method works on the principle of maximizing the GA fitness value relying on the deviation between the actual plant output, with or without an additive noise, and the estimated plant output. Simulation results show in detail the efficiency of the proposed approach. In addition to that, a practical model identification and parameter estimation is conducted in this article with results obtained as desired. The new method is compared with other well-known methods for ARMA model order and parameter estimation.     

A fuzzy goal programming approach to multi-objective optimization problem with priorities

In goal programming problem, the general equilibrium and optimization are often two conflicting factors. This paper proposes a generalized varying-domain optimization method for fuzzy goal programming (FGP) incorporating multiple priorities. According to the three possible styles of the objective function, the varying-domain optimization method and its generalization are proposed. This method can generate the results consistent with the decision-maker (DM)’s expectation, that the goal with higher priority may have higher level of satisfaction. Using this new method, it is a simple process to balance between the equilibrium and optimization, and the result is the consequence of a synthetic decision between them. In contrast to the previous method, the proposed method can make that the higher priority achieving the higher satisfactory degree. To get the global solution of the nonlinear nonconvex programming problem resulting from the original problem and the varying-domain optimization method, the co-evolutionary genetic algorithms (GAs), called GENOCOPIII, is used instead of the SQP method. In this way the DM can get the optimum of the optimization problem. We demonstrate the power of this proposed method by illustrative examples.     

含有模糊决策的线性分布式多目标规划

针对实际问题中决策变量通常是模糊的情况,讨论具有块角结构的含有模糊决策的线性分式多目标规划模型。使用α－水平集,建立了对应的α－多目标规划模型。为解决这类问题,设计了基于模糊模拟的遗传算法。数值例子表明,遗传算法很好地解决了这个问题。     

A novel metaheuristics approach for continuous global optimization

This paper proposes a novel metaheuristics approach to find the global optimum of continuous global optimization problems with box constraints. This approach combines the characteristics of modern metaheuristics such as scatter search (SS), genetic algorithms (GAs), and tabu search (TS) and named as hybrid scatter genetic tabu (HSGT) search. The development of the HSGT search, parameter settings, experimentation, and efficiency of the HSGT search are discussed. The HSGT has been tested against a simulated annealing algorithm, a GA under the name GENOCOP, and a modified version of a hybrid scatter genetic (HSG) search by using 19 well known test functions. Applications to Neural Network training are also examined. From the computational results, the HSGT search proved to be quite effective in identifying the global optimum solution which makes the HSGT search a promising approach to solve the general nonlinear optimization problem.     

An interactive fuzzy satisficing method for multiobjective 0–1 programming problems with fuzzy numbers through genetic algorithms with double strings

In this paper, by considering the experts' vague or fuzzy understanding of the nature of the parameters in the problem-formulation process, multiobjective 0–1 programming problems involving fuzzy numbers are formulated. Using the a-level sets of fuzzy numbers, the corresponding nonfuzzy α-programming problem is introduced. The fuzzy goals of the decision maker (DM) for the objective functions are quantified by eliciting the corresponding linear membership functions. Through the introduction of an extended Pareto optimality concept, if the DM specifies the degree α and the reference membership values, the corresponding extended Pareto optimal solution can be obtained by solving the augmented minimax problems through genetic algorithms with double strings. Then an interactive fuzzy satisficing method for deriving a satisficing solution for the DM efficiently from an extended Pareto optimal solution set is presented. An illustrative numerical example is provided to demonstrate the feasibility and efficiency of the proposed method.     

An empirical study of hybrid genetic algorithms for the set covering problem

The purpose of this paper is to explore the computational performance of several hybrid algorithms that are extensions of a basic genetic algorithm (GA) approach for solving the set covering problem (SCP). We start by making several enhancements to a GA for the SCP that was proposed by Beasley and Chu. Next, several hybrid solution approaches are introduced that combine the GA with various local neighbourhood search approaches, with a form of the greedy randomized adaptive search procedure, and with an estimation of distribution algorithms approach. Using Beasley's library of SCPs extensive computational results are generated for the hybrid solution approaches defined in this paper. Statistical analyses of the results are performed.     

Regularized Adaptation of Fuzzy Inference Systems. Modelling the Opinion of a Medical Expert about Physical Fitness: An Application

This study presents a new approach to adaptation of Sugeno type fuzzy inference systems using regularization, since regularization improves the robustness of standard parameter estimation algorithms leading to stable fuzzy approximation. The proposed method can be used for modelling, identification and control of physical processes. A recursive method for on-line identification of fuzzy parameters employing Tikhonov regularization is suggested. The power of approach was shown by applying it to the modelling, identification, and adaptive control problems of dynamic processes. The proposed approach was used for modelling of human-decisions (experience) with a fuzzy inference system and for the fuzzy approximation of physical fitness with real world medical data.     

预制构件流水车间订单接受与调度的集成优化

针对预制构件生产管理过程中订单工期紧和生产能力不足的问题,在充分考虑中断和不可中断工序,串行和并行工序等复杂工况特点的基础上,以最大化净利润为目标,建立了一种订单接受与调度集成优化模型。鉴于问题的NP难性和模型的高度非线性,通过集成问题性质、构造启发式、邻域搜索和破坏-构造机制,提出了一种混合加速迭代贪婪搜索框架。其中,在调度构造阶段,为提高算法求解质量和搜索效率,设计了两种融合订单插入操作性质的加速构造策略。计算结果显示,与混合遗传禁忌搜索算法,遗传算法以及禁忌搜索算法相比,本文所提算法具有更好的求解质量和搜索效率。同时验证了所提出的加速构造策略能够有效减少算法运行时间。该研究有望显著提高预制生产企业净利润和客户满意度。