Algorithms for Finite and Semi-Infinite Min–Max–Min Problems Using Adaptive Smoothing Techniques

We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples.     

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {s_i,t_i} of G, find a minimum set of edges of G whose removal disconnects each s_i from the corresponding t_i. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.     

A Hybrid Approach to Scheduling with Earliness and Tardiness Costs

A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time.     

A class of polynomial variable metric algorithms for linear optimization

In the paper, the behaviour of interior point algorithms is analyzed by using a variable metric method approach. A class of polynomial variable metric algorithms is given achieving O ((n/β)L) iterations for solving a canonical form linear optimization problem with respect to a wide class of Riemannian metrics, wheren is the number of dimensions and β a fixed value. It is shown that the vector fields of several interior point algorithms for linear optimization is the negative Riemannian gradient vector field of a linear a potential or a logarithmic barrier function for suitable Riemannian metrics. Research Partially supported by the Hungarian National Research Foundation, Grant Nos. OTKA-T016413 and OTKA-2116.     

Ring resonators with N × M couplers

Multiple-zero multiple-pole optical filter transfer functions may be implemented more efficiently in an integrated optics architecture if higher order N × M optical couplers are utilized. For example, a coherent ring resonator made from two 3×3 couplers offers some advantages over the three mirror Fabry-Perot etalon, which is its analog. To this end we develop the formalism for obtaining the transfer functions and scattering matrices of ring resonators made from two N × M couplers. We then present a methodology for analyzing serial and parallel systems of N × M optical coupler ring resonators.     

第二讲合成孔径声纳成像及其研究进展

文章在介绍了图像声纳的特点、合成孔径声纳（synthetic aperture sonar,SAS）产生背景和发展过程的基础上,对合成孔径声纳的原理、技术难点、成像算法等问题进行了讨论.着重分析了合成孔径声纳成像过程中高分辨率的获取方法、水声信道对成像的影响、多子阵技术及其成像算法、稳定的声纳运动平台和运动监测问题、运动补偿与自聚焦方法等.文章还给出了国内外合成孔径声纳研究的最新进展情况,进而展望了合成孔径声纳的应用前景.     

Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment

We present an overview of the author’s Ph.D. thesis, supervised by P. Dejax and N. Bostel, which was defended in February 2006 at école des Mines de Nantes, France. The thesis is written in French, and is available at . It was conducted in the context of a research contract with a water distribution company. In a first section, we define multiperiod routing problems for service technicians. In a second section, we present some heuristics and a memetic algorithm used to solve these problems. The third section introduces optimal and near-optimal approaches based on column generation. Finally, we present some applications to the real-life case. The methods presented in Sects. 2, 3 and 4 were tested over several sets of problems, based on real-life statistics provided by the company.      

A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem

In this paper we address a two-dimensional (2D) orthogonal packing problem, where a fixed set of small rectangles has to be placed on a larger stock rectangle in such a way that the amount of trim loss is minimized. The algorithm we propose hybridizes a placement procedure with a genetic algorithm based on random keys. The approach is tested on a set of instances taken from the literature and compared with other approaches. The computation results validate the quality of the solutions and the effectiveness of the proposed algorithm.     

光盘阵列系统的一种性能优化方法

提出了一种用低性能驱动器组建高性能光盘阵列系统性能的优化方法。针对传统的低性能光盘驱动器(驱动器内部数据传输率及接口速率均较低),提出了一种新型的数据传输模式。采用此优化方法可以使光盘阵列系统的整体性能得到较大地提高。同时还可以提高系统整体的性价比。     

线性二次型最优控制的并行算法和软件

构造了线性二次型最优控制的并行算法，介绍了这个并行算法在武汉大学“ＷＵＤＰ９１”并行分布式处理系统上试算的数值应用软件的框图．本软件适用于既定动态系统的平衡问题．对于经济系统，可通过政策控制变量来调节和改善其状态和响应．对于自治系统可找出最优控制使得消耗函数达到最小值．通过对一系列例子进行试算，结果证实，所构造的并行算法和相应的数值软件是有效的，其加速比约为７．