Revenue management with aircraft reassignment flexibility

A well‐studied problem in airline revenue management is the optimal allocation of seat inventory among different fare‐classes, given a capacity for the flight and a demand distribution for each class. In practice, capacity on a flight does not have to be fixed; airlines can exercise some flexibility on the supply side by swapping aircraft of different capacities between flights as partial booking information is gathered. This provides the airline with the capability to more effectively match their supply and demand. In this paper, we study the seat inventory control problem considering the aircraft swapping option. For theoretical and practical purposes, we restrict our attention to the class of booking limit policies. Our analytical results demonstrate that booking limits considering the swapping option can be considerably different from those under fixed capacity. We also show that principles on the relationship between the optimal booking limits and demand characteristics (size and risk) developed for the fixed‐capacity problem no longer hold when swapping is an option. We develop new principles and insights on how demand characteristics affect the optimal booking limits under the swapping possibility. We also develop an easy to implement heuristic for determining the booking limits under the swapping option and show, through a numerical study, that the heuristic generates revenues close to those under the optimal booking limits. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A stochastic approximation algorithm to compute bid prices for joint capacity allocation and overbooking over an airline network

In this article, we develop a stochastic approximation algorithm to find good bid price policies for the joint capacity allocation and overbooking problem over an airline network. Our approach is based on visualizing the total expected profit as a function of the bid prices and searching for a good set of bid prices by using the stochastic gradients of the total expected profit function. We show that the total expected profit function that we use is differentiable with respect to the bid prices and derive a simple expression that can be used to compute its stochastic gradients. We show that the iterates of our stochastic approximation algorithm converge to a stationary point of the total expected profit function with probability 1. Our computational experiments indicate that the bid prices computed by our approach perform significantly better than those computed by standard benchmark strategies and the performance of our approach is relatively insensitive to the frequency with which we recompute the bid prices over the planning horizon. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

AUV分布式自主控制与使命管理方法

提出了一种AUV(Autonomous Underwater Vehicle)自主控制的分布式体系结构与使命管理方法.将自主控制系统分为若干采用慎思/反应混合模式的智能体.每个智能体不仅可以独立地处理事件和进行决策,还可以与其他智能体进行合作来完成复杂的AUV任务.基于该体系结构,研究了AUV使命管理的动态协作机制.利...     

改进合同网协议的Agent动态任务分配

针对导弹作战任务规划中的动态任务分配问题,研究了MAS框架下任务分配的形式化描述和数学模型,对动态任务分配的特点进行了分析,运用合同网理论,提出了基于改进合同网协议的Agent动态任务分配算法,实现了对不确定开放环境中动态变化的任务分配方法。算例表明算法是有效的。     

挣值管理在装备寿命周期费用控制中的应用

在阐述挣值法的概念以及评价指标体系的基础上,建立了挣值管理在装备寿命周期费用控制中的三维模型,并将进度维中的各个里程碑与寿命周期过程结合起来,应用作业成本法对各个里程碑计划价值进行求解,最后举例说明,挣值法能够对装备寿命周期费用进行有效的预测和控制。     

“草原110”边境管理模式的本质特征

“草原110”边境管理模式是新的历史条件下边防建设的创新之举。分析“草原110”边境管理模式创建的社会历史条件、实践过程及其社会影响力,提炼构成“草原110”边境管理模式内涵的基本要素和本质特征。     

公安现役院校研究生管理路径刍议

公安现役院校研究生的管理工作与普通高校研究生和公安现役院校本科生的管理工作相比存在显著差异,准确定位公安现役院校研究生的特点,深入分析影响研究生有效管理的主要因素,积极探索研究生管理工作的有效路径,成为公安现役院校研究生管理工作科学化、正规化的重要突破口,对研究生培养质量和层次的提升有重要的现实意义。     

加强部队心理管理工作的思考

心理管理是重要的管理理念,是人员管理的重要环节,是经常性管理的重要内容。作为一种科学的管理方法,部队心理管理的水平如何,不仅同部队建设有着密切的关系,而且是完成军事斗争准备、打赢信息化战争的关键因素。加强部队心理管理工作,提高部队心理管理的科学性和实效性,是完成党中央和中央军委赋予军队新的使命任务的重要课题。     

基于在线动平衡的磁轴承参数辨识

针对磁悬浮刚性转子系统,提出了一种基于在线动平衡的磁轴承参数辨识方法。采用已知大小和相位的不平衡质量作为激振源,根据动平衡仪测得的转子不平衡响应,求得磁轴承位移刚度和电流刚度。利用某型磁悬浮控制力矩陀螺对该方法进行了试验验证,得到了一定转速范围内的磁轴承位移刚度和电流刚度,证明了该方法的正确性和实用性。试验结果表明外转子型磁轴承位移刚度和电流刚度随转速的增加而下降明显。     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013