Equilibrium customer strategies and social–profit maximization in the single‐server constant retrial queue

We consider the single‐server constant retrial queue with a Poisson arrival process and exponential service and retrial times. This system has not waiting space, so the customers that find the server busy are forced to abandon the system, but they can leave their contact details. Hence, after a service completion, the server seeks for a customer among those that have unsuccessfully applied for service but left their contact details, at a constant retrial rate. We assume that the arriving customers that find the server busy decide whether to leave their contact details or to balk based on a natural reward‐cost structure, which incorporates their desire for service as well as their unwillingness to wait. We examine the customers' behavior, and we identify the Nash equilibrium joining strategies. We also study the corresponding social and profit maximization problems. We consider separately the observable case where the customers get informed about the number of customers waiting for service and the unobservable case where they do not receive this information. Several extensions of the model are also discussed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Annealing adaptive search,cross‐entropy,and stochastic approximation in global optimization

The Annealing Adaptive Search (AAS) algorithm for global optimization searches the solution space by sampling from a sequence of Boltzmann distributions. For a class of optimization problems, it has been shown that the complexity of AAS increases at most linearly in the problem dimension. However, despite its desirable property, sampling from a Boltzmann distribution at each iteration of the algorithm remains a practical challenge. Prior work to address this issue has focused on embedding Markov chain‐based sampling techniques within the AAS framework. In this article, based on ideas from the recent Cross‐Entropy method and Model Reference Adaptive Search, we propose an algorithm, called Model‐based Annealing Random Search (MARS), that complements prior work by sampling solutions from a sequence of surrogate distributions that iteratively approximate the target Boltzmann distributions. We establish a novel connection between MARS and the well‐known Stochastic Approximation method. By exploiting this connection, we prove the global convergence of MARS and characterize its asymptotic convergence rate behavior. Our empirical results indicate promising performance of the algorithm in comparison with some of the existing methods. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

邻域加强的并行子空间优化过程

针对基于响应面的并行子空间优化(CSSo-RS)过程的不足,提出了基于邻域加强的改进CSSO-RS优化过程.其主要思路是在子空间优化后,在得到的最优解附近进行全部变量的优化,以更好地协调系统级优化与子空间优化.用经典测试函数及通用航空飞机参数优化问题对该算法进行测试,测试结果表明该算法使CSSO-RS优化效率得到较大的...     

基于种群分类的变尺度免疫克隆选择算法

提出了一种基于种群分类的变尺度免疫克隆选择算法.该算法通过对目标函数进行非线性尺度变换,突出了全局最优解的优势地位;建立记忆子群实现了种群代际进化信息的交换;依据亲和度将抗体分为精英子群、普通子群、劣等子群,并对其分别执行自适应高斯变异、均匀变异和消亡更新等策略,增强了算法的局部和全局搜索能力.引入小生境技术提高了抗体...     

基于参数化建模的车轮形药柱形状优化

固体火箭发动机装药设计过程中,较高的装填分数往往导致药柱的应力应变较大,结构完整性不易满足要求,为了解决这一问题,将参数化建模方法与遗传算法相结合,对车轮形药柱进行形状优化.采用MSC.Patran软件的二次开发工具PCL (Patran Command Language)建立车轮形药柱的参数化有限元分析模型,能够根据...     

基于Gauss伪谱法的航天器气动力辅助平面变轨问题研究

气动力辅助变轨技术可以有效地节约燃料,是未来航天器新型变轨技术的发展方向之一.该文采用Gauss伪谱法对航天器从高轨道向低轨道共面轨道转移问题进行了研究.在考虑热流限制、控制约束的条件下,得到了航天器大气飞行段的次优轨迹,并对轨迹特性进行了分析,证明优化结果满足一阶最优性必要条件.同时采用间接法处理该问题,对两种方法的...     

基于METRIC理论的防空武器系统备件配置优化

利用C+ +Builder 6.0编程软件,编制了专门的计算备件期望短缺量的软件和查询表格,使得METRIC模型的实际运用更加方便;结合我军防空武器系统维修保障体制的现状,利用METRIC模型构建了备件配置优化模型;以备件订购费用为约束条件,装备可用度最大为目标对备件配置策略进行了优化研究;算例分析表明,结果比较合理,...     

基于满意度的多阶段任务系统可靠性冗余优化模型

冗余技术是提高多阶段任务系统可靠性的有效方法,目前对多阶段任务系统可靠性冗余优化研究甚少。分析了静态多阶段任务系统的特征和可靠性计算模型;构建了可靠度、体积、质量和价格的满意度函数并确定各个满意度函数的影响因子;建立了基于综合满意度函数的静态多阶段任务系统可靠性冗余模型,并利用微粒群算法对模型进行求解。算例验证了模型的合理性及算法的有效性。     

基于改进广义成本函数的可靠性分配优化

可靠性分配优化问题的难点在于影响分配的各类因素与可靠性指标间关系的描述与表达.从可靠性成本与各类影响因素的内在关系人手,通过改进广义成本函数进行各类影响因素的融合处理,构建得出新的可靠性分配优化模型实现可靠性指标的综合求解.     

一种高效的通信电台测试点优化故障诊断策略

针对通信电台的测试诊断问题,通过建立“故障一测试”相关性矩阵,提出了一种GADPSO算法与最大诊断信息量准则结合进行通信电台故障诊断的方法．GADPSO算法收敛速度快、计算精度高,既避免了陷入局部最优和早熟收敛,又提高了优化效率;最大诊断信息量准则能全面评判测试点,快速有效地获得测试顺序．该方法为通信电台故障诊断提供了一种高效诊断策略．