面向靠桥率及道口冲突率的航班-机位指派问题优化模型及其启发式算法研究

在给定航班时刻表条件下,对于进出港航班的机位分配,除了必须满足航班、飞机和机位之间的技术性要求之外,还要考虑尽量提高整个机场的机位利用率,且方便旅客出入港及时、安全和便捷.文章以飞机机型、所属航空公司、客运/货运航班、国内/国际航班等匹配条件为约束条件,以航班-机位分配完成率、靠桥率、道口非冲突率为目标,建立了一个航班...     

STUDY ON THE SEQUENCE STRUCTURE OF SBR BY 13C—NMR METHOD Ⅰ. ASSIGNMENT FOR UNSATURAT CARBONS SPECTRA*

The sequence structures of emulsion-processed SBR and solution-processed (by lithium catalyst) SBR were investigated by ~(13)C-NMR spectroscopy. Seventeen peaks within unsaturated carbon region were recorded under the adopted experimental conditions. Assignments for these peaks were made by empirical-parameter-evaluation method.     

Short-wave near-infrared spectroscopy analysis of major compounds in milk powder and wavelength assignment

In this study, short-wave near-infrared (NIR) spectroscopy at 800–1050 nm region was investigated for the analysis of main compounds in milk powder. Through quantitative analysis, the feasibility is further demonstrated for the simultaneous measurement of fat, proteins and carbohydrate in milk powder. Two models, partial least-squares and least-squares support vector machine, were compared and utilized for regression coefficients and loading weights. The affect of standard normal variate spectral pretreatment to model performance was evaluated. Based on the resulted coefficients and loading weights, interesting wavelength regions of nutrition in milk powder are screened and the assignment of all specific wavelengths is firstly proposed in the details associated with chemical base. Instead of the whole short-wave NIR spectral data, these assigned wavelengths which can be reliably exploited were used for the content determination. Compared with other spectroscopy technique, assigned short-wave NIR spectral wavelengths did a good work. Determination coefficients for prediction are 0.981, 0.984, and 0.982, respectively for three components. The proposed wavelength assignment in the short-wave NIR region could be used for the component contents determination of milk powder, and could be as a guidance to interpret the spectra of milk powder.     

DATA PREORDERING IN GENERALIZED PAV ALGORITHM FOR MONOTONIC REGRESSION

Monotonic regression （MR） is a least distance problem with monotonicity constraints induced by a partiaily ordered data set of observations. In our recent publication [In Ser. Nonconvex Optimization and Its Applications, Springer-Verlag, （2006） 83, pp. 25-33], the Pool-Adjazent-Violators algorithm （PAV） was generalized from completely to partially ordered data sets （posets）. The new algorithm, called CPAV, is characterized by the very low computational complexity, which is of second order in the number of observations. It treats the observations in a consecutive order, and it can follow any arbitrarily chosen topological order of the poset of observations. The CPAV algorithm produces a sufficiently accurate solution to the MR problem, but the accuracy depends on the chosen topological order. Here we prove that there exists a topological order for which the resulted CPAV solution is optimal. Furthermore, we present results of extensive numerical experiments, from which we draw conclusions about the most and the least preferable topological orders.     

随机交通均衡配流模型及其等价的变分不等式问题

本文讨论了交通网络系统的随机用户均衡原理的数学表述问题.在路段出行成本是流量的单调函数的较弱条件下,对具有固定需求和弹性需求的模式,首次证明了随机均衡配流模型可表示为一个变分不等式问题,同时也说明了该变分不等式问题与相应的互补问题以及一个凸规划问题之间的等价关系.     

非平衡指派模型及其在航空机务维修中的应用

非平衡指派问题是最优平衡指派问题的推广与深化,在航空机务维修工作中,维修任务的合理配置对及时完成维修任务,保障训练作战计划非常重要.本文从装备完好率和人力资源的优化配置角度出发,按照不考虑维修任务等待时间和考虑维修任务等待时间两种情况分别建立了非平衡指派优化模型,并给出了这两种情况下效益矩阵的构造方法,进而将优化模型转化为最优平衡指派模型进行求解,从而为航空机务维修工作中维修人员的优化配置提供了一种科学、合理的决策方法.     

A Petrov-Galerkin method for equal width equation

The equal width equation is solved numerically by Petrov-Galerkin method using linear hat function and quadratic B-spline function as trial and test functions respectively. Product approximation has been used in this method. A linear stability analysis of the scheme is shown to be conditionally stable. Test problems including the single soliton and the interaction of solitons are used to validate the suggested method, which is found to be accurate and efficient. The Maxwellian initial condition pulse and the development of an undular bore are also studied.     

VIBRATIONAL SPECTRA AND NORMAL COORDINATE ANALYSIS OF 1,2-BIS(2-FORMYLGLYCINEBENZENESULFENYL) ETHANE Pd(II) DICHLORIDE COMPLEX

The normal coordinate analysis of the title complex, 1,2-bis(2-formylglycinebenzenesulfenyl) ethane Pd(II) dichloride has been carried out by using the Urey-Bradley force field. According to the molecular structure determined by x-ray crystallographic analysis, 182 internal coordinates were established and 112 theoretical vibration frequencies agree well with the observed values with the average difference of 2.53 cm^?1 and the maximum deviation of 16.0 cm^?1.     

Inverse optimization for linearly constrained convex separable programming problems

In this paper, we study inverse optimization for linearly constrained convex separable programming problems that have wide applications in industrial and managerial areas. For a given feasible point of a convex separable program, the inverse optimization is to determine whether the feasible point can be made optimal by adjusting the parameter values in the problem, and when the answer is positive, find the parameter values that have the smallest adjustments. A sufficient and necessary condition is given for a feasible point to be able to become optimal by adjusting parameter values. Inverse optimization formulations are presented with ℓ₁ and ℓ₂ norms. These inverse optimization problems are either linear programming when ℓ₁ norm is used in the formulation, or convex quadratic separable programming when ℓ₂ norm is used.     

Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

We study bicriteria problems of minimizing maximum tardiness and total due date assignment cost in various scheduling environments. We assume that each job can be assigned a different due date without any restriction, and that each due date assignment cost is a non-decreasing function of the quoted due date. We settle the complexity of most of the problems studied by either proving that they are NP-hard or finding a polynomial time solution for them. We also include approximation and non-approximability results for several parallel-machine problems.