救灾物资的紧急调运模型

针对某地区防洪救灾中物资的调运问题,利用图论中最短路的知识,根据问题实际,将物资的调运方案分成3个阶段.在每个阶段以费用最小或时间最短为目标.以各单位之间物资的供求平衡为约束,建立了规划模型.通过编程求解,制定了不同情况下物资紧急调运的具体方案,包括用车数量、行车线路、用车时间和费用.     

基于单变量多目标规划的装甲车辆冷却系统智能化控制

根据新一代装甲车辆推进系统热部件散热特点及其冷却系统调控原理,提出了一种单变量多目标数学规划与模糊智能控制相结合的控制算法。该算法将冷却系统抽象为单变量多目标数学规划问题,采用加权的方法将多个目标函数转化为综合目标函数,输入到模糊智能控制器中进行冷却控制。仿真结果表明:该控制算法具有良好的控制效果,能够有效地解决新型推进系统热源多、目标温度范围广而可调参数单一的问题。     

屋面太阳能电池布设优化模型

以光伏电池接受太阳能辐射强度最大化为目标,建立了太阳能电池板倾角和朝向优化模型,以确定太阳能电池板的最佳布设方式。根据发电量最大化、单位发电费用最小化原则,以净经济效益为目标函数,建立了光伏电池优选模型,对光伏电池进行优选排序从而选出性价比最高的光伏电池,并对模型进行了检验。结果表明：在山西省大同市地区铺设太阳能光伏电池,架空布设电池板的最佳倾角为36°,朝向为南偏西26.5°,光伏电池板最佳布设方式及电池优选模型与实际情况基本相符。     

电子侦察卫星联合侦察的混合调度算法

针对电子侦察卫星的使用约束,及不同任务的调度需求,建立了电子侦察卫星联合侦察的多目标混合整数规划模型.利用进化算法的全局搜索能力和变邻域搜索的局部优化能力,提出了一种多目标进化算法和变邻域搜索相结合两阶段混合调度算法MOEA VNS.针对问题多时间窗组合优化特点,设计了进化算子与邻域移动算子,在确保解多样性的同时使算法...     

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     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

改进的笛卡尔遗传编程组合电路演化设计

利用笛卡尔遗传编程进行电路演化时,存在收敛速度慢、收敛时间波动较大等问题．对笛卡尔遗传编程中的可编程单元模型进行改进,增加与目标函数相关的逻辑运算,去除无关的逻辑运算,从而提高演化算法命中目标的概率．利用改进的笛卡尔遗传编程方法分别对电机换相电路和乘法器等组合电路进行演化设计．结果表明,改进后的方法明显缩短了电路演化生成的时间,且收敛时间波动较小．     

A mathematical formulation and efficient heuristics for the dynamic container relocation problem

The container relocation problem (CRP) is concerned with emptying a single yard‐bay which contains J containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. The CRP can be modeled as a binary integer programming (IP) problem and is known to be NP‐hard. In this work, we focus on an extension of the CRP to the case where containers are both received and retrieved from a single yard‐bay, and call it the dynamic container relocation problem. The arrival (departure) sequences of containers to (from) the yard‐bay is assumed to be known a priori. A binary IP formulation is presented for the problem. Then, we propose three types of heuristic methods: index based heuristics, heuristics using the binary IP formulation, and a beam search heuristic. Computational experiments are performed on an extensive set of randomly generated test instances. Our results show that beam search heuristic is very efficient and performs better than the other heuristic methods.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 101–118, 2014     

Bicriteria multiresource generalized assignment problem

In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621–636, 2014     

求解武器目标分配问题的改进粒子群算法

在建立多种类型武器目标分配模型的基础上,提出了一种求解该模型的改进粒子群算法。首先,定义粒子聚焦距离变化率,使惯性权重依据聚焦距离变化率自适应调整;其次,采用速度最大值线性递减的策略平衡算法收敛精度与全局寻优能力之间的矛盾;最后,粒子替换策略使算法改善了因自适应惯性权重的引入而造成收敛速度变慢的问题。仿真结果表明,提出模型和算法合理有效,算法收敛快,适合求解各种种群规模的武器目标分配问题。