基于自适应遗传算法的配送型多级库存优化研究

研究了由1个战役仓库、多个战术仓库组成的配送型系统的优化问题,建立了战术仓库使用经济订货批量策略和战役仓库采用4种不同订货策略时的模型,并采用自适应遗传算法实现了模型的求解,实例验证了模型及算法的有效性。     

Optimal sensor placement for underwater threat detection

The optimization framework for optimal sensor placement for underwater threat detection has been developed. It considers single‐period and multiperiod detection models, each of which includes two components: detection algorithm and optimization problem for sensor placement. The detection algorithms for single‐period and multiperiod models are based on likelihood ratio and sequential testing, respectively. For the both models, the optimization problems use the principle of superadditive coverage, which is closely related to energy‐based and information‐based approaches. An algorithm for quasi‐regular sensor placement approximating solutions to the optimization problems has been developed based on corresponding continuous relaxations and a criterion for its applicability has been obtained. Numerical experiments have demonstrated that the algorithm consistently outperforms existing optimization techniques for optimal sensor placement.© 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于混合粒子群算法的软硬武器协同反导决策

以单舰使用软硬武器对抗末端飞行的反舰导弹为背景,在对软硬武器抗击反舰导弹存在相互干扰进行分析的基础上,为了最大程度地减小干扰,取得最大的作战效果,建立了单舰协同使用软硬武器分层防御反舰导弹的模型.这是一个多阶段单指标方案优选问题,使用混合粒子群算法进行求解,仿真结果表明:该算法可以找到合理的、满足要求的反导方案,而且计算方便.     

Optimization of buckling load for laminated composite plates using adaptive Kriging-improved PSO: A novel hybrid intelligent method

An effective hybrid optimization method is proposed by integrating an adaptive Kriging (A-Kriging) into an improved partial swarm optimization algorithm (IPSO) to give a so-called A-Kriging-IPSO for maxi-mizing the buckling load of laminated composite plates (LCPs) under uniaxial and biaxial compressions. In this method, a novel iterative adaptive Kriging model, which is structured using two training sample sets as active and adaptive points, is utilized to directly predict the buckling load of the LCPs and to improve the efficiency of the optimization process. The active points are selected from the initial data set while the adaptive points are generated using the radial random-based convex samples. The cell-based smoothed discrete shear gap method (CS-DSG3) is employed to analyze the buckling behavior of the LCPs to provide the response of adaptive and input data sets. The buckling load of the LCPs is maximized by utilizing the IPSO algorithm. To demonstrate the efficiency and accuracy of the proposed methodology, the LCPs with different layers (2, 3, 4, and 10 layers), boundary conditions, aspect ratios and load patterns (biaxial and uniaxial loads) are investigated. The results obtained by proposed method are in good agreement with the literature results, but with less computational burden. By applying adaptive radial Kriging model, the accurate optimal results-based predictions of the buckling load are obtained for the studied LCPs.     

并行基因组合型遗传算法求解防空部署优化问题研究

针对防空部署研究的特点,探讨遗传算法求解防空部署优化问题。分析了传统遗传算法求解武器部署优化问题的缺点,提出了并行的基因组合型改进遗传算法,克服了编码不唯一和基因重码的现象,提高了搜索速度和解的质量;利用启发式信息缩小了解空间,并保证了算法寻优的每个个体都是可行解;对遗传操作算子进行了改进,克服了整数编码固有的缺点。该方法应用于求解防空部署优化问题中得到了较好的结果。     

常规导弹战前运输任务优化模型

制定常规导弹战前运输计划时,各车辆运输时间和运输路线的安排是一个组合优化问题.运用军事运筹学和不确定性优化理论,充分考虑节点冲突性、车辆隐蔽性、任务时间、道路容量等因素,建立了运输任务方案的优化模型.该研究为常规导弹波次作战计划的制定和优化提供模型支持,有助于提高常规导弹作战指挥自动化和部队的生存能力.     

舰船装备修理规划方案的DEA分析与优化

运用DEA方法对舰船装备修理规划方案的有效性进行了分析,对非有效单元的改进途径进行了探讨,为舰船修理规划的制定提供了科学依据.     

Lateral stock transshipments in a two‐location inventory system with fixed and joint replenishment costs

We address the problem of inventory management in a two‐location inventory system, in which the transshipments are carried out as means of emergency or alternative supply after demand has been realized. This model differs from previous ones as regards its replenishment costs structure, in which nonnegligible fixed replenishment costs and a joint replenishment cost are considered. The single period planning horizon is analyzed, with the form and several properties of the optimal replenishment and transshipment policies developed, discussed and illustrated. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 525–547, 1999     

The selection allocation problem

The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit‐maximizing (or cost‐minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of that group's resource, which is provided by either pooling or blending raw inputs from several potential sources. Imbedded in the decision process is the additional task of determining how much raw input is to be allocated to each group to form the resource for that group. Instances of this problem can be found in many different areas, such as in tool selection for flexible manufacturing systems, facility location, and funding for social services. Our goal in this paper is to identify and exploit special structures in the (SAP) and use those structures to develop an efficient solution procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 707–725, 1999