基于模拟退火与Dijkstra算法的复杂网状结构供应链最优化研究

复杂网状结构供应链费用最优化已成为研究的热点问题.基于模拟退火与Dijkstra算法对复杂网状结构供应链费用的优化问题进行了研究.把全国的城市分布作为复杂网状结构,以城市间的距离和建立供应点的费用作为参数,建立数学模型,并进行数值仿真,分别以全1序列、〖JP5〗全0序列、随机序列为初始值的选取方式进行模拟,从中确定了最优解,并给出了最优供应链网络.     

基于时间可控和随机损失的生鲜农产品供应链协调

生鲜农产品不仅是易腐的,其寿命还具有随机性,在订货和由产地运往远方销地的过程中,面临随机供给与需求的匹配、变质损失与物流成本的平衡这两重难题。基于现代物流条件下物流时间的可控性,分别建立了分散控制和集中控制供应链的决策模型,分析得到了它们的最优订货量和最优物流时间。在此基础上,设计了一组联合契约,推导出了实现生鲜农产品供应链协调时契约参数取值范围的计算公式。研究结果表明:通过选择合理的契约参数φ,联合契约能够完美协调生鲜农产品供应链、实现供需双方帕累托最优。进一步,对变质率参数和需求价格弹性系数进行了敏感性分析,为生鲜农产品供应链实践提供了一些管理启示。     

一种热集成系统的动态多智能体微分进化算法

针对热集成系统换热网络存在的严重非凸非线性与多维多极值问题,提出动态多智能体微分进化算法.结合动态更新策略,并引入多智能体算法的环境感知能力,改进微分进化算法的种群生成方式与变异机制,并增强在大规模复杂非线性系统中的全局搜索能力.通过10SP2与9SP1换热网络经典算例优化,得到最佳年综合费用,体现出了改进算法更优的全局搜索能力.     

支持向量顺序回归机的统计学习基础

对处理顺序回归问题的支持向量顺序回归机的统计学习理论基础进行研究.
首先, 利用结构风险最小化原则推导出一种顺序回归机,
称之为结构风险最小化顺序回归机, 其次,
证明了结构风险最小化顺序回归机与支持向量顺序回归机解之间的关系.
进一步从统计学习的角度证明了支持向量顺序回归机是结构风险最小化原则的一种直接实现,
并给出了惩罚参数C的含义.     

关于试验设计的效率及有关问题

效率是试验设计的根本出发点和追求目标,但实际上它是一个抽象和模糊的概念,容易误解和产生偏颇,至今还很少有文献对它专门进行过很好的阐述和研究。常见的各种试验设计方法所追求的效率一般都是单一地在某种数学模型及相应的数学准则下要求实现最优而已。本文将探讨试验设计的基本原理,解释和研究到底什么是试验设计的效率?应该怎样来追求试验设计的效率?并指出现有试验设计学科的一些不足和问题,提出一个改进的试验设计框架和学说。     

模糊需求下订购批量问题的研究

库存管理模型在现实生活中有着广泛的运用,它为管理决策者有效地确定最佳订购批量提供帮助.然而,由于历史数据的缺乏,需求量在很多情况下往往被主观地确定,因而带有一定的模糊性.本文针对两种不同类型的模糊需求:离散型与连续型,运用模糊理论分别建立了相应的模糊库存模型.该模型不同于已有的模糊库存模型如下:在现有的模糊库存的文献中,大多采用的是利用模糊集的知识对确定EOQ模型加以研究,而本文从模糊理论的角度对报童问题进行研究.     

A NEW STEPSIZE FOR THE STEEPEST DESCENT METHOD

The steepest descent method is the simplest gradient method for optimization. It is well known that exact line searches along each steepest descent direction may converge very slowly. An important result was given by Barzilar and Borwein, which is proved to be superlinearly convergent for convex quadratic in two dimensional space, and performs quite well for high dimensional problems. The BB method is not monotone, thus it is not easy to be generalized for general nonlinear functions unless certain non-monotone techniques being applied. Therefore, it is very desirable to find stepsize formulae which enable fast convergence and possess the monotone property. Such a stepsize αk for the steepest descent method is suggested in this paper. An algorithm with this new stepsize in even iterations and exact line search in odd iterations is proposed. Numerical results are presented, which confirm that the new method can find the exact solution within 3 iteration for two dimensional problems. The new method is very efficient for small scale problems. A modified version of the new method is also presented, where the new technique for selecting the stepsize is used after every two exact line searches. The modified algorithm is comparable to the Barzilar-Borwein method for large scale problems and better for small scale problems.     

基于相位特征的异源图像匹配算法

提出了一种基于相位特征及金字塔算法的图像匹配方法,提高了对异源图像的匹配性能及算法处理速度.首先,对图像进行金字塔运算,由顶层匹配至底层匹配进行基于不同尺度的图像相位特征处理.处理的具体流程为:在图像中选取感兴趣区域,然后遍历该区域上每个像素点提取的图像块,与对应的异源图像进行FM相位特征匹配;然后,在感兴趣区域中获取...     

TOPOLOGY SYNTHESIS OF GEOMETRICALLY NONLINEAR COMPLIANT MECHANISMS USING MESHLESS METHODS

This paper presents a new method for topology optimization of geometrical nonlinear compliant mechanisms using the element-free Galerkin method （EFGM）. The EFGM is employed as an alternative scheme to numerically solve the state equations by fully taking advantage of its capability in dealing with large displacement problems. In the meshless method, the imposition of essential boundary conditions is also addressed. The popularly studied solid isotropic material with the penalization （SIMP） scheme is used to represent the nonlinear dependence between material properties and regularized discrete densities. The output displacement is regarded as the objective function and the adjoint method is applied to finding the sensitivity of the design functions. As a result, the optimization of compliant mechanisms is mathematically established as a nonlinear programming problem, to which the method of moving asymptotes （MMA） belonging to the sequential convex programming can be applied. The availability of the present method is finally demonstrated with several widely investigated numerical examples.     

一类基于Wolfe线搜索下的谱共轭梯度法

在已有文献β■的基础上得到了一个新的谱共轭参数,从而构造了一个新的谱共轭梯度法.并且新方法的搜索方向不需要任何线性搜索条件而自动下降.利用标准Wolfe线搜索,在一般假设条件下,验证了该方法是全局收敛的.