Distributed subgradient method for multi‐agent optimization with quantized communication

This paper focuses on a distributed optimization problem associated with a time‐varying multi‐agent network with quantized communication, where each agent has local access to its convex objective function, and cooperatively minimizes a sum of convex objective functions of the agents over the network. Based on subgradient methods, we propose a distributed algorithm to solve this problem under the additional constraint that agents can only communicate quantized information through the network. We consider two kinds of quantizers and analyze the quantization effects on the convergence of the algorithm. Furthermore, we provide explicit error bounds on the convergence rates that highlight the dependence on the quantization levels. Finally, some simulation results on a l₁‐regression problem are presented to demonstrate the performance of the algorithm. Copyright © 2016 John Wiley & Sons, Ltd.     

Lot‐sizing policies for deterioration items under two‐level trade credit with partial trade credit to credit‐risk retailer and limited storage capacity

The main purpose of this article is to investigate the optimal wholesaler's replenishment decisions for deterioration items under two levels of the trade credit policy and two storage facilities in order to reflect the supply chain management situation within the economic order quantity framework. In this study, each of the following assumptions have been made: (1) The own warehouse with limited capacity always is not sufficient to store the order quantity, so that a rented warehouse is needed to store the excess units over the capacity of the own warehouse; (2) The wholesaler always obtains the partial trade credit, which is independent of the order quantity offered by the supplier, but the wholesaler offers the full trade credit to the retailer; (3) The wholesaler must take a loan to pay his or her supplier the partial payment immediately when the order is received and then pay off the loan with the entire revenue. Under these three conditions, the wholesaler can obtain the least costs. Furthermore, this study models the wholesaler's optimal replenishment decisions under the aforementioned conditions in the supply chain management. Two theorems are developed to efficiently determine the optimal replenishment decisions for the wholesaler. Finally, numerical examples are given to illustrate the theorems that are proven in this study, and the sensitivity analysis with respect to the major parameters in this study is performed. Copyright © 2016 John Wiley & Sons, Ltd.     

基于改进的PSO-SVM的音频信号特征识别和分类

针对音频信号准确性分类的问题,提出一种基于改进的的粒子群优化算法(PSO)的支持向量机(SVM)音频信号分类的方法,简称IPSO-SVM.首先用Mel倒谱系数法对4种音频信号进行特征提取.其次在PSO中引入自适应变异因子,能够成功地跳出局部极小值点;然后对PSO中的惯性权重进行了改进,将惯性权重由常数变为指数型递减函数.随着迭代的进行,使权重逐渐减小,这样做有利于粒子进行局部寻优.最后用改进的PSO不断优化SVM中的惩罚因子c和核函数参数g来提高预测精度.实验结果表明,与传统的SVM、PSO-SVM、GA-SVM相比,我们提出的IPSO-SVM算法分类结果更精确.     

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

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

桁架结构拓扑优化与遗传算法

用遗传算法求解桁架结构拓扑优化，结果表明是可行的。     

最优化算法的收敛准则

收敛准则是最优化算法的重要组成部分，其选择得好与坏将直接影响到算法的成功与否以及收敛得快与慢。现有常用的收敛准则基本上是建立在前后迭代点的逼近和它们相应函数值的逼近是否达到一定的精度要求以及迭代点处函数梯度是否接近于零的基础上的。它们各自有自己的适用范围。但它们的共同特点是对迭代终止点的性质不能做出判断。本文在总结和分析现有算法收敛准则的基础上，借助于正定矩阵、一维优化方法中对分法和黄金分割法，提出了新的算法收敛准则。算例结果表明，这些收敛准则是有效实用的。     

应力约束下薄板结构的拓扑优化

研究了应力约束下薄板结构的拓扑优化问题，分析了极限应力的影响，建立了拓扑优化的数学模型，讨论了若干优化过程中的技术问题，最后，进行了实例计算。     

Optimization of support positions to minimize the maximal deflection of structures

In this paper, the design sensitivity analysis for the deflection of a beam or plate structure is first investigated with respect to the position of a simple support using the discrete method. Both elastic and rigid supports are taken into account, and closed-form formulae for the deflection sensitivity are developed straightforwardly. Then, on the basis of the design sensitivity analysis, a heuristic optimization algorithm, called the evolutionary shift method, is presented for support position optimization to minimize the maximal deflection of a structure with a fixed grid mesh scheme. In each iterative loop, the support with the highest efficiency is shifted in priority. To facilitate the convergence of the process, a polynomial interpolation technique is employed to evaluate the solution more accurately. The optimal solution is achieved gradually with a minimum modification of the support layout design. Finally, three numerical examples are presented to demonstrate the validities of the sensitivity analysis and the optimization method. Results show that support optimization can improve the structural behavior significantly.     

PRELIMINARY PROBE INTO OPTIMIZATION ON PROPULSION IN SHORT DISTANCE COMPETITIVE SWIMMING

Based on the modeling of dynamics and energy conversion in competitive swimming,the optimal control theory was used to make an optimization analysis of the distance traveled in a given time.Using the records of the 27th Olympics and the results from previous research,an optimal solution of propulsion was derived using some hypotheses and constraints.Correspondingly,the optimal tactic for velocity and energy was put forward which was in agreement with the practice.     

简单柔性机械臂的构造性逆动力学方法

本文提出了适于简单柔性机械臂的一种基于谱分析的构造性逆动力学方法。数值模拟和实验结果表明，这种方法提供的开环输入力矩，不仅可以实现机械臂特定的刚体转动，而且可以有效地减弱柔性对机械臂精确定位的影响。