CVaR 投资组合问题求解的一种混合元启发式搜索算法

本文针对均值-CVaR投资组合优化问题,基于混沌搜索、粒子群优化和引力搜索算法提出了一种新的混合元启发式搜索算法,而后基于多维布朗运动,借助Monte Carlo模拟情景生成得到价格路径,进而近似求解均值-CVaR投资组合选择问题,并与线性规划和非参数估计两种求解算法进行比较。模拟和实证算例结果表明,新算法在求解有效性和实用性方面表现更好,取得更为满意的结果。     

基于PSO-AFSA混合算法的模糊投资组合问题的研究

针对模糊不确定的证券市场,用可能性均值、下可能性方差和协方差分别替换了投资组合模型中概率均值、方差和协方差,构建了双目标均值-方差投资组合模型。然后采用线性加权法将双目标模型转化为单目标模型,进而提出了一个PSO-AFSA混合算法对其求解。该混合算法中,将粒子群算法搜索的结果作为人工鱼群算法初始鱼群,进一步搜索,这样能有效的避免粒子群算法陷入局部最优。同时,将人工鱼群中的最好位置反馈到粒子群算法的速度更新公式中,指引粒子运动,加快算法收敛。最后,进行实例分析,结果表明:PSO-AFSA混合算法是有效的,混合算法搜索到的全局最优值好于基本粒子群算法搜索到的全局最优值。     

超越方程的优化解法

针对粒子群算法局部搜索能力差,后期收敛速度慢等缺点,提出了一种改进的粒子群算法,该算法是在粒子群算法后期加入拟牛顿方法,充分发挥了粒子群算法的全局搜索性和拟牛顿法的局部精细搜索性,从而克服了粒子群算法的不足,把超越方程转化为函数优化的问题,利用该算法求解,数值实验结果表明,算法有较高的收敛速度和求解精度。     

基于比例边界有限元法和灰狼优化算法的裂纹尖端位置识别

基于比例边界有限元法(SBFEM)和灰狼优化(GWO)算法,提出了一种裂纹尖端识别方法。首先,借助SBFEM解决断裂力学问题特有的优势,快速准确地计算出反演所需的测点位移,并验证了正问题求解的正确性。其次,建立与裂纹尖端位置有关的目标函数,将求解裂纹尖端位置转换为求解目标函数最小值的优化问题。最后,采用GWO算法对目标函数进行了优化,进而搜索裂纹尖端的最佳位置。数值算例结果表明:利用SBFEM的高精度、半解析的优点,在反演过程中采用其求解正问题是非常有效的;GWO算法具有良好的全局收敛性,且相比经典的粒子群算法,能够更快速准确地搜索出裂纹尖端的位置;GWO算法具有较好的抗噪性。     

混合无等待流水线干扰管理调度方法研究

针对带分批约束的混合无等待流水加工环境中干扰事件的出现导致初始调度计划发生偏离的问题,研究如何运用干扰管理理论来应对工件变更扰动情况,建立了兼顾最小化工件完工时间加权和指标(初始调度目标)和最小化工件完工滞后时间加权和指标(偏离校正目标)的干扰管理调度模型,提出了双层微粒群优化策略与随机多邻域搜索机制相结合的混合求解算法。数值算例仿真实验结果表明,包含“插入-交换”大概率邻域搜索算子的混合微粒群优化算法求解本文所构建的干扰管理调度模型是有效的。     

置换流水车间调度问题的中心引力优化算法求解

目前求解置换流水车间调度问题的智能优化算法都是随机型优化方法,存在的一个问题是解的稳定性较差。针对该问题,本文给出一种确定型智能优化算法——中心引力优化算法的求解方法。为处理基本中心引力优化算法对初始解选择要求高的问题,利用低偏差序列生成初始解,提高初始解质量;利用加速度和位置迭代方程更新解的状态;利用两位置交换排序法进行局部搜索,提高算法的优化性能。采用置换流水车间调度问题标准测试算例进行数值实验,并和基本中心引力优化算法、NEH启发式算法、微粒群优化算法和萤火虫算法进行比较。结果表明该算法不仅具有更好的解的稳定性,而且具有更高的计算精度,为置换流水车间调度问题的求解提供了一种可行有效的方法。     

一类投资组合优化问题的求解及实证分析

在证券投资组合优化的决策问题中,投资者通过选取不同的证券分散风险,为了使分散化的利益最大化,还须考虑证券组合的最佳规模以及交易成本。本文在给出求解这类问题的一种计算方法的基础上,进行实证分析。这里所用的方法以及结果,也适合于其他各种具有风险的投资决策问题。     

基于旋转算法的随机模糊均值-方差投资组合优化

Markowitz首先采用方差度量风险，并应用于投资组合优化中，大多数的均值方差模型仅对随机投资组合优化或模糊投资组合优化进行研究，然而，实际投资组合优化问题既包含随机信息也包含模糊信息。本文首先定义随机模糊变量的方差，并用其度量风险，提出了具有交易成本、借贷约束和阀值约束的均值-方差随机模糊投资组合优化模型。基于随机模糊理论，将上述模型转化为具有线性等式和线性不等式约束的凸二次规划问题，并得到其KKT条件。本文还提出改进的旋转算法求解上述模型，该算法消掉KKT条件中部分变量，减少计算量。最后，采用中国证券市场的实际数据进行样本内分析和样本外分析，验证了上述模型和算法的有效性。     

基于量子粒子群算法的电力系统负荷多目标优化分配

针对电力系统经济负荷优化分配问题,提出了一种基于量子粒子群的多目标优化算法.该算法通过将改进后的量子进化算法融合到粒子群中,采用量子位对粒子的当前位置进行编码,用量子旋转门实现对粒子最优位置的搜索,用量子非门实现粒子位置的变异以避免早熟收敛.这种搜索机制能够遍历解空间,增强种群的多样性,并能用量子位的概率幅将最优解表述为解空间中的多种表述形式,从而增强全局最优的可能性.最后,通过算例进行仿真分析,结果表明算法的搜索能力和优化效率均优于普通粒子群算法.     

模糊投资组合选择问题的改进帝企鹅优化算法

模糊投资组合选择问题是在基本投资组合模型中引入模糊集理论,使所建立的模型与实际市场更加吻合,但同时也增加了模型求解难度.因此,本文针对两种不同的模糊投资组合模型,提出一种改进帝企鹅优化算法.算法首先引入可行性准则,处理模糊投资组合模型中的约束.其次,算法中加入变异机制,平衡算法的开发和探索能力,引导种群向最优个体收敛.通过对CEC 2006中的13个标准测试问题及两个模糊投资组合问题实例进行数值实验,并与其他群智能优化算法进行结果比较,发现本文所提出的算法具有较好的优化性能,并且对于求解模糊投资组合选择问题是有效的.     

求解旅行商问题的基于类Kruskal的混合粒子群算法

本文针对求解旅行商问题的标准粒子群算法所存在的早熟和低效的问题,提出一种基于Greedy Heuristic的初始解与粒子群相结合的混合粒子群算法(SKHPSO)。该算法通过本文给出的类Kruskal算法作为Greedy Heuristic的具体实现手段,产生一个较优的初始可行解,作为粒子群中的一员,然后再用改进的混合粒子群算法进行启发式搜索。SKHPSO的局部搜索借鉴了Lin-Kernighan邻域搜索,而全局搜索结合了遗传算法中的交叉及置换操作。应用该算法对TSPLIB中的典型算例进行了算法测试分析,结果表明:SKHPSO可明显提高求解的质量和效率。     

A hybrid particle swarm optimization and bacterial foraging for power system stability enhancement

A novel hybrid approach involving particle swarm optimization (PSO) and bacterial foraging optimization algorithm (BFOA) called bacterial swarm optimization (BSO) is illustrated for designing static var compensator (SVC) in a multimachine power system. In BSO, the search directions of tumble behavior for each bacterium are oriented by the individual's best location and the global best location of PSO. The proposed hybrid algorithm has been extensively compared with the original BFOA algorithm and the PSO algorithm. Simulation results have shown the validity of the proposed BSO in tuning SVC compared with BFOA and PSO. Moreover, the results are presented to demonstrate the effectiveness of the proposed controller to improve the power system stability over a wide range of loading conditions. © 2014 Wiley Periodicals, Inc. Complexity 21: 245–255, 2015     

A Particle Swarm Optimization Algorithm with Path Relinking for the Location Routing Problem

This paper introduces a new hybrid algorithmic nature inspired approach based on particle swarm optimization, for solving successfully one of the most popular logistics management problems, the location routing problem (LRP). The proposed algorithm for the solution of the location routing problem, the hybrid particle swarm optimization (HybPSO-LRP), combines a particle swarm optimization (PSO) algorithm, the multiple phase neighborhood search – greedy randomized adaptive search procedure (MPNS-GRASP) algorithm, the expanding neighborhood search (ENS) strategy and a path relinking (PR) strategy. The algorithm is tested on a set of benchmark instances. The results of the algorithm are very satisfactory for these instances and for six of them a new best solution has been found.      

A hybrid simplex search and particle swarm optimization for unconstrained optimization

This paper proposes the hybrid NM-PSO algorithm based on the Nelder–Mead (NM) simplex search method and particle swarm optimization (PSO) for unconstrained optimization. NM-PSO is very easy to implement in practice since it does not require gradient computation. The modification of both the Nelder–Mead simplex search method and particle swarm optimization intends to produce faster and more accurate convergence. The main purpose of the paper is to demonstrate how the standard particle swarm optimizers can be improved by incorporating a hybridization strategy. In a suite of 20 test function problems taken from the literature, computational results via a comprehensive experimental study, preceded by the investigation of parameter selection, show that the hybrid NM-PSO approach outperforms other three relevant search techniques (i.e., the original NM simplex search method, the original PSO and the guaranteed convergence particle swarm optimization (GCPSO)) in terms of solution quality and convergence rate. In a later part of the comparative experiment, the NM-PSO algorithm is compared to various most up-to-date cooperative PSO (CPSO) procedures appearing in the literature. The comparison report still largely favors the NM-PSO algorithm in the performance of accuracy, robustness and function evaluation. As evidenced by the overall assessment based on two kinds of computational experience, the new algorithm has demonstrated to be extremely effective and efficient at locating best-practice optimal solutions for unconstrained optimization.     

Particle swarm optimization: Hybridization perspectives and experimental illustrations

Metaheuristic optimization algorithms have become popular choice for solving complex and intricate problems which are otherwise difficult to solve by traditional methods. In the present study an attempt is made to review the hybrid optimization techniques in which one main algorithm is a well known metaheuristic; particle swarm optimization or PSO. Hybridization is a method of combining two (or more) techniques in a judicious manner such that the resulting algorithm contains the positive features of both (or all) the algorithms. Depending on the algorithm/s used we made three classifications as (i) Hybridization of PSO and genetic algorithms (ii) Hybridization of PSO with differential evolution and (iii) Hybridization of PSO with other techniques. Where, other techniques include various local and global search methods. Besides giving the review we also show a comparison of three hybrid PSO algorithms; hybrid differential evolution particle swarm optimization (DE-PSO), adaptive mutation particle swarm optimization (AMPSO) and hybrid genetic algorithm particle swarm optimization (GA-PSO) on a test suite of nine conventional benchmark problems.     

Portfolio optimization with linear and fixed transaction costs

We consider the problem of portfolio selection, with transaction costs and constraints on exposure to risk. Linear transaction costs, bounds on the variance of the return, and bounds on different shortfall probabilities are efficiently handled by convex optimization methods. For such problems, the globally optimal portfolio can be computed very rapidly. Portfolio optimization problems with transaction costs that include a fixed fee, or discount breakpoints, cannot be directly solved by convex optimization. We describe a relaxation method which yields an easily computable upper bound via convex optimization. We also describe a heuristic method for finding a suboptimal portfolio, which is based on solving a small number of convex optimization problems (and hence can be done efficiently). Thus, we produce a suboptimal solution, and also an upper bound on the optimal solution. Numerical experiments suggest that for practical problems the gap between the two is small, even for large problems involving hundreds of assets. The same approach can be used for related problems, such as that of tracking an index with a portfolio consisting of a small number of assets.     

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

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

VaR optimal portfolio with transaction costs

We consider the problem of portfolio optimization under VaR risk measure taking into account transaction costs. Fixed costs as well as impact costs as a nonlinear function of trading activity are incorporated in the optimal portfolio model. Thus the obtained model is a nonlinear optimization problem with nonsmooth objective function. The model is solved by an iterative method based on a smoothing VaR technique. We prove the convergence of the considered iterative procedure and demonstrate the nontrivial influence of transaction costs on the optimal portfolio weights.