基于风险控制的装备供应链网络设计模型

针对风险管理中的装备供应链正向（供应）网络设计问题，在对装备供应链风险和成本进行量化分析的基础上，综合考虑风险和成本2方面因素，建立了基于风险控制的装备供应链网络设计优化模型。并设计了遗传算法对模型进行求解，给出在指定风险水平下最优设计方案与总成本。最后通过实例分析和计算，结果表明，该优化模型合理、有效、可行。     

Schedule design for liner services under vessel speed reduction incentive programs

Gas and particulate emissions from ship transportation have been increasing in recent years. In order to mitigate ship emissions near coastal areas, voluntary vessel speed reduction incentive programs (VSRIPs) were put in place by a number of ports. This paper studies a schedule design problem faced by liner shipping companies under VSRIPs. It proposes a mixed-integer nonlinear mathematical model for the minimization of the total cost, consisting of fuel cost, as well as operating cost, minus dockage refunds. The model balances three determinants, that is, the compliance of VSRIPs, the speed limit (the maximum physical speed of ships and the upper speed limit imposed by VSRIPs), and the limited number of ships. An enumerative algorithm and a piecewise-linear approximation algorithm are developed, based on some properties of the nonlinear model. The efficiency of the proposed algorithms is validated through extensive computational experiments.     

复杂线型小水线面双体船兴波阻力数值计算方法研究

将分段幂多项式拟合方法与线性兴波阻力理论相结合,提出一种针对复杂线型小水线面双体船的兴波阻力数值计算方法,该方法应用于常规小水线面双体船的兴波阻力计算,表明该方法能在常规的幂多项式拟合方法的基础上进一步提高计算精度,同时也验证了该方法的正确性,将该方法的计算结果与复杂线型小水线面双体船剩余阻力的试验结果相比,两者吻合较好,证明了该方法用于复杂线型小水线面双体船的兴波阻力计算是可行的。     

Stein–Chen approximation and error bounds for order fill rates in assemble‐to‐order systems

Assemble‐to‐order (ATO) is an important operational strategy for manufacturing firms to achieve quick response to customer orders while keeping low finished good inventories. This strategy has been successfully used not only by manufacturers (e.g., Dell, IBM) but also by retailers (e.g., Amazon.com). The evaluation of order‐based performance is known to be an important but difficult task, and the existing literature has been mainly focused on stochastic comparison to obtain performance bounds. In this article, we develop an extremely simple Stein–Chen approximation as well as its error‐bound for order‐based fill rate for a multiproduct multicomponent ATO system with random leadtimes to replenish components. This approximation gives an expression for order‐based fill rate in terms of component‐based fill rates. The approximation has the property that the higher the component replenishment leadtime variability, the smaller the error bound. The result allows an operations manager to analyze the improvement in order‐based fill rates when the base‐stock level for any component changes. Numerical studies demonstrate that the approximation performs well, especially when the demand processes of different components are highly correlated; when the components have high base‐stock levels; or when the component replenishment leadtimes have high variability. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于预配装思想的物资混装配载优化策略

提出了一种基于预配载思想的装备物资混装配载策略,并应用模糊聚类和混合智能算法进行了实例仿真。研究对于组合优化策略在装备保障信息化系统建设中的应用具有积极意义。     

Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Efficient sequential decision‐making algorithms for container inspection operations

Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees that are more efficient computationally than those presented by Stroud and Saeger and Anand et al. We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on a space of potentially acceptable binary decision trees. The improvements enable us to analyze substantially larger applications than was previously possible. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

子空间分解与淘汰优化方法

提出一种新的多学科设计优化方法,即子空间分解与淘汰优化方法.该方法通过子空间的分解和淘汰,提高剩余子空间的近似模型精度,基于子空间近似模型优化获取最优解.首先,基于设计空间近似模型获取最优解,如果近似模型达到满意精度,则终止优化;否则将设计空间分解为多个子空间.然后,各子空间基于近似模型优化,如果子空间没有可能获得优于...     

基于遗传算法的战时维修保障系统优化研究

分析了战时维修保障系统的结构功能,给出了维修保障系统的解析模型,提出了维修保障系统的可控参数及指标;为了使维修保障系统发挥最佳效能,以最小二乘准则作为系统的优化准则,建立了维修保障系统的优化模型,采用遗传算法对优化模型进行求解,给出了计算方法,并以计算实例验证了方法的可行性。     

遗传算法在装备调拨辅助决策中的应用

利用遗传算法求解装备调拨中的路径优化问题和运输装载问题,并利用MATLAB进行了实例仿真,对装备调拨的辅助决策具有积极的意义。