基于改进的旗鱼优化算法求解Sylvester问题

Sylvester问题又称最小包围圆问题,提出了一种改进的旗鱼优化算法(ISFO)对其进行求解.首先对旗鱼优化算法(SFO)的寻优策略进行分析;其次,针对旗鱼优化算法种群初始化依赖,容易陷入局部最优等问题,引入Arnold映射初始化种群,提高算法的寻优能力;引入反向学习与柯西变异算子策略对全局最优解进行扰动产生新解,平衡算法的开发与勘探能力,避免算法出现早熟现象;然后和基本SFO算法与PSO算法使用6个基准测试函数进行仿真实验对比,结果表明ISFO算法相对于SFO算法收敛速度更快、精度更高、有效避免了早熟现象.最后使用ISFO、SFO、PSO对三个规模案例的Sylvester问题进行求解,证明了ISFO算法求解Sylvester问题的可行性与优越性.     

一种融合Powell搜索法的差分进化算法

<正>1引言在自然科学和工程技术领域中,人们遇到的很多问题都可归结为目标优化问题,求解目标优化问题,经典的传统方法有:单纯形法、牛顿法、共轭梯度法、爬山法~([1])等.而在实际应用中,人们遇到的往往是些非线性、大规模的优化问题,传统方法难以求得最优解.近年来,群体智能算法成为一个研究的热点,遗传算法(GA)、粒子群算法(PSO)、蚁群算法(ACO)、人工萤火虫算法(GSO)~([2-5])等已广泛应用于求解目标优化问题,已有研究表明     

武器-目标分配问题算法研究综述

介绍武器-目标分配问题算法研究的现状及进展.目前解决WTA问题的算法主要是以一种智能算法为主结合另外一种或者多种智能算法的混合优化算法,并且不断有新的智能算法和一些新技术、新思想相结合的算法出现.指出了目前WTA问题算法研究中存在的一些不足及进一步的发展方向.     

基于粒子群算法的非线性二层规划问题的求解算法

粒子群算法（Particle Swarm Optimization，PSO）是一种新兴的优化技术，其思想来源于人工生命和演化计算理论。PSO通过粒子追随自己找到的最好解和整个群的最好解来完成优化。该算法简单易实现，可调参数少，已得到了广泛研究和应用。本文根据该算法能够有效的求出非凸数学规划全局最优解的特点，对非线性二层规划的上下层问题求解，并根据二层规划的特点，给出了求解非线性二层规划问题全局最优解的有效算法。数值计算结果表明该算法有效。     

非线性整数规划的一个新的无参数填充函数算法

离散填充函数是一种用于求解多极值优化问题最优解的一种行之有效的方法.已被证明对于求解大规模离散优化问题是有效的.本文基于改进的离散填充函数定义,构造了一个新的无参数填充函数,并在理论上给出了证明,提出了一个新的填充函数算法.该填充函数无需调节参数,而且只需极小化一次目标函数.数值结果表明,该算法是高效的、可行的.     

低阶精确罚函数的一种二阶光滑逼近

给出了求解约束优化问题的低阶精确罚函数的一种二阶光滑逼近方法,证明了光滑后的罚优化问题的最优解是原约束优化问题的ε-近似最优解,基于光滑后的罚优化问题,提出了求解约束优化问题的一种新的算法,并证明了该算法的收敛性,数值例子表明该算法对于求解约束优化问题是有效的.     

热传导(对流-扩散)方程源项识别的粒子群优化算法

提出了利用粒子群优化(PSO)算法反演热传导方程与对流-扩散方程源项的一种新方法,在已有文献方法的基础上,求解出这两类方程正问题的解析解,再把源项识别问题转化为最优化问题,结合粒子群优化算法寻优求解.通过数值模拟与统计检验,结果表明,此方法可快速有效地实现热传导方程与对流-扩散方程源项的识别,并可推广应用到其它数学物理方程的源项或参数的反演识别.     

基于圆形件排样问题的遗传算法研究

排样性问题是一类优化求解问题,在遗传算法求解过程中,若所用的算法是不收敛的,则无法得到最优解.给出了一种混合式遗传算法,并证明了算法是完全收敛的,能够得到全局最优解.     

求多目标优化问题Pareto最优解集的方法

主要讨论了无约束多目标优化问题Pareto最优解集的求解方法,其中问题的目标函数是C1连续函数.给出了Pareto最优解集的一个充要条件,定义了α强有效解,并结合区间分析的方法,建立了求解无约束多目标优化问题Pareto最优解集的区间算法,理论分析和数值结果均表明该算法是可靠和有效的.     

旅行商问题的交叉粒子群优化算法

本文将粒子群优化算法(PSO)应用于求解旅行商问题(TSP),结合遗传算法的交叉算子,建立了求解此问题的交叉粒子群优化算法,数值模拟结果表明了该算法的有效性.     

基于群智能算法的预防性维修周期优化

分析将蚁群优化算法应用于预防性维修周期工程寻优问题时遇到的算法参数选择困难等问题,提出将粒子群优化算法和空间划分方法引入该过程以改进原蚁群算法的寻优规则和历程.建立混合粒子群和蚁群算法的群智能优化策略:PS_ACO(Particle Swarm and Ant Colony Optimization),并将其应用于混联系统预防性维修周期优化过程中,以解决由于蚁群算法中参数选择不当和随机产生维修周期解值带来的求解精度差、寻优效率低等问题.算法的寻优结果对比分析表明:该PS_ACO算法应用于预防性维修周期优化问题,在寻优效率及寻优精度上有部分改进,且可相对削弱算法参数选择对优化结果的影响.     

Discrete Capacity Assignment in IP networks using Particle Swarm Optimization

This paper presents a design methodology for IP networks under end-to-end Quality-of-Service (QoS) constraints. Particularly, we consider a more realistic problem formulation in which the link capacities of a general-topology packet network are discrete variables. This Discrete Capacity Assignment (DCA) problem can be classified as a constrained combinatorial optimization problem. A refined TCP/IP traffic modeling technique is also considered in order to estimate performance metrics for networks loaded by realistic traffic patterns. We propose a discrete variable Particle Swarm Optimization (PSO) procedure to find solutions for the problem. A simple approach called Bottleneck Link Heuristic (BLH) is also proposed to obtain admissible solutions in a fast way. The PSO performance, compared to that one of an exhaustive search (ES) procedure, suggests that the PSO algorithm provides a quite efficient approach to obtain (near) optimal solutions with small computational effort.     

一种加入创新粒子的粒子群

粒子群算法是一种基于群体智能的随机并行算法,它在很多优化问题中都得到了比较好的应用。本文针对粒子群容易陷入局部最优解,提出了一种加入创新粒子的粒子群,实验模拟结果表明加入创新粒子的粒子群有更好的结果和收敛速度。     

Analytical and stochastic modelling techniques

In mining supply chains, large combinatorial optimization problems arise. These are NP-hard and typically require a large number of computing resources to solve them. In particular, the run-time overheads can become increasingly prohibitive with increasing problem sizes. Parallel methods provide a way to manage such run-time issues by utilising several processors in independent or shared memory architectures. However it is not obvious how to adapt serial optimisation algorithms to perform best in a parallel environment. Here, we consider a resource constrained scheduling problem which is motivated in mining supply chains and present two popular meta-heuristics, ant colony optimization (ACO) and simulated annealing and investigate how best to parallelize these methods on a shared memory architecture consisting of several cores. ACO’s solution construction framework is inherently parallel allowing a relatively straightforward parallel implementation. However, for best performance, ACO needs an element of local search. This significantly complicates the paralellization. Several alternative schemes for parallel ACO with elements of local search are considered and evaluated empirically. We find that ACO with local search is the most effective single-threaded algorithm. The best parallel implementation can obtain similar quality results to the serial method in significantly less elapsed time.     

An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem

Given an undirected graph and a weighting function defined on the vertex set, the minimum weight vertex cover problem is to find a vertex subset whose total weight is minimum subject to the premise that the selected vertices cover all edges in the graph. In this paper, we introduce a meta-heuristic based upon the Ant Colony Optimization (ACO) approach, to find approximate solutions to the minimum weight vertex cover problem. In the literature, the ACO approach has been successfully applied to several well-known combinatorial optimization problems whose solutions might be in the form of paths on the associated graphs. A solution to the minimum weight vertex cover problem however needs not to constitute a path. The ACO algorithm proposed in this paper incorporates several new features so as to select vertices out of the vertex set whereas the total weight can be minimized as much as possible. Computational experiments are designed and conducted to study the performance of our proposed approach. Numerical results evince that the ACO algorithm demonstrates significant effectiveness and robustness in solving the minimum weight vertex cover problem.     

Differential Evolution algorithm with Separated Groups for multi-dimensional optimization problems

The classical Differential Evolution (DE) algorithm, one of population-based Evolutionary Computation methods, proved to be a successful approach for relatively simple problems, but does not perform well for difficult multi-dimensional non-convex functions. A number of significant modifications of DE have been proposed in recent years, including very few approaches referring to the idea of distributed Evolutionary Algorithms. The present paper presents a new algorithm to improve optimization performance, namely DE with Separated Groups (DE-SG), which distributes population into small groups, defines rules of exchange of information and individuals between the groups and uses two different strategies to keep balance between exploration and exploitation capabilities. The performance of DE-SG is compared to that of eight algorithms belonging to the class of Evolutionary Strategies (Covariance Matrix Adaptation ES), Particle Swarm Optimization (Comprehensive Learning PSO and Efficient Population Utilization Strategy PSO), Differential Evolution (Distributed DE with explorative-exploitative population families, Self-adaptive DE, DE with global and local neighbours and Grouping Differential Evolution) and multi-algorithms (AMALGAM). The comparison is carried out for a set of 10-, 30- and 50-dimensional rotated test problems of varying difficulty, including 10- and 30-dimensional composition functions from CEC2005. Although slow for simple functions, the proposed DE-SG algorithm achieves a great success rate for more difficult 30- and 50-dimensional problems.     

基于粒子群优化算法的库存不确定性分析

库存不确定性问题是供应链不确定性研究的重点之一.利用粒子群优化算法快速搜寻最优解的优点对库存不确定性问题进行仿真分析,得出了库存不确定性环境下的最优解,这说明了粒子群优化算法能够辅助供应链管理者在不确定性环境下对供应链进行优化设计和决策分析.     

供给总量限定需求区间约束型运输问题——时限费用优化模型与算法

本文目的是为建立与运输问题有关的决策支持系统提供方便.本文建立了供给总量限定需求区间约束型运输问题的对时限与费用两个目标进行优化的多目标规划模型,给出了求解模型的算法,并举例说明了算法的应用.该算法能求得问题的最优解,并具有易于编程实现、收敛性好等优点.数值实验表明该算法有较高的计算效率,可用于求解某些类型的指派问题.     

Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization

This paper presents a Hybrid Particle Swarm Optimization (HPSO) to solve the Unit Commitment (UC) problem. Problem formulation of the unit commitment takes into consideration the minimum up and down time constraints, start up cost and spinning reserve, which is defined as the minimization of the total objective function while satisfying all the associated constraints. Problem formulation, representation and the simulation results for a 10 generator-scheduling problem are presented. Results shown are acceptable at this early stage.     

一种改进粒子群优化算法及其在投资规划中的应用

粒子群优化算法(PSO)是模拟生物群体智能的优化算法,具有良好的优化性能.但是群体收缩过快和群体多样性降低导致早熟收敛.本文引入了多样性指标和收敛因子模型来改进PSO算法,形成多样性收敛因子PSO算法(DCPSO),并且对现代资产投资的多目标规划问题进行了优化,简化了多目标规划的问题,并且表现出了比传统PSO算法更好性能.