基于模糊神经网络的反鱼雷深弹作战决策

反鱼雷深弹武器是水面舰艇对抗鱼雷的一种新的反鱼雷武器,由它组成的鱼雷防御系统可以拦截潜艇发射的声自导鱼雷、线导鱼雷及尾流自导鱼雷.根据其作战使用特点,建立基于模糊神经网络的智能辅助决策系统,分析了其基本思想,具体实现过程,并应用实例加以验证.计算结果表明:该模糊神经网络模型具有一定的合理性和实用性.     

多属性群决策理论的备件筛选方法

利用多属性群决策方法和多目标规划理论,建立了筛选武器装备维修备件的模型和方法.该方法首先按照多属性群决策方法对各种维修备件进行综合排序,然后再用多目标规划理论确定维修备件的选择方案.对该方法具体应用时的若干问题也进行了探讨.     

基于熵权的装备保障辅助决策系统效能评判

装备保障辅助决策系统是辅助装备保障指挥员顺利完成装备保障任务的重要手段,其效能优劣极大地影响到作战结果.在辅助决策系统的概念基础上,分析了装备保障指挥的特点,建立了包含决策的合理性、系统的时效性、硬件可靠性等十个指标的评判体系,利用熵权法得出评判指标体系的熵权,给出了系统的综合评判模型.最后通过实例验证了该模型的可行性和实用性.     

Reliability of a two-dimensional demand-based networked system with multistate components

Existing research on multistate system reliability has mainly focused on one-dimensional systems such as parallel systems, linear sliding window systems, and linearly consecutively connected systems. However, two-dimensional networked systems widely exist in real-world applications such as lighting systems, monitoring systems, and computer network systems. This research considers a two-dimensional networked system consisting of multistate components. The system fails if the cumulative performance of any row or any column cannot meet a predetermined demand. A novel reliability evaluation algorithm is proposed for the considered two-dimensional networked system by extending the universal generating function technique. Furthermore, the proposed model and reliability evaluation algorithm are extended to a two-dimensional networked system with phased missions. The proposed models and algorithms are illustrated by a matrix heating system in a thermoforming machine.     

Optimal production ramp-up in the smartphone manufacturing industry

Motivated by challenges in the smartphone manufacturing industry, we develop a dynamic production ramp-up model that can be applied to economically satisfy nonstationary demand for short-life-cycle products by high-tech companies. Due to shorter life cycles and more rapid evolution of smartphones, production ramp-up has been increasingly critical to the success of a new smartphone. In the production ramp-up, the key challenge is to match the increasing capacity to nonstationary demand. The high-tech smartphone manufacturers are urged to jointly consider the effect of increasing capacity and decreasing demand. We study the production planning problem using a high-dimensional Markov decision process (MDP) model to characterize the production ramp-up. To address the curse of dimensionality, we refine Monte Carlo tree search (MCTS) algorithm and theoretically analyze its convergence and computational complexity. In a real case study, we find that the MDP model achieves revenue improvement by stopping producing the existing product earlier than the benchmark policy. In synthetic instances, we validate that the proposed MCTS algorithm saves computation time without loss of solution quality compared with traditional value iteration algorithm. As part of the Lenovo production solution, our MDP model enables high-tech smartphone manufacturers to better plan the production ramp-up.     

Revenue maximization in two-station tandem queueing systems

We study optimal pricing for tandem queueing systems with finite buffers. The service provider dynamically quotes prices to incoming price sensitive customers to maximize the long-run average revenue. We present a Markov decision process model for the optimization problem. For systems with two stations, general-sized buffers, and two or more prices, we describe the structure of the optimal dynamic pricing policy and develop tailored policy iteration algorithms to find an optimal pricing policy. For systems with two stations but no intermediate buffer, we characterize conditions under which quoting either a high or a low price to all customers is optimal and provide an easy-to-implement algorithm to solve the problem. Numerical experiments are conducted to compare the developed algorithms with the regular policy iteration algorithm. The work also discusses possible extensions of the obtained results to both three-station systems and two-station systems with price and congestion sensitive customers using numerical analysis.     

On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019     

Exact analysis of (R,s, S) inventory control systems with lost sales and zero lead time

We study an (R, s, S) inventory control policy with stochastic demand, lost sales, zero lead‐time and a target service level to be satisfied. The system is modeled as a discrete time Markov chain for which we present a novel approach to derive exact closed‐form solutions for the limiting distribution of the on‐hand inventory level at the end of a review period, given the reorder level (s) and order‐up‐to level (S). We then establish a relationship between the limiting distributions for adjacent values of the reorder point that is used in an efficient recursive algorithm to determine the optimal parameter values of the (R, s, S) replenishment policy. The algorithm is easy to implement and entails less effort than solving the steady‐state equations for the corresponding Markov model. Point‐of‐use hospital inventory systems share the essential characteristics of the inventory system we model, and a case study using real data from such a system shows that with our approach, optimal policies with significant savings in inventory management effort are easily obtained for a large family of items.     

Maintaining systems with heterogeneous spare parts

We consider the problem of optimally maintaining a stochastically degrading, single‐unit system using heterogeneous spares of varying quality. The system's failures are unannounced; therefore, it is inspected periodically to determine its status (functioning or failed). The system continues in operation until it is either preventively or correctively maintained. The available maintenance options include perfect repair, which restores the system to an as‐good‐as‐new condition, and replacement with a randomly selected unit from the supply of heterogeneous spares. The objective is to minimize the total expected discounted maintenance costs over an infinite time horizon. We formulate the problem using a mixed observability Markov decision process (MOMDP) model in which the system's age is observable but its quality must be inferred. We show, under suitable conditions, the monotonicity of the optimal value function in the belief about the system quality and establish conditions under which finite preventive maintenance thresholds exist. A detailed computational study reveals that the optimal policy encourages exploration when the system's quality is uncertain; the policy is more exploitive when the quality is highly certain. The study also demonstrates that substantial cost savings are achieved by utilizing our MOMDP‐based method as compared to more naïve methods of accounting for heterogeneous spares.     

多属性模糊决策对舰炮射击目标优选

舰炮在现代高科技条件下海战中承担着重要的作战使命和任务,它能否完成被赋予的作战使命和任务,射击目标的优选起着决定性作用.为解决舰炮射击目标优选、决策问题,研究分析了多属性模糊决策方法,以及影响舰炮射击目标优选的因素,提出了多属性模糊决策方法的数学模型和求解最优射击目标排序的新方法.该方法在舰炮射击目标优选中的应用实例表明:通过定量和定性相结合,专家判断和信息处理相结合的多属性模糊决策方法对舰炮射击目标优选、决策具有一定的借鉴意义.