应急资源调度模型及算法

应急问题最显著的特点表现为时间的紧迫性.本文针对应急系统多点出救的特点,研究了消耗速率为函数的连续型应急资源调度模型.该模型以最早应急时间为目标,给出了最早应急时间的求取方法,数值算例表明了算法的有效性和实用性.     

资源受限下森林火灾应急救援多目标调度优化

许多森林火灾由于救援资源受限而不能在第一时间扑灭,导致火灾扩大蔓延,进而造成更大的森林资源损失。因此,在救援资源受限情形下,如何对消防救援车辆进行合理的调度安排以快速和低成本地扑灭火灾已成为亟待解决的现实问题。本文研究了一类资源受限下森林火灾应急救援多目标调度优化问题,为该问题构建了多目标混合整数非线性规划模型,优化目标为同时最小化总灭火救援时间和救援车辆总行驶距离。为有效求解该问题,首先将上述非线性模型等价转化为线性模型。然后提出ε-约束法和模糊逻辑相结合的算法对问题进行求解。最后,以大兴安岭山发生的火灾案例和随机生成仿真算例对模型和算法有效性进行验证,结果表明所提出的模型和算法能够有效解决资源受限下森林火灾应急救援问题,并为决策者提供最优的消防调度方案。     

应急物流网络优化决策模型研究

应急物流环境的动态性与复杂性决定了应急物流网络应具有高度敏捷性与柔性.将应急物流系统的运行划分为四个不同阶段,分析了不同阶段应急物流所追求的目标重要性的变化趋势,引入罚函数系数来均衡不同阶段应急物流的时效性、经济性、风险性三个目标,将多目标优化问题转化为单目标优化,以网络总成本最小为优化目标,建立网络优化决策模型,为应急物流网络优化提供辅助决策方案.     

考虑双方感知满意度的应急资源再配置方法

突发事件常诱发次生灾害,在外界大规模应急资源配送前,发挥区域互救优势,共享原生灾害点应急资源进行资源再配置是及时响应次生灾害的重要手段之一。本文尝试将灾民心理因素融入到应急资源的再配置问题中,基于前景理论提出了原生灾害点灾民的感知满意度模型,结合生存概率曲线对次生灾害点灾民感知满意度进行刻画,构建了考虑双方灾民感知满意度的多目标优化模型。此外,引入缩放系数和违反约束检查函数,改进多目标粒子群算法以加快算法初始化,进而提升模型求解效率。最后,本文通过算例验证了模型和算法的可行性和科学性,并与传统资源配置问题进行了对比,为具有连锁反应的突发事件应急管理提供决策支持。     

多资源复杂网络的应急调度研究

以一次性消耗系统为背景．提出了多应急点多出救点以及多资源的复杂网络应急调度模型。以应急点的损失最小和出救点的个数最少为目标,将损失量大小转化为应急时间长短进行衡量,运用理想点法求解。最后构造算例．运用本文提出的方法对模型进行计算,验证了所建立模型的合理性及理想点法的可行性和有效性。     

基于救援效率的

面临重大灾害事件,通航救援具有快速、高效、受地理空间限制少的优势,是保护生命财产安全、减少社会危害和经济损失的有效手段.针对国内现有的通航救援调度模型未考虑"多对多"的配送模式,构建了以最大化救援效率、最小化总飞行里程为目标的多出救点、多受灾点航空器调度模型,提出一种遗传-模拟退火混合算法对模型进行求解.最后,通过实例测试以及与其他算法的比较,验证了所提方法的有效性,为通航应急救援提供合理、可行的调度方案.     

基于救援效率的通航救援调度模型研究

面临重大灾害事件,通航救援具有快速、高效、受地理空间限制少的优势,是保护生命财产安全、减少社会危害和经济损失的有效手段.针对国内现有的通航救援调度模型未考虑"多对多"的配送模式,构建了以最大化救援效率、最小化总飞行里程为目标的多出救点、多受灾点航空器调度模型,提出一种遗传-模拟退火混合算法对模型进行求解.最后,通过实例测试以及与其他算法的比较,验证了所提方法的有效性,为通航应急救援提供合理、可行的调度方案.     

考虑时间延误的高速公路应急救援模型研究

针对高速公路突发事件应急救援车辆资源调度问题,建立了考虑应急车道占用时间延误的高速公路应急救援车辆资源调度模型.首先对高速公路突发事件造成的交通拥堵情况结合集散波理论进行了分析.然后对由于应急车道被占用而产生的路段时间延误类型进行了分类讨论.在此基础上构建了基于LRP的高速公路应急救援车辆资源调度模型.最后以某高速公路网为算例进行实验分析.结果表明,为使整体救援时间最短,在事故点造成拥堵产生应急车道占用情况下,应急救援车辆资源需要尽早派出;在应急救援车辆资源对事故点进行救援而造成拥堵产生应急车道占用情况下,应急救援车辆资源需要在救援的最迟时间范围内,以最晚的时间派出.     

基于贪婪算法的水上漂移目标救助物资协同调度方法

受复杂水文、气象等条件影响,水上遇险目标在等待外部救援的过程中可能发生漂移,其漂移的速度与方向将直接影响到水上救助物资调度方案的制订。针对水上事故及其救援的特殊性,在对水上遇险目标漂移路径进行预测的基础上,构建了满足运力、时间限制及应急救助物资需求,包括水上遇险目标周边船舶、岸基救助基地及其附近陆地应急物资储备点共同参与的水陆两阶段多层级协同调度模型,并运用贪婪算法对其进行求解,最后通过算例对模型和算法的有效性进行验证。     

水上重大溢油事故围油栏协同调度方法研究

针对水上重大溢油事故,围控作业对围油栏调运数量和应急限制期的要求极高,为了尽可能提高待围控区域的应急调度效果,需要组织责任区间内各应急反应基地进行围油栏协同调度。文章将受溢油污染威胁区域划分为有限个待围控区域,分别计算各待围控区域的重要度权重、围油栏需求量和应急限制期。考虑各应急反应基地的围油栏可调运量及单次运载能力限制,针对不同重要度的待围控区域对围油栏调运数量和应急限制期的要求,构建多应急反应基地-多待围控区域的协同调度模型,确定各应急反应基地的围油栏调运去向和调运量。通过对比试验对本文模型的有效性进行验证,研究结果表明:组织多个应急反应基地进行围油栏协同调度,并差别化对待区域内不同敏感资源的应急调运要求,可以显著地提高受溢油污染威胁区域的整体应急调度效果。     

Properties of Restricted NCP Functions for Nonlinear Complementarity Problems

In this paper, we study restricted NCP functions which may be used to reformulate the nonlinear complementarity problem as a constrained minimization problem. In particular, we consider three classes of restricted NCP functions, two of them introduced by Solodov and the other proposed in this paper. We give conditions under which a minimization problem based on a restricted NCP function enjoys favorable properties, such as equivalence between a stationary point of the minimization problem and the nonlinear complementarity problem, strict complementarity at a solution of the minimization problem, and boundedness of the level sets of the objective function. We examine these properties for three restricted NCP functions and show that the merit function based on the restricted NCP function proposed in this paper enjoys favorable properties compared with those based on the other restricted NCP functions.     

On Optimization over the Efficient Set in Linear Multicriteria Programming

The efficient set of a linear multicriteria programming problem can be represented by a reverse convex constraint of the form g(z)≤0, where g is a concave function. Consequently, the problem of optimizing some real function over the efficient set belongs to an important problem class of global optimization called reverse convex programming. Since the concave function used in the literature is only defined on some set containing the feasible set of the underlying multicriteria programming problem, most global optimization techniques for handling this kind of reverse convex constraint cannot be applied. The main purpose of our article is to present a method for overcoming this disadvantage. We construct a concave function which is finitely defined on the whole space and can be considered as an extension of the existing function. Different forms of the linear multicriteria programming problem are discussed, including the minimum maximal flow problem as an example. The research was partly done while the third author was visiting the Department of Mathematics, University of Trier with the support by the Alexander von Humboldt Foundation. He thanks the university as well as the foundation.     

A GLOBALal DERIVTIVE-FREE DESCENT METHOD FOR NONLINEAR COMPLEMENTARITY PROBLEMS

1. IntroductionConsider the nonlinear complementarity problem (NCP for short), which is to findan x E M" such thatwhere F: Wu - ac and the inequalities are taken componentwise. This problem havemany important applications in various fields. [13, 7, 5].Due to the less storage in computation, derivative--free descent method, which meansthe search direction used does not involye the Jacobian matrix of F, is popular infinding solutions of nonlinear complementarity Problems. We briefly view som…     

Expected Residual Minimization Method for Stochastic Variational Inequality Problems

This paper considers a stochastic variational inequality problem (SVIP). We first formulate SVIP as an optimization problem (ERM problem) that minimizes the expected residual of the so-called regularized gap function. Then, we focus on a SVIP subclass in which the function involved is assumed to be affine. We study the properties of the ERM problem and propose a quasi-Monte Carlo method for solving the problem. Comprehensive convergence analysis is included as well. This work was supported in part by SRF for ROCS, SEM and Project 10771025 supported by NSFC.     

Duality for location problems with unbounded unit balls

Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conjugacy approach based on the perturbation theory, we determine a dual to it. Necessary and sufficient optimality conditions are derived using strong duality. Furthermore, as special case of this problem, we consider a location problem, where the “distances” are measured by gauges of closed convex sets. We prove that the geometric characterization of the set of optimal solutions for this location problem given by Hinojosa and Puerto in a recently published paper can be obtained via the presented dual problem. Finally, the Weber and the minmax location problems with gauges are given as applications.     

MERIT FUNCTION AND GLOBAL ALGORITHM FOR BOX CONSTRAINED VARIATIONAL INEQUALITIES

1 IntroductionWe consider tlie variational inequality problelll, deuoted by VIP(X, F), wliicli is to find avector x* E X such thatF(X*)"(X -- X-) 2 0, VX E X, (1)where F: R" - R" is any vector-valued f11uction and X is a uonelllpty subset of R'.This problem has important applicatiolls. in equilibriun1 modeIs arising in fields such asecououtics, transportatioll scieuce alld operations research. See [1]. There exist mauy lllethodsfor solviug tlie variational li1equality problem VIP(X. …     

Global Method for Monotone Variational Inequality Problems with Inequality Constraints

We consider optimization methods for monotone variational inequality problems with nonlinear inequality constraints. First, we study the mixed complementarity problem based on the original problem. Then, a merit function for the mixed complementarity problem is proposed, and some desirable properties of the merit function are obtained. Through the merit function, the original variational inequality problem is reformulated as simple bounded minimization. Under certain assumptions, we show that any stationary point of the optimization problem is a solution of the problem considered. Finally, we propose a descent method for the variational inequality problem and prove its global convergence.     

A Finite Algorithm for a Class of Nonlinear Multiplicative Programs

The nonconvex problem of minimizing the product of a strictly convex quadratic function and the p-th power of a linear function over a convex polyhedron is considered. Some theoretical properties of the problem, such as the existence of minimum points and the generalized convexity of the objective function, are deepened on and a finite algorithm which solves the problem is proposed.     

Construction of a CPA contraction metric for periodic orbits using semidefinite optimization

A Riemannian metric with a local contraction property can be used to prove existence and uniqueness of a periodic orbit and determine a subset of its basin of attraction. While the existence of such a contraction metric is equivalent to the existence of an exponentially stable periodic orbit, the explicit construction of the metric is a difficult problem.In this paper, the construction of such a contraction metric is achieved by formulating it as an equivalent problem, namely a feasibility problem in semidefinite optimization. The contraction metric, a matrix-valued function, is constructed as a continuous piecewise affine (CPA) function, which is affine on each simplex of a triangulation of the phase space. The contraction conditions are formulated as conditions on the values at the vertices.The paper states a semidefinite optimization problem. We prove on the one hand that a feasible solution of the optimization problem determines a CPA contraction metric and on the other hand that the optimization problem is always feasible if the system has an exponentially stable periodic orbit and the triangulation is fine enough. An objective function can be used to obtain a bound on the largest Floquet exponent of the periodic orbit.     

Application in Aerohydrodynamics of the Solution of an Inverse Boundary Value Problem for Analytic Functions

We consider a modified inverse boundary value problem of aerohydrodynamics in which it is required to find the shape of an airfoil streamlined by a potential flow of an incompressible nonviscous fluid, when the distribution of the velocity potential on one section of the airfoil is given as a function of the abscissa, while, on other sections of the airfoil, as a function of the ordinate of the point. The velocity of the undisturbed flow streamlining the sought-for airfoil is determined in the process of solving the problem. It is shown that, under rather general conditions on the initially set functions, the sought-for contour is closed unlike the inverse problem in the case when, on the unknown contour, the velocity distribution is given as a function of the arc abscissa of the contour point. We also consider the case when, on the entire desired contour, the distribution of the velocity potential is given as a function of one and the same Cartesian coordinate of the contour point.