110警车配置及巡逻方案

针对110警车调度问题,引入了图论中的最短路算法以及计算几何的相关理论,建立了车辆调配模型、巡逻路线模型以及基于模糊数学的评价指标模型.另外,用C++编写了一个可视化的软件,不仅实现了手动描点,自动求出覆盖线段集合的功能,同时利用计算机模拟警车的巡逻路线,最后通过计算机检验得到结果,其合理性和实用性都令人满意.针对问题一,通过人机结合,配置17辆警车就能实现D1的目标,很好地兼顾了警车巡逻的运行成本,减少公安部门车辆和人员等的投入.针对问题二,采用模糊数学相关理论使评价指标实现了从定性到定量的转变.针对问题三和六,在D1的基础上,兼顾了巡逻效果的显著性,采用最少被巡逻道路优先的贪心算法建立了动态巡逻模型,得到了合理的巡逻方案.在此方案中,我们动用了30辆警车完成了问题一的目标.另外还额外考虑了案发事件概率不均匀分布的情况,建立了改进模型.针对问题四,在完成问题三指标的基础上,为了尽可能提高巡逻车辆的隐蔽性和增强巡逻效果,采用轮盘赌算法来引入随机性.针对问题五,采用最远距离道路优先贪心策略,使模型尽可能满足条件D1,D2.针对问题七,提出了一些额外因素及其解决方案,进一步完善了模型,使模型更贴近现实.     

基于时间切片叠加的警车巡逻路线规划

在城市中,有效的安排警车巡逻对于降低犯罪率,预防潜在犯罪案件发生和及时处理案件具有十分重要的意义.通过一些必要简化首先确定了巡逻方案应当满足的条件以及方案的评价体系.通过随机贪心算法求解足够多的可行静态解,并引入时间片叠加的思想在静态解的基础上应用深度优先搜索算法,将求解动态巡逻问题转化为在有向连通图中寻找使目标函数达到最大的约束环路的问题,最终求得动态巡逻方案.最后,通过实例对模型进行了验证和评价.     

警车配置及巡逻方案研究

以警车的配置与巡逻方案为研究对象,建立了一套警车巡逻模型,并提出巡逻效果显著度及隐藏性的评价标准,分别针对警车初始位置配置与巡逻方案的制定,提出警车配置优化选址的贪婪算法与基于多Agent的警车巡逻方案设计方法,给出了不同情景下的配置及巡逻方案:①在只考虑警车选址配置的情况下,配置19辆警车可以使全市路网警车覆盖率达到92.8%;②在顾及巡逻效果显著性与隐藏性的情况下,配置25辆警车使全市路网在整个巡逻过程中平均警车覆盖率达到90.9%;③在配置10辆警车的情况下,使得全市路网在整个巡逻过程中平均警车覆盖率达到61.5%.     

带损伤弹性反问题的数值分析

考虑一类由椭圆性方程和热传导方程共同来刻画的准静态弹性模型,通过给定观测值来反演边界的牵引力.首先构造一个凸目标泛函,并引入Tikhonov正则化方法,使之极小化得到一个稳定的近似解.再用有限元离散求解,导出误差估计.最后,用数值例子说明算法的可行性和有效性.     

一种求解化工动态优化问题的改进磷虾觅食优化算法

智能算法原理简单、容易实现,且具有良好的全局收敛能力,近年来被广泛应用于化工过程的动态优化问题.提出一种改进的磷虾觅食优化算法求解化工动态优化问题.该算法通过跟踪磷虾种群的变化来更新速度因子,提高收敛速度;引入自适应柯西变异,增强了算法跳出局部最优值的能力.针对化工动态优化问题,首先通过控制向量参数化方法将其转化为非线性规划问题,并引入变时间区间分布法来优化区间划分,然后利用改进算法进行求解.最后,将改进算法应用于多个化工动态优化问题中,仿真结果表明,该算法具有良好的可行性.     

考虑供应链影响时基于粗糙集方法的企业信贷风险评估

对于考虑供应链时的企业信贷风险评估问题,提出基于粗糙集的解决办法.首先,根据样本数据建立决策信息表;然后采用等间距法对决策信息表的连续属性值进行离散化,并且应用辨识矩阵求出最小约简;最后,应用启发式值约简算法求出决策规则.试验计算结果表明,所提出的方法对企业的信贷等级能够进行有效的预测.     

一种生产型虚拟企业制造合作伙伴选择方法

作者主要针对不完全信息下的生产型虚拟企业合作选择问题进行了深入研究,通过分析生产型虚拟企业的特点,构建了基于竞争力的合作伙伴评价指标体系;考虑到决策情报收集过程中的认识域的范围,采用群决策的方式进行决策.作者考虑粗糙集理论在处理模糊信息方面的优点,设计一种新的属性离散化方法引导属性离散化过程,通过群体学习的方式获得部一致方案的判断值,进而得到最佳合作伙伴,最后用算例说明了属性离散化方法的可行性.     

公园内道路的优化设计模型

针对2012年西北工业大学数学建模竞赛的"公园内道路优化设计问题",给出一种解决方案.首先建立最小生成树模型,应用"破圈法"对生成树中不满足直线距离约束的路段进行修正,得出新修建道路长度.其次,建立费尔马点优化模型和椭圆覆盖模型,通过叠加场图提取覆盖重合率较高的区域,离散化取点,设为道路交叉点,经过费尔马点优化修正模型,实现在公园内可以任意修建道路的前提下,得出总路程最少的道路设计方案.最后考虑有障碍物(题中矩形的湖)下道路的优化设计,经过费尔马点优化,得到有湖时的最短道路长度.     

基于复化Simpson公式的GM(1,1)模型背景值优化

针对传统灰色模型GM(1,1)存在的模型精度不高的问题,提出了复化Simpson公式结合动态序列模型的联合方法.给定误差限,利用给出的计算背景值算法,对GM(1,1)模型的背景值进行优化.实例表明,基于复化Simpson公式的背景值优化算法所建立的GM(1,1)模型,可以有效地提高模型的预测精度和适用性.     

基于粗糙集和模糊C均值聚类的空战效能评估

针对评估指标的重要性不一,且存在冗余问题,基于粗集可辨识矩阵,提出了一种计算指标属性重要度和约简的有效、简便算法,对样本信息进行约简,并计算约简后各指标的权重.其中,针对连续属性值离散化过程可能造成信息损失问题,采用了模糊C均值聚类算法离散化连续属性值.最后,建立了基于粗糙集和模糊C均值聚类的空战效能评估模型,并通过实例验证了该模型的可行性和有效性.     

Dissipativity of Volterra functional differential equations

This paper is concerned with the dissipativity of Volterra functional differential equations in a Hilbert space. A sufficient condition for dissipativity of one class of such equations is obtained. This result is applied to delay differential equations and integro-differential equations to obtain dissipativity results that are more general and deeper than related results in the previous literature.     

Subintuitionistic logics and the implications they prove

This is an investigation of the implications of IPC which remain provable when one weakens intuitionistic logic in various ways. The research is concerned with logics with Kripke models as introduced by G. Corsi in 1987, and others like G. Restall, Do?en, Visser. This leads to conservativity results for IPC with regard to classes of implications in some of these logics. Moreover, similar results are reached for some weaker subintuitionistic systems with neighborhood models introduced by the authors in 2016. In addition, the relationship between two types of neighborhood models introduced in that work is clarified. This clarification leads also to modal companions for weaker logics.     

Numerical analysis of the weighted particle method applied to the semiconductor Boltzmann equation

Summary The semiconductor Boltzmann equation involves an integral operator, the kernel of which is a measure supported by a surface. This feature introduces some singularities of the exact solution, which makes the numerical approximation of this equation difficult. This paper is devoted to the error analysis of the weighted particle method (introduced by Mas-Gallic and Raviart [14]) applied to the space homogeneous semiconductor Boltzmann equation. The results are commented in view of the practical use of the method. This paper is closely related to [12], where results of numerical simulations on both test and real problems are given.     

Stochastic model for the nonlinear point reactor kinetics equations in the presence Newtonian temperature feedback effects

A stochastic model for the nonlinear point reactor kinetics equations with Newtonian temperature feedback and multi-group of precursor delayed neutrons is presented. This model is a couple of the stiff stochastic nonlinear differential equations. The matrix formula of this stochastic nonlinear model is solved by the analytical exponential technique (AET). This proposed technique is based on the integration factor, Euler’s method and the exponential function of the coefficient matrix. This exponential function is determined via the eigenvalues and corresponding eigenvectors of the coefficient matrix. The mean neutron population of the stochastic nonlinear model in the presence Newtonian temperature feedback and six-groups of delayed neutrons is computed for various cases of the external reactivity. The numerical results of the analytical exponential technique are compared with the results of the Euler–Maruyama method and the deterministic results. This comparison confirms that the AET for stochastic nonlinear model is efficient to study the natural behavior of neutron population in the presence temperature feedback effects and multi-group of precursor delayed neutrons.     

Cutting-plane theory: Algebraic methods

This paper is a survey, with new results, of the algebraic approach to cutting-planes. The new results are a subadditive dual program for integer programs, and a generalization of R. Gomory's linear inequality characterization of the cuts valid for the group problem. We also provide some results on the large family of alternate group problems, in addition to the one group problem that is conventionally thought of in connection with the algebraic approach. In terms of expository material, we shall provide very concise proofs of the most well-known results in the basic papers of the algebraic approach. (Note: This is a revision of Part I of MSRR no. 370).     

Constrained optimization problems in Banach space

This article is devoted to constrained minimization problems in Banach space. A necessary condition is derived and is compared with other similar results. In the process, correlation of some of the existing results is established.     

Insuring a risky investment project

In the standard model for insurance demand, the risk is totally exogenous and the insurance premium is paid for out of riskless wealth. This model yields results that are mostly in contradiction to everyday observation and have been used to question the pertinence of expected utility theory on which the model is based. For some years now, several papers have made attempts to provide foundations for a theory of insurance demand that leads to less provocative comparative statics results. In these papers, the risk for which coverage is sought becomes endogenous, and the decision to purchase insurance is made simultaneously with the decision on how much to invest in insurable assets. All these papers use a standard financial investment framework. This paper offers a contribution to this literature by using a slightly different framework: the case of a firm exposed to an insurable risk affecting return on a real investment project. The model is kept simple by using a two-state environment. It yields results that are both more complete and more general than results in previous work with the same motivation.     

Interdeparture time distributions in ΣiMi/Gi/1 priority queues

This paper reviews existing results for the stationary interdeparture time distribution in the M/G/1 nonpreemptive and preemptive resume queues, and introduces a unified approach which exploits for the first time the common structure for the interdeparture time process that is present in all classical preemptive priority service disciplines. This approach confirms previously known results for the preemptive resume discipline, and presents new results for several variants of the preemptive repeat model. Exact expressions for the squared coefficient of variation of the interdeparture time distribution are also provided. Several numerical examples are given and discussed. This revised version was published online in June 2006 with corrections to the Cover Date.     

Weighted extended b-splines for one-dimensional electromagnetic problems

This paper considers the weighted extended b-splines as basis function for finite element method in electromagnetics and compares with the standard finite element method applied to the two-point boundary value problems with different boundary conditions. This new approach, which provides more accurate results than standard finite element method, is presented to compare other numerical techniques and applied to one-dimensional electromagnetic problems. Computed results are compared with other numerical results in literature.     

An Integer Programming Approach to the Vehicle Scheduling Problem

This paper describes an integer programming formulation of the vehicle scheduling problem and illustrates how such a formulation can be extended to incorporate restrictions on work load, coverage and service that occur in real world vehicle scheduling problems. The integer programme is solved using the Revised Simplex method, additional constraints being introduced to retain integrality during convergence. The feasible region of this integer programme is initially restricted so that only routes constructed through sets of radially contiguous locations are considered. The effect of relaxing these over-constraints is explored. The method is demonstrated on fifteen problems ranging in size from 21 to 100 locations and the results generally show an improvement on previously published results. This is particularly true of the larger problems. This method compares favourably with other methods in computational efficiency.