基于近似策略的联合优化方法

针对优化中收敛速度和优化解全局性的问题,提出了一种联合优化方法:构造原问题的近似模型,使用全局优化方法对近似函数进行优化,得到优化点作为初值,再使用局部优化方法对原问题进行优化.为了获得对原问题更好的近似,改进了径向基插值方法,以优化误差的方法来选择参数.利用临近空间机翼模型的优化对算法进行了测试,结果表明,优化参数的...     

Pricing bridges to cross a river

We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

基于仿射近似的摄像机标定

针对直接基于透视投影模型的标定算法计算量大、结果不稳定的事实,提出一种基于仿射投影矩阵的标定算法。算法首先线性解算仿射投影矩阵,然后分解出部分参数。在假定主点坐标等于图像中心的前提下,解算出其余参数,再以重投影图像点残差和为目标函数,对所有参数进行优化,获得精确的摄像机模型参数,达到精确、快速、稳定的标定目的。大量的仿真和真实图像实验证明算法比传统算法更稳定。     

关于Reich的公开问题

设E是具有一致G -可微范数的实Banach空间 ,D是E的非空闭凸子集 ,T :D→D是非扩张映象 ,F(T)非空。设 {αn} ,{ βn}是 [0 ,1]中满足一定条件的两个序列 ,定义压缩映象St:D→D为 :St(z) =(1-t)x tTz , x ,z∈D , n≥ 1,t∈ (0 ,1) .设zt 是St 的唯一不动点 ,若当t→ 1-时 ,{zt}强收敛于某点z∈F(T) .那么 ,Reich序列 {xn}强收敛于某点z∈F(T) .     

Transporting jobs through a two‐machine open shop

We consider the two‐machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Approximation algorithms for sequential batch‐testing of series systems

We introduce and study a generalization of the classic sequential testing problem, asking to identify the correct state of a given series system that consists of independent stochastic components. In this setting, costly tests are required to examine the state of individual components, which are sequentially tested until the correct system state can be uniquely identified. The goal is to propose a policy that minimizes the expected testing cost, given a‐priori probabilistic information on the stochastic nature of each individual component. Unlike the classic setting, where variables are tested one after the other, we allow multiple tests to be conducted simultaneously, at the expense of incurring an additional set‐up cost. The main contribution of this article consists in showing that the batch testing problem can be approximated in polynomial time within factor , for any fixed . In addition, we explain how, in spite of its highly nonlinear objective function, the batch testing problem can be formulated as an approximate integer program of polynomial size, while blowing up its expected cost by a factor of at most . Finally, we conduct extensive computational experiments, to demonstrate the practical effectiveness of these algorithms as well as to evaluate their limitations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 275–286, 2016     

双绝热近似下磁流体力学线性稳定性原理

本文得出了双绝热近似的磁流体力学能量积分关系式。分析表明这种磁流体力学系统是保守的,可以采用运动方程或能量原理方法分析系统的稳定性特性。本文从控制方程组出发讨论了线性稳定性的基本原理,指出纵向压力增值有助于系统的稳定性。     

The open shop scheduling problem with a given sequence of jobs on one machine

The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998     

基于Hankel范数近似的磁悬浮控制系统模型降阶

对于磁悬浮系统而言,忽略轨道的弹性进行控制算法设计,是一种常见的方法。但是,当轨道的刚度较小时,这种方法的控制性能较差。考虑轨道弹性所设计的控制算法,理论上能确保系统的良好性能但是会使得系统复杂度增加。本文采用Hankel范数近似法对基于弹性轨道的模型进行降阶。针对刚性轨道系统模型和降阶模型设计控制算法,利用仿真结果验证降阶模型的可行性。