A Tabu-Search Hyperheuristic for Timetabling and Rostering

Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. The main motivation behind the development of such approaches is the goal of developing automated scheduling methods which are not restricted to one problem. In this paper we report the investigation of a hyperheuristic approach and evaluate it on various instances of two distinct timetabling and rostering problems. In the framework of our hyperheuristic approach, heuristics compete using rules based on the principles of reinforcement learning. A tabu list of heuristics is also maintained which prevents certain heuristics from being chosen at certain times during the search. We demonstrate that this tabu-search hyperheuristic is an easily re-usable method which can produce solutions of at least acceptable quality across a variety of problems and instances. In effect the proposed method is capable of producing solutions that are competitive with those obtained using state-of-the-art problem-specific techniques for the problems studied here, but is fundamentally more general than those techniques.     

On Solvability of Functional Equations Relating to Dynamical Systems with Two Generators

In this paper, some solvability problems for functional equations of the form

Clifford分析中的多周期和准多周期Riemann边值问题

本文考虑了R^n 1空间中椭圆函数和准椭圆函数的一些性质，然后分别讨论了周期和准周期Riemann边值问题，给出了解的表达式和可解条件。     

平面动力问题的理论求解

通过对平面动力问题控制方程的分析,研究了相应的应力函数，得出了关于应力函数的基本方程。     

具有非线性扰动的中立型系统的时滞相关稳定性

本研究了具有非线性扰动的中立型系统鲁棒稳定的时滞相关准则。基于LMI方法，并利用S—过程获得了依赖于时滞的鲁棒稳定性准则，所得结果优于已有结论。最后给出一个实例说明本方法的有效性。     

紧急输送策略的线性规划模型

以美国南弗洛里达州递避飓风袭击为例建立了紧急输送情况下的线性规划模型。其中具体建立了以SCEPD(美国南弗洛里达州紧急情况预防部门)提出的公路反向，地区分块撤离，使用小路等三个最受人们关注的策略的模型。模型的灵敏度分析能很好地解释建立更多的临时避难所、限制车辆等策略对撤离的影响。在相近的环境下，中模型解得的结果很接近官方预测的结果，并且本的模型能对更广泛的情况进行分析．可给SCEPD提供一定参考。     

Boltzmann-Poisson方程组初边值问题的整体弱解

§ 1.　Introduction　　LetΩ R3beasmoothboundedopenset,f(t,x ,v)bethedistributionfunctionofcar riersattimet >0 ,positionvectorx∈Ωandvelocityvectorv∈R3.Theforcefieldactingonthecarriersisdenotedbythe3 dimensionalvectorfunctionE(t,x) ,thepotentialcorespondingtoE(t,x)isdenotedbyu(t,x) ,then (f,E)satisfythefollowingBoltzmann Poissonsystem tf +v· xf +E· vf =Q(f) ,　 (t,x ,v)∈R+ ×Ω×R3,(1 .1 )E =- xu ,-Δxu =ρ ,　 (t,x) ∈R+ ×Ω ,(1 .2 )whereρ(t,x) =∫R3 f(t,x ,v)dvisthecarriernum…     

New Relaxation Method for Mathematical Programs with Complementarity Constraints

In this paper, we present a new relaxation method for mathematical programs with complementarity constraints. Based on the fact that a variational inequality problem defined on a simplex can be represented by a finite number of inequalities, we use an expansive simplex instead of the nonnegative orthant involved in the complementarity constraints. We then remove some inequalities and obtain a standard nonlinear program. We show that the linear independence constraint qualification or the Mangasarian–Fromovitz constraint qualification holds for the relaxed problem under some mild conditions. We consider also a limiting behavior of the relaxed problem. We prove that any accumulation point of stationary points of the relaxed problems is a weakly stationary point of the original problem and that, if the function involved in the complementarity constraints does not vanish at this point, it is C-stationary. We obtain also some sufficient conditions of B-stationarity for a feasible point of the original problem. In particular, some conditions described by the eigenvalues of the Hessian matrices of the Lagrangian functions of the relaxed problems are new and can be verified easily. Our limited numerical experience indicates that the proposed approach is promising.     

The Cauchy Problem for the System of Maxwell Equations

We consider the problem of analytic continuation of a solution to the system of Maxwell equations in a bounded spatial domain from data on part of the boundary of the domain. We construct an approximate solution to the problem using the Carleman matrix method.     

On the Application of the Auxiliary Problem Principle

The auxiliary problem principle (APP) derives from a general theory on decomposition-coordination methods establishing a comprehensive framework for both one-level and two-level methods. In this paper, the results of the two-level methods of APP are specialized for an efficient application to some engineering problems.