应用Matlab优化工具箱求解可靠度问题

根据可靠度指标的几何意义，将求解可靠度指标问题转化为求极小值的优化问题，利用Matlab优化工具箱求解，介绍了Matlab优化工具箱的使用，结合几个算例，计算了其可靠度指标，并与JC法进行了比较。     

Matlab智能算法工具箱在数据处理方面的应用

Matlab凭借其出众的计算能力和丰富成熟的工具箱在研究领域被广泛使用.随着大数据时代待解决问题复杂性增加,智能优化方法广泛应用到数据处理中.介绍了几种智能算法以及Matlab内置的相应工具箱,并结合大数据时代数据处理所面临的问题阐述了群体智能算法的优越性.     

基于Matlab遗传算法工具箱的函数优化问题求解

介绍了遗传算法的基本原理和求解流程,详细阐述了Matlab遗传算法工具箱的使用方法,并通过使用遗传算法工具箱对一个典型的函数优化问题进行求解,验证了该工具箱在解决函数优化问题上的有效性和实用性     

数字滤波器的Matlab设计与应用

数字滤波在数字信号处理中占有极其重要的地位,并且被广泛应用。研究了在Matlab环境下FIR数字滤波器的设计方法以及FIR滤波器在信号去噪方面的应用。Matlab因其强大的数据处理功能被广泛应用于工程计算,其丰富的工具箱为工程计算提供了便利,利用Matlab信号处理工具箱可以快速有效地设计各种数字滤波器,设计简单方便。     

遗传算法求解函数优化问题的Matlab实现

本文介绍了遗传算法的基本原理,并重点分析了Matlab遗传算法工具箱的使用方法。在此基础上,给出了一个函数优化问题的实例,以验证Matlab遗传算法工具箱在解决基于遗传算法的函数优化问题上的有效性和实用性。     

Matlab/Runtime Server工具箱在工程中的应用研究

作为一种高性能的用于工程计算的编程软件,Matlab具有强大的数值计算、图形处理、算法开发等功能,但是具有这些功能的应用程序只能在Matlab环境中使用,代码执行速度慢。该文系统地分析了用Matlab／Runtime Server工具箱进行Matlab应用程序独立发布技术的特点,并重点阐述了利用该工具箱如何实现对Matlab应用程序的独立发布,最后的工程应用实例讨论了具体实现过程,从而拓宽了Matlab在科学研究和工程技术中的应用领域。     

利用Excel Link实现Malab与Excel在金融分析领域的结合应用

讨论了使用Excel Link插件链接Matlab与Excel的方法。利用这种方法，可以保证两个工作环境中数据的交换和同步更新。在实际应用中，配合Matlab的Financial工具箱，可简便迅速地进行金融分析领域的风险计算，回报率计算和最佳投资方案分析等工作。     

Matlab遗传算法工具箱在约束非线性惩罚函数中的应用

以遗传算法原理和方法为基础,简要介绍其工具箱在Matlab中的两种调用方式。在惩罚函数的基础上应用遗传算法工具箱解决约束非线性规划问题。比较最佳适应度及最佳个体与传统数值计算方法的误差,得出遗传算法在该类问题上可以跳出局部最优解,且收敛速度快,编写方式灵活的结论。为工程领域的推广及普及应用提供参考依据。     

基于MATLAB遗传算法优化工具箱的优化计算

采用Matlab语言编制的遗传算法工具箱（GAOT）可实现二进制编码和真值编码的模拟进化计算，此工具箱在遗传操作方面非常灵活。介绍了用遗传算法工具箱解决了连续优化问题和旅行商问题，并给出了两个实例。     

基于Matlab的IIR数字滤波器的设计

数字滤波器可靠性与精确度高,使用简单方便,与模拟设备相比具有许多其所没有的诸多优点,已经被泛地应用于各个科学技术领域。Matlab具有强大的数据处理功能,丰富的工具箱为工程计算提供的极大的方便,也已被广泛地应用于工程计算中。该文基于Matlab提出了IIR滤波器的设计方案与相关应用。     

Formulation and parameter selection of multi-objective deterministic particle swarm for simulation-based optimization

Global derivative-free deterministic algorithms are particularly suitable for simulation-based optimization, where often the existence of multiple local optima cannot be excluded a priori, the derivatives of the objective functions are not available, and the evaluation of the objectives is computationally expensive, thus a statistical analysis of the optimization outcomes is not practicable. Among these algorithms, particle swarm optimization (PSO) is advantageous for the ease of implementation and the capability of providing good approximate solutions to the optimization problem at a reasonable computational cost. PSO has been introduced for single-objective problems and several extension to multi-objective optimization are available in the literature. The objective of the present work is the systematic assessment and selection of the most promising formulation and setup parameters of multi-objective deterministic particle swarm optimization (MODPSO) for simulation-based problems. A comparative study of six formulations (varying the definition of cognitive and social attractors) and three setting parameters (number of particles, initialization method, and coefficient set) is performed using 66 analytical test problems. The number of objective functions range from two to three and the number of variables from two to eight, as often encountered in simulation-based engineering problems. The desired Pareto fronts are convex, concave, continuous, and discontinuous. A full-factorial combination of formulations and parameters is investigated, leading to more than 60,000 optimization runs, and assessed by three performance metrics. The most promising MODPSO formulation/parameter is identified and applied to the hull-form optimization of a high-speed catamaran in realistic ocean conditions. Its performance is finally compared with four stochastic algorithms, namely three versions of multi-objective PSO and the genetic algorithm NSGA-II.     

Real-time dynamic optimization of batch systems

In this paper a methodology for designing and implementing a real-time optimizing controller for batch processes is proposed. The controller is used to optimize a user-defined cost function subject to a parameterization of the input trajectories, a nominal model of the process and general state and input constraints. An interior point method with penalty function is used to incorporate constraints into a modified cost functional, and a Lyapunov based extremum seeking approach is used to compute the trajectory parameters. The technique is applicable to general nonlinear systems. A precise statement of the numerical implementation of the optimization routine is provided. It is shown how one can take into account the effect of sampling and discretization of the parameter update law in practical situations. A simulation example demonstrates the applicability of the technique.     

Multiobjective optimization of trusses using genetic algorithms

In this paper we propose the use of the genetic algorithm (GA) as a tool to solve multiobjective optimization problems in structures. Using the concept of min–max optimum, a new GA-based multiobjective optimization technique is proposed and two truss design problems are solved using it. The results produced by this new approach are compared to those produced by other mathematical programming techniques and GA-based approaches, proving that this technique generates better trade-offs and that the genetic algorithm can be used as a reliable numerical optimization tool.     

An integrated approach to topology,sizing, and shape optimization

Topology optimization has become very popular in industrial applications, and most FEM codes have implemented certain capabilities of topology optimization. However, most codes do not allow simultaneous treatment of sizing and shape optimization during the topology optimization phase. This poses a limitation on the design space and therefore prevents finding possible better designs since the interaction of sizing and shape variables with topology modification is excluded. In this paper, an integrated approach is developed to provide the user with the freedom of combining sizing, shape, and topology optimization in a single process.     

Effects of dominant wolves in grey wolf optimization algorithm

Bio-inspired computation is one of the emerging soft computing techniques of the past decade. Although they do not guarantee optimality, the underlying reasons that make such algorithms become popular are indeed simplicity in implementation and being open to various improvements. Grey Wolf Optimizer (GWO), which derives inspiration from the hierarchical order and hunting behaviours of grey wolves in nature, is one of the new generation bio-inspired metaheuristics. GWO is first introduced to solve global optimization and mechanical design problems. Next, it has been applied to a variety of problems. As reported in numerous publications, GWO is shown to be a promising algorithm, however, the effects of characteristic mechanisms of GWO on solution quality has not been sufficiently discussed in the related literature. Accordingly, the present study analyses the effects of dominant wolves, which clearly have crucial effects on search capability of GWO and introduces new extensions, which are based on the variations of dominant wolves. In the first extension, three dominant wolves in GWO are evaluated first. Thus, an implicit local search without an additional computational cost is conducted at the beginning of each iteration. Only after repositioning of wolf council of higher-ranks, the rest of the pack is allowed to reposition. Secondarily, dominant wolves are exposed to learning curves so that the hierarchy amongst the leading wolves is established throughout generations. In the final modification, the procedures of the previous extensions are adopted simultaneously. The performances of all developed algorithms are tested on both constrained and unconstrained optimization problems including combinatorial problems such as uncapacitated facility location problem and 0-1 knapsack problem, which have numerous possible real-life applications. The proposed modifications are compared to the standard GWO, some other metaheuristic algorithms taken from the literature and Particle Swarm Optimization, which can be considered as a fundamental algorithm commonly employed in comparative studies. Finally, proposed algorithms are implemented on real-life cases of which the data are taken from the related publications. Statistically verified results point out significant improvements achieved by proposed modifications. In this regard, the results of the present study demonstrate that the dominant wolves have crucial effects on the performance of GWO.     

多元插值全局优化算法及其应用

本文介绍一种多元插值逼近和动态搜索轨迹相结合的全局优化算法.该算法大大减少了目标函数计算次数,寻优收敛速度快,算法稳定,且可获得全局极小,有效地解决了大规模非线性复杂动态系统的参数优化问题.一个具有8个控制参数的电力系统优化控制问题,采用该算法仅访问目标函数78次,便可求得最优控制器参数。     

云搜索优化算法

本文将云的生成、动态运动、降雨和再生成等自然现象与智能优化算法的思想融合,建立了一种新的智能优化算法-云搜索优化算法(CSO)。生成与移动的云可以弥漫于整个搜索空间,这使得新算法具有较强的全局搜索能力;收缩与扩张的云团在形态上会有千奇百态的变化,这使得算法具有较强的局部搜索能力;降雨后产生新的云团可以保持云团的多样性,这也是使搜索避免陷入局优的有效手段。实验表明,基于这三点建立的新算法具有优异的性能,benchmark函数最优值的计算结果以及与已有智能优化算法的比较展现了新算法精确的、稳定的全局求解能力。     

Value Creation in a Network: The Role of Pricing and Revenue Optimization and Enterprise Profit OptimizationTM

The Internet has created a virtual upheaval in the structural features of the supply and demand chains for most businesses. New agents and marketplaces have surfaced. The potential to create value and enhance profitable opportunities has attracted both buyers and sellers to the Internet. Yet, the Internet has proven to be more complex than originally thought. With information comes complexity: the more the information in real time, the greater the difficulty in interpretation and absorption. How can the value-creating potential of the Internet still be realized, its complexity notwithstanding? This paper argues that with the emergence of innovative tools, the expectations of the Internet as a medium for enhanced profit opportunities can still be realized. Creating value on a continuing basis is central to sustaining profitable opportunities. This paper provides an overview of the value creation process in electronic networks, the emergence of the Internet as a viable business communication and collaboration medium, the proclamation by many that the future of the Internet resides in “embedded intelligence”, and the perspectives of pragmatists who point out the other facet of the Internet—its complexity. The paper then reviews some recent new tools that have emerged to address this complexity. In particular, the promise of Pricing and Revenue Optimization (PRO) and Enterprise Profit Optimization^TM (EPO) tools is discussed. The paper suggests that as buyers and sellers adopt EPO, the market will see the emergence of a truly intelligent network—a virtual network—of private and semi-public profitable communities.     

粒子群算法在组合优化问题上的研究与发展

粒子群优化算法是一种新兴的基于群智能搜索的优化技术。该算法简单、易实现、参数少,具有较强的全局优化能力,可有效应用于科学与工程实践中。介绍了算法的基本原理和算法在组合优化上一些改进方法的主要应用形式。最后,对粒子群算法作了一些深入分析并在此基础上对粒子群算法应用于组合优化问题做了一些总结。     

SEO技术研究

为了利用搜索引擎优化SEO（Search Engine Optimization）技术给网站带来高质量的流量并将其转化为商业利益,理解搜索引擎的算法和排名原理十分必要。通过对网站的结构优化、关键词优化、单页优化、防止被搜索引擎惩罚和挽救被惩罚网站等技术的研究,达到提高网站排名,实现网站的价值目的。