考虑多救援点的突发事件应急救援人员派遣模型

针对具有多救援点的突发事件应急救援人员派遣问题,给出了一种应急救援人员派遣模型。首先,依据救援人员关于救援任务的能力指标评价值计算出不同出救点的救援人员对救援点中救援任务的胜任度;其次,依据救援人员到达救援点的应急救援时间计算出应急救援时间满意度;然后,将救援人员对救援点的胜任度与应急救援时间满意度进行集结,获得应急救援人员与各救援点的综合匹配度;进一步地,以综合匹配度最大为目标,构建应急救援人员派遣优化模型,并通过模型求解获得最优的应急救援人员派遣方案;最后,通过一个算例说明了所构建的应急救援人员派遣模型具有可用性。     

基于应急供应链的物流配送计划研究

本文研究了基于应急供应链的物流配送计划问题,针对节点失效采用了供应链扩容策略,建立了在有限资源约束下单目标成本优化数学模型,以实现供应链运行总成本最小。然后,本文用CPLEX软件求解模型得到供应链的扩容方案。数值仿真结果表明本文所提出的扩容方法的有效性和实用性。     

考虑应急设施中断风险与防御的可靠性选址模型研究

为提高应急设施运行的可靠性和抵御中断风险的能力, 研究中断情境下的应急设施选址-分配决策问题。扩展传统无容量限制的固定费用选址模型, 从抵御设施中断的视角和提高服务质量的视角建立选址布局网络的双目标优化模型, 以应急设施的建立成本和抵御设施中断的加固成本最小为目标, 以最大化覆盖服务质量水平为目标, 在加固预算有限及最大最小容量限制约束下, 构建中断情境下应急设施的可靠性选址决策优化模型。针对所构建模型的特性利用非支配排序多目标遗传算法(NSGA-Ⅱ)求解该模型, 得到多目标的Pareto前沿解集。以不同的算例分析和验证模型和算法的可行性。在获得Pareto前沿的同时对不同中断概率进行灵敏度分析, 给出Pareto最优解集的分布及应急设施选址布局网络的拓扑结构。     

震后应急物流设施不确定失效情景下的LRP研究

针对震后应急物流设施不确定失效情景下的定位-路径问题,综合考虑灾区路网存在部分损毁、应急物资多方式配送与运达时间限制等因素,以应急物流设施最坏失效情景下的需求点覆盖期望最大、应急物资总配送时间最短为目标,采用情景建模方法构建多目标定位-路径问题的数学模型,并根据模型特点设计基于分层序列法的两阶段混合启发式求解算法,第一阶段设计改进贪婪算法进行应急物流设施定位分配,第二阶段采用蚁群算法优化应急物资配送路线。最后,通过算例验证了本文模型和算法的可行性与有效性。     

突发事件情景下串联式需求系统应急物资协同调度研究

针对突发事件情景下串联式需求系统遭受破坏问题,分析了突发事件情景下串联式需求系统应急物资协同调度的特征。在对系统提供应急物资进行修复的基础上,以串联式需求系统修复的时间最短及成本最小为目标,分别构建了纵向配送的应急物资调度模型和纵向配送与横向转运相结合的应急物资协同调度模型,并设计一种遗传算法对两种模型进行求解。最后通过算例分析,求解得到两种模式下串联式需求系统应急物资调度的最优配送方案,比较解的结果,得出纵向配送与横向转运相结合的应急物资协同调度模式优于一般的应急物资纵向配送模式的结论,验证了该应急物资协同调度模式的有效性和可行性。     

可变抽样区间图经济设计分析

传统控制图是静态的,其抽样区间为固定常数,往往不能及时发现生产过程异常。针对这种情况,本文在综合抽样成本、生产次品损失、误报警和漏报警损失、发现并纠正过程异常成本等基础上,提出可变抽样区间X图的经济设计方法。根据过程实际状态和由抽样结果采取的决策构建了一个二维时间离散的马尔可夫链,提出优化模型,并利用遗传算法寻找控制图参数的最优解。数值计算给出本文模型的具体求解过程。灵敏度分析研究了各参数对最优样本容量、控制限、警戒限、抽样区间及单位时间平均成本的影响。     

需求不确定条件下社区应急疏散协作调度优化模型

质量安全、自然灾害、公共卫生等突发事件社区应急疏散中的灾民数量具有不确定性,但目前的研究很少关注多种运输方式协作的应急疏散中灾民数量的不确定性。针对灾民数量的不确定性,以疏散灾民数量最大化,以及疏散成本最小化作为优化目标,,该文构建了多种运输方式协作的社区应急疏散模糊机会约束规划模型。在模型求解时,论文使用自适应遗传算子对多目标遗传算法进行改进,以提高算法优化效率。最后,论文使用算例对提出的模型进行验证,证明了该模型和方法可以有效完成需求不确定条件下的社区应急疏散协作调度优化工作。     

突发事件应急救援人员的分组方法研究

针对突发事件应急救援人员分组问题,给出了一种基于优化模型的分组方法。在本文中,首先描述了突发事件的应急救援人员分组问题;然后依据救援人员特征表现评价信息,计算救援人员完成不同任务的综合表现评价值;进一步地,以完成各救援任务的"效果"最好为目标,考虑每个救援人员只能被分到一个组里且每组中的人员数量要满足救援任务的需要,构建了救援人员分组的多目标优化模型,并通过求解优化模型来得到应急救援人员的分组方案。最后,通过一个算例分析说明了本文提出方法的可行性和有效性。     

考虑道路修复的应急资源配送可靠路径选择问题研究

灾害发生后第一时间选择可靠路径完成应急资源的配送分发是应急救援快速展开的必要保障。本文考虑道路修复下的应急资源配送可靠路径规划问题,引入了道路中断和通行可靠性降低来描述灾难对应急资源配送交通路网的影响,以最大化配送效率为目标,构建了道路修复与应急资源配送可靠路径选择集成优化模型,给出了道路修复与可靠路径选择的全局优化方案;设计了多吸引子的粒子群优化模型算法,并结合仿真与分析,验证了模型和算法的有效性。模型与算法的研究对于突发事件下不确定交通路网应急资源配送决策具有很好的指导意义。     

不确定偏好序信息下考虑主体心理行为的双边匹配决策方法

针对基于不确定偏好序信息的双边匹配问题,本文提出了一种决策方法。给出了双边匹配和不确定偏好序的相关概念,同时给出了不确定偏好序信息下考虑主体心理行为的双边匹配问题描述;以每个主体给出的临界值作为其参照点,计算了每个主体给出的不确定偏好序相对于参照点的收益或损失;考虑到主体损失规避的心理行为特征,依据TODIM思想计算每个主体对另一方主体的益损值的感知价值;在此基础上,构建了求解该双边匹配问题的双目标优化模型,使用线性加权法将双目标优化模型转化为单目标优化模型,通过求解该单目标优化模型获得匹配结果;最后,通过IT服务外包中的供给方与需求方的双边匹配实例分析说明了所提方法的有效性。     

基于区间数的应急物资调度决策模型及算法研究

应急物资调度决策是应急物流管理的重要研究问题之一,是影响应急救援效果的关键环节,加强应急物资调度方法研究,对提升我国应急物流管理水平,提高突发事件的应急保障能力和应对效果具有重要现实意义和理论研究价值.为了提高应急物资调度决策的有效性,基于应急物资调度问题的特点,引入区间数来描述应急物资调度决策中的不确定因素,建立了区间数信息环境下应急物资调度问题的时间最小化决策模型,提出了基于满意度水平的应急物资调度问题有效解的具体算法,最后通过算例分析验证了该方法的有效性.     

A model for the periodic optimization of bus dispatching times

We model the problem of dispatching time control in rolling horizons following a periodic optimization approach reactionary to travel time and passenger demand disturbances. This model provides more flexibility to transport planners allowing them to adjust the bus schedules during the daily operations. We prove that our periodic optimization model is a convex quadratic program, guaranteeing the global optimality of its solution. To reduce the computational burden, we introduce an iterative algorithm that uses gradient approximations to obtain an approximate dispatching solution. The proposed solution method is found to be significantly faster than exact optimization approaches for quadratic programming and maintains an (almost) negligible optimality gap in realistic bus operation scenarios. Finally, we show that our periodic optimization method outperforms myopic methods that adjust the dispatching time of each bus trip in isolation using operational data from bus line 302 in Singapore.     

The computation of regionalized short-run marginal costs of electricity: The ARCOMALT model

Generation operation models, giving expected values of marginal fuel and failure costs, have been developed at EDF since about fifteen years. In order to study the regionalization of the future tariffs, we have recently developed a model for computing short-run marginal costs including not only generation but also the interconnection network. We shall first deal below with the necessary reduction of the general problem of optimization of the interconnection network operation before explaining how we solve the reduced problem.The French 400 kV interconnection network enables more than hundred plants to deliver electricity to consumers through more than hundred main nodes. The optimization of the operation has been examined for network planning and has led to a separation between shortage cases (for which additional outage due to the network is minimized) and normal cases (for which economic dispatching, taking into losses account, is established). In order to deal with these two cases with ARCOMALT, and to be able to introduce the randomness of all the variables concerned, we have reduced the number of nodes to about a dozen, which will be justified by both technical and economic reasons. It will also be shown that a good way to represent the interconnection network, from an economic point of view, is to let the various regions exchange electricity at marginal cost (either fuel or failure cost) with a transaction cost (a polynome, the degree of shich will be discussed) and bounds on exchange capacities.The reduced problem is neither linear (both criteria and constraints are not) nor of a small size, so that usual methods cannot be applied. Graph theory cannot be used in this case because it is a problem with variable gains related to the links, and not a problem with fixed gains related to the nodes (which could be solved). It will be proved that, using the additive properties of the criteria, the main problem can be decomposed into smaller sub-problems and the optimal size of these sub-problems being the 3 nodes-problem. Finally, the relaxation method, which proceeds in two steps, is described: a rough solution is first obtained through a primal approach before using a dual approach to complete the computation of the marginal costs.     

基于似无关回归的多元稳健损失函数方法

针对多响应参数优化问题,考虑响应间相关性和可控因子波动的影响,提出了一种基于似无关回归的多元稳健损失函数方法。首先采用似无关回归对模型拟合和过程优化中的相关参数进行估计,更有效地利用响应间相关性信息;然后利用给定点处梯度信息来估计可控因子波动对过程稳健性的影响。算例表明,当响应间存在相关性时,与最小二乘方法相比,采用似无关回归拟合的响应曲面模型精度更高;与传统质量损失函数相比,在采用相同质量成本矩阵时,采用稳健损失函数方法得到的最优解处期望质量损失更小。     

Heuristic solution approaches for the cumulative capacitated vehicle routing problem

Cumulative capacitated vehicle routing problem (CCVRP) is an extension of the well-known capacitated vehicle routing problem, where the objective is minimization of sum of the arrival times at nodes instead of minimizing the total tour cost. This type of routing problem arises when a priority is given to customer needs or dispatching vital goods supply after a natural disaster. This paper focuses on comparing the performances of neighbourhood and population-based approaches for the new problem CCVRP. Genetic algorithm (GA), an evolutionary algorithm using particle swarm optimization mechanism with GA operators, and tabu search (TS) are compared in terms of required CPU time and obtained objective values. In addition, a nearest neighbourhood-based initial solution technique is also proposed within the paper. To the best of authors’ knowledge, this paper constitutes a base for comparisons along with GA, and TS for further possible publications on the new problem CCVRP.     

Cold vs. hot standby mission operation cost minimization for 1-out-of-N systems

It is well recognized that using the hot standby redundancy provides fast restoration in the case of failures. However the redundant elements are exposed to working stresses before they are used, which reduces the overall system reliability. Moreover, the cost of maintaining the hot redundant elements in the operational state is usually much greater than the cost of keeping them in the cold standby mode. Therefore, there exists a tradeoff between the cost of losses associated with the restoration delays and the operation cost of standby elements. Such a trade-off can be obtained by designing both hot and cold redundancy types into the same system. Thus a new optimization problem arises for the standby system design. The problem, referred to in this work as optimal standby element distributing and sequencing problem (SE-DSP) is to distribute a fixed set of elements between cold and hot standby groups and select the element initiation sequence so as to minimize the expected mission operation cost of the system while providing a desired level of system reliability. This paper first formulates and solves the SE-DSP problem for 1-out-of-N: G heterogeneous non-repairable standby systems. A numerical method is proposed for evaluating the system reliability and expected mission cost simultaneously. This method is based on discrete approximation of time-to-failure distributions of the system elements. A genetic algorithm is used as an optimization tool for solving the formulated optimization problem. Examples are given to illustrate the considered problem and the proposed solution methodology.     

多目标应急物流中心选址的鲁棒优化模型

针对重大突发事件的应急物资救援,研究了应急物流中心的选址及应急物资的调运问题。利用离散的情景集合描述受灾点应急物资需求的不确定性以及应急物资运输成本和运输时间的不确定性,同时考虑应急救援成本和应急救援时间两个目标,建立了多目标应急物流中心选址的确定型模型和鲁棒优化模型。为将多目标问题转化为单目标问题,利用成本单目标和时间单目标的最优结果将多目标转化为相对值再加权处理,该方法既可消除多个目标之间的单位及数量级差异,还可以根据问题的数据变化进行动态调整。以提供应急物资救援服务的设施作为编码,设计了一种通用的混合蛙跳算法。为检验模型和算法的有效性,设计了一个多情景的算例,结果表明两个模型和算法具备良好的可行性和有效性,且鲁棒优化模型能较好地保持对各种不确定性的抗干扰能力;最后,讨论分析了成本偏好权重和鲁棒约束系数的影响,结果表明可根据成本偏好权重的取值范围来区分各种应急救援阶段,体现不同救援阶段的救援要求及特征,并给出了成本偏好权重和鲁棒约束系数的取值建议。     

多储备点多品种应急物资配送的多目标优化模型

应急救援的社会化、应急物资需求的多样性、应急物资需求和补给的时变性,对应急物流的配送调度提出了挑战.应急物流的紧急性要求最大程度保障受灾点的物资供应;在经济上则要求应急物流的成本最小化.通过将时间离散化为阶段序列,在应急物资需求和补给是可预测的情况下,建立一个多储备点、多物资品种、单受灾点的应急物资配送的多目标优化模型,来最小化应急物资短缺次数和运输成本.仿真实例表明,该模型可以通过优化引擎快速求解,能够发现导致短缺的应急物资品种和加强供应补给的时间区间.     

Optimal corrective maintenance contract planning for aging multi‐state system

This paper considers an aging multi‐state system, where the system failure rate varies with time. After any failure, maintenance is performed by an external repair team. Repair rate and cost of each repair are determined by a corresponding corrective maintenance contract with a repair team. The service market can provide different kinds of maintenance contracts to the system owner, which also can be changed after each specified time period. The owner of the system would like to determine a series of repair contracts during the system life cycle in order to minimize the total expected cost while satisfying the system availability. Operating cost, repair cost and penalty cost for system failures should be taken into account. The paper proposes a method for determining such optimal series of maintenance contracts. The method is based on the piecewise constant approximation for an increasing failure rate function in order to assess lower and upper bounds of the total expected cost and system availability by using Markov models. The genetic algorithm is used as the optimization technique. Numerical example is presented to illustrate the approach. Copyright © 2009 John Wiley & Sons, Ltd.