A web-based software tool for participatory optimization of conservation practices in watersheds

WRESTORE (Watershed Restoration Using Spatio-Temporal Optimization of Resources) is a web-based, participatory planning tool that can be used to engage with watershed stakeholder communities, and involve them in using science-based, human-guided, interactive simulation–optimization methods for designing potential conservation practices on their landscape. The underlying optimization algorithms, process simulation models, and interfaces allow users to not only spatially optimize the locations and types of new conservation practices based on quantifiable goals estimated by the dynamic simulation models, but also to include their personal subjective and/or unquantifiable criteria in the location and design of these practices. In this paper, we describe the software, interfaces, and architecture of WRESTORE, provide scenarios for implementing the WRESTORE tool in a watershed community's planning process, and discuss considerations for future developments.     

优化军工科研项目管理的具体策略

我国的军工科研所成立于上世纪，它以军工项目的科研、预研为主，为我国的国防军工提供研发产品。伴随着我国经济实力的增强和科技军事力量的增长，军工科研院所也转变了原有的工业专属性质，走上了军民两用、寓军于民的道路，并在时代的进步中成为了我国先进装备制造业的重要科研力量和科技创新支柱。凸现军事工业“高、精、尖”的特点，以项目管理的优化为具体策略进行军工科研开发工作。     

The robust knapsack problem with queries

We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse.     

Collapse load of composite laminates: Lower bound evaluation by stress field analytical approximation

The paper proposes a limit analysis approach to define the ultimate load capacity of orthotropic composite laminates under biaxial loading and plane stress conditions. A lower bound to the collapse load multiplier is computed by solving a maximization nonlinear problem, according to the static theorem of limit analysis. To set up the optimization problem a stress field distribution is hypothesized at lamina level, moreover inter-lamina stresses are also considered. The effectiveness and validity of the proposed approach is shown by comparing the obtained numerical predictions both with available experimental data and with other numerical results carried out by means of a different numerical lower bound approach.     

Cost-minimization analysis of a working vacation queue with N-policy and server breakdowns

This paper investigates the N-policy M/M/1 queueing system with working vacation and server breakdowns. As soon as the system becomes empty, the server begins a working vacation. The server works at a lower service rate rather than completely stopping service during a vacation period. The server may break down with different breakdown rates during the idle, working vacation, and normal busy periods. It is assumed that service times, vacation times, and repair times are all exponentially distributed. We analyze this queueing model as a quasi-birth–death process. Furthermore, the equilibrium condition of the system is derived for the steady state. Using the matrix-geometric method, we find the matrix-form expressions for the stationary probability distribution of the number of customers in the system and system performance measures. The expected cost function per unit time is constructed to determine the optimal values of the system decision variables, including the threshold N and mean service rates. We employ the particle swarm optimization algorithm to solve the optimization problem. Finally, numerical results are provided, and an application example is given to demonstrate the applicability of the queueing model.     

A multi-start central force optimization for global optimization

Central force optimization (CFO) is an efficient and powerful population-based intelligence algorithm for optimization problems. CFO is deterministic in nature, unlike the most widely used metaheuristics. CFO, however, is not completely free from the problems of premature convergence. One way to overcome local optimality is to utilize the multi-start strategy. By combining the respective advantages of CFO and the multi-start strategy, a multi-start central force optimization (MCFO) algorithm is proposed in this paper. The performance of the MCFO approach is evaluated on a comprehensive set of benchmark functions. The experimental results demonstrate that MCFO not only saves the computational cost, but also performs better than some state-of-the-art CFO algorithms. MCFO is also compared with representative evolutionary algorithms. The results show that MCFO is highly competitive, achieving promising performance.     

炼油厂全流程优化建模方法研究

为了克服使用线性规划和单处理单元非线性规划进行生产优化的内在缺点，在建立原油单元、催化裂化、催化重整和汽油调合等4个重要处理单元详细模型的基础上，将单处理单元非线性过程模型集成到一个全流程优化非线性模型中。优化的目标函数是使炼油厂全厂利润最大。决策变量是那些显著影响全厂效益的变量，约束条件是单个处理单元约束条件的集合。对某炼油厂进行实例研究，结果表明该全流程模型能有效处理全厂优化问题，所得利润在线性规划的基础上提高4．5％。     

渤海绥中油田J3井疏水缔合聚合物驱数值模拟研究

为了进一步提高渤海油田J3井区缔合聚合物驱的技术经济效果,在渤海油田室内配方和先导性矿场试验研究基础上,利用化学驱油藏数值模拟软件FAPMS,分析和研究了高浓度缔合聚合物前置段塞、主段塞的大小和浓度以及段塞组合方式对驱油效果的影响,优化设计了渤海绥中油田J3井区块矿场试验的最佳注入程序及段塞大小。结果表明,通过对不同浓度的疏水缔合聚合物注入的前置段塞及主段塞和梯度式后续段塞的优化后,原油采收率比未优化时提高了约10个百分点。研究表明,渤海油田应该高度重视聚合物驱的注入方式和段塞优化设计,进一步提高聚合物的技术经济效果。