一种改进适应度函数的遗传算法

针对遗传算法搜索导优中适应度函数的设计不当,将难以体现个体差异和选择操作的作用,从而造成早熟收敛的问题,构建了两种基于顺序的适应度函数的模型.适应度函数的设计使得在进化过程中控制选择压力,种群竞争力得到增强,早熟现象得到改善.并将改进的算法应用在复杂函数优化问题上,MATLAB优化结果表明,算法在种群多样性、搜索速度、计算精度上均有改善,推动遗传算法在工程领域的应用.     

函数优化的小生境蝙蝠算法

针对蝙蝠算法易陷入局部最优解的缺点,利用小生境技术对蝙蝠算法进行了改进,提出一种小生境蝙蝠优化算法.算法基于小生境技术的适应度共享来分隔种群,引入了小生境排挤机制来保持种群多样性,在延续蝙蝠算法原有并行搜索等优势的基础上,提高了算法的金局搜索能力和局部收敛速度,具有可在不同邻域内发现多个解的特点.通过对一系列经典函数测试,并与已有算法进行比较,结果表明该算法在函数优化问题的求解中具有较高的计算效率和精度,以及较好的全局寻优能力.     

自适应多种群回溯群居蜘蛛算法求解TSP问题

在群居蜘蛛优化算法中引入自适应决策半径,将蜘蛛种群动态地分成多个种群,种群内适应度不同的个体采取不同的更新方式.在筛选全局极值的基础上,根据进化程度执行回溯迭代更新,提出一种自适应多种群回溯群居蜘蛛优化算法,旨在提高种群样本多样性和算法全局寻优能力.函数寻优结果表明改进算法具有较快的收敛速度和较高的收敛精度.最后将其应用于TSP问题的求解.     

一种基于极坐标编码的果蝇优化算法

针对果蝇优化算法易陷入早熟收敛、收敛速度慢、寻优精度低的缺点,提出一种基于极坐标编码的果蝇优化算法.为提高果蝇优化算法的寻优精度,采用极坐标编码的形式,以增加单个母体寻优空间表示方法的多样性,并使种群中的个体,在围绕个体的整个超球体内随机搜索,使个体的搜索范围更加广泛.在迭代寻优过程中,根据适应度值和概率调整极角,逐渐降低观测结果的不确定性.通过9个基准测试函数,对基于极坐标编码的果蝇优化算法进行仿真实验,结果表明了算法在收敛性和稳定性方面,优于其它5个优化算法,测试结果验证了极坐标编码方法的有效性和可行性.     

基于蚁群算法的模糊分类系统设计

提出了一种基于最大-最小蚁群算法的模糊分类系统设计方法.该方法通过两个阶段来实现:特征变量选择和模型参数优化.首先采用蚁群算法对特征变量进行选择,得到一组具有较高分辩性能的特征变量,提高模型的解释性;在模型结构确定后,蚁群算法从训练样本中提取信息对模型的参数进行优化,在保证模型精确性的前提下,构造具有较少变量数目及规则数目的模糊模型,实现了精确性与解释性的折衷.最后将本方法运用到Iris和Wine数据样本分类问题中,并将结果与其它方法进行比较,仿真结果证明了该方法的有效性.     

基于正弦余弦算法的柯布-道格拉斯生产函数模型参数估计

研究了柯布-道格拉斯生产函数模型,建立了以误差为目标的最小二乘优化模型,采用正弦余弦算法确定了相关参数.算法在种群更新过程中分别使用了正弦和余弦函数,算法先进行全局探索再进行局部开发.最后通过一个算例,验证了正弦余弦算法的有效性.     

改进伪并行遗传算法求解作业车间调度问题

针对遗传算法在求解极复杂优化问题中出现的过早收敛、执行效率差的缺点,提出了一种改进的伪并行遗传算法.该算法将并行进化与串行搜索相结合,提高了算法的收敛速度.同时该算法通过种群因子控制伪并行算法中的各子种群的规模,不仅保证了搜索过程中勘探和开采的平衡,克服过早收敛,而且减少了计算的复杂性,特别是在处理复杂优化问题上具有较高的性能.实验结果证明了该算法的有效性.     

一种求解约束优化问题的改进差分进化算法

针对在处理约束优化问题时约束条件难以处理的问题,提出了一种求解约束优化问题的改进差分进化算法.即在每代进化前将群体分为可行个体和不可行个体两类,对不可行个体,用差量法将其逐个转化为可行个体,并保持种群规模不变,经过一序列的进化后,计算所有可行个体的适应度并找到问题的最优解.对5个经典函数进行了优化测试,测试结果表明提出的算法对求解约束优化问题是有效的.     

区间数型多目标联运路线优化问题的模型与算法

联运路线优化问题直接关系到货物运输的费用、时间和运输质量.首先分析了联运路线优化问题的数学模型及虚拟运输网络图;其次,将区间数排序的思想及属性值为区间数的多属性决策方法引入适应度函数的设计中,提出了一种求解区间数型联合运输路线优化问题的混合型遗传算法,给出了染色体编码、遗传算子设计、适应度函数定义及群体多样性控制的方法;最后用示例对算法的有效性进行了验证.     

稳健的模糊回归区间分析

由于传统的回归分析易受到异常值的影响。针对输入变量为实数,输出变量和输入参数为模糊数的情况,给出了一种稳健的模糊回归区间预测模型和算法。该模型基于输出变量的隶属度函数为目标函数,以估计的区间为约束条件。给出的算法具有较强的稳健性,利用该算法估计的区间几乎不受异常值的影响。最后通过一个数值算例,与其他模型算法对比分析,验证了该模型和算法的有效性和稳健性。     

A genotype-phenotype-fitness assessment protocol for evolutionary self-assembly Wang tiles design

In a previous work we have reported on the evolutionary design optimisation of self-assembling Wang tiles capable of arranging themselves together into a target structure. Apart from the significant findings on how self-assembly is achieved, nothing has been yet said about the efficiency by which individuals were evolved. Specially in light that the mapping from genotype to phenotype and from this to fitness is clearly a complex, stochastic and non-linear relationship. One of the most common procedures would suggest running many experiments for different configurations followed by a fitness comparison, which is not only time-consuming but also inaccurate for such intricate mappings. In this paper we aim to report on a complementary dual assessment protocol to analyse whether our genetic algorithm, using morphological image analyses as fitness function, is an effective methodology. Thus, we present here fitness distance correlation to measure how effectively the fitness of an individual correlates to its genotypic distance to a known optimum, and introduce clustering as a mechanism to verify how the objective function can effectively differentiate between dissimilar phenotypes and classify similar ones for the purpose of selection.     

Correlation analysis of coupled fitness landscapes

The correlation structure of fitness landscapes is a much used measure to characterize and classify various types of landscapes. However, analyzing the correlation structure of fitness landscapes has so far been restricted to static landscapes only. Here, we investigate the correlation structure of coupled, or dynamic, fitness landscapes. Using the NKC model of coevolution, we apply a correlation analysis on various instances of this model and present the results. One of the main goals of this article is thus to show that a previously introduced correlation analysis can be successfully extended to coupled fitness landscapes. Furthermore, our analysis shows that this provides meaningful and interesting results that can contribute to a better understanding of coevolution in general. © 2005 Wiley Periodicals, Inc. Complexity 10: 41–49, 2005     

A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic

In this article, a new memetic algorithm has been proposed to solve job shop scheduling problems (JSSPs). The proposed method is a genetic-algorithm-based approach combined with a local search heuristic. The proposed local search heuristic is based on critical operations. It removes the critical operations and reassigns them to a new position to improve the fitness value of the schedule. Moreover, in this article, a new fitness function is introduced for JSSPs. The new fitness function called priority-based fitness function is defined in three priority levels to improve the selection procedure. To show the generality of our proposed method, we apply it to three different types of job scheduling problems including classical, flexible and multi-objective flexible JSSPs. The experiment results show the efficiency of the proposed fitness function. In addition, the results show that incorporating local search not only offers better solutions but also improves the convergence rate. Compared to the state-of-the-art algorithms, the proposed method outperforms the existing methods in classical JSSPs and offers competitive solutions in other types of scheduling problems.     

A novel method for optimal capacitor placement and sizing in distribution systems with nonlinear loads and DG using GA

A genetic algorithm (GA) is proposed for simultaneous power quality improvement, optimal placement and sizing of fixed capacitor banks in radial distribution networks with nonlinear loads and distributed generation (DG) imposing voltage–current harmonics. In distribution systems, nonlinear loads and DGs are often considered as harmonic sources. For optimizing capacitor placement and sizing in the distribution system, objective function includes the cost of power losses, energy losses and capacitor banks. At the same time, constraints include voltage limits, number/size of installed capacitors (at each bus) and the power quality limits of standard IEEE-519. In this study, new fitness function is used to solve the constrained optimization problem with discrete variables. Simulation results for two IEEE distorted networks (18-bus and 33-bus test systems) are presented and solutions of the proposed method are compared with those of previous methods described in the literature. The main contribution of this paper is computing the (near) global solution with a lower probability of getting stuck at a local optimum and weak dependency on initial conditions, while avoiding numerical problems in large systems. Results show that proposed method could be effectively used for optimal capacitor placement and sizing in distorted distribution systems.     

A Posteriori Estimates for Modelling Errors of the Stationary Diffusion Equation with Complicated Coefficients

In this paper, we suggest a new computational strategy for diffusion type problems with coefficients that may sharply change values and have a complicated distribution over the domain. We solve models, which approximate the coefficients, numerically and estimate the corresponding approximation errors by the a posteriori estimates of functional type. We show that the modelling error can be also explicitly calculated. This allows to obtain numerical solutions of complicated diffusion problems by solving much simpler problems that do not require full detailization of the structure of coefficients. Balancing modelling and discretization errors provides an economical way of getting an approximate solution with an a priori given accuracy. (© 2010 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Landscape analysis and efficient metaheuristics for solving the n-queens problem

The n-queens problem is a classical combinatorial optimization problem which has been proved to be NP-hard. The goal is to place n non-attacking queens on an n×n chessboard. In this paper, two single-solution-based (Local Search (LS) and Tuned Simulated Annealing (SA)) and two population-based metaheuristics (two versions of Scatter Search (SS)) are presented for solving the problem. Since parameters of heuristic and metaheuristic algorithms have great influence on their performance, a TOPSIS-Taguchi based parameter tuning method is proposed, which not only considers the number of fitness function evaluations, but also aims to minimize the runtime of the presented metaheuristics. The performance of the suggested approaches was investigated through computational analyses, which showed that the Local Search method outperformed the other two algorithms in terms of average runtimes and average number of fitness function evaluations. The LS was also compared to the Cooperative PSO (CPSO) and SA algorithms, which are currently the best algorithms in the literature for finding the first solution to the n-queens problem, and the results showed that the average fitness function evaluation of the LS is approximately 21 and 8 times less than that of SA and CPSO, respectively. Also, a fitness analysis of landscape for the n-queens problem was conducted which indicated that the distribution of local optima is uniformly random and scattered over the search space. The landscape is rugged and there is no significant correlation between fitness and distance of solutions, and so a local search heuristic can search a rugged plain landscape effectively and find a solution quickly. As a result, it was statistically and analytically proved that single-solution-based metaheuristics outperform population-based metaheuristics in finding the first solution of the n-queens problem.     

种群规模自适应粒子群在配送中心连续型选址中的应用

本文依照更具有现实意义的“加工厂—配送中心—用户”的模式建立物流配送中心连续型选址模型,并针对较大规模的选址问题提出求解算法。该算法是将具有较强鲁棒性的自适应粒子算法和改进的ALA(Alert Location-Allocation)方法结合而得,该算法中种群规模自适应变化,对经典粒子移动方程进行改进,消除了学习因子,惯性因子随粒子适应值自适应变化,改进的ALA方法提高了算法计算效率。数值试验表明,本文所建模型具有一定的实践优越性,所提出的算法能有效避免陷入局部最优,寻优能力和鲁棒性均较强。     

Multiplex networks with intrinsic fitness: Modeling the merit-fame interplay via latent layers

We consider the problem of growing multiplex networks with intrinsic fitness and inter-layer coupling. The model comprises two layers; one that incorporates fitness and another in which attachments are preferential. In the first layer, attachment probabilities are proportional to fitness values, and in the second layer, proportional to the sum of degrees in both layers. We provide analytical closed-form solutions for the joint distributions of fitness and degrees. We also derive closed-form expressions for the expected value of the degree as a function of fitness. The model alleviates two shortcomings that are present in the current models of growing multiplex networks: homogeneity of connections, and homogeneity of fitness. In this paper, we posit and analyze a growth model that is heterogeneous in both senses.     

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.     

动态空间调度的混合遗传算法

提出了一种基于混合遗传算法的动态空间调度方法。首先利用遗传算法产生多个可行的分段调度序列,再采用动态决定分段位置的启发式算法——平均最大空闲矩形策略对遗传算法产生的调度序列进行解码。同时以完工时间和平台利用率的加权和作为适应度函数,充分考虑了空间调度问题所特有的动态性和时空关联性。遗传进化过程收敛后得到近似最优解,实现了调度方案的全局优化。对船厂实际生产数据进行了实证分析以及与其它算法的对比分析,证明了所提方法在空间调度问题上的有效性和实用性。