Optimal operation of a multibasin reservoir system

A simulation-optimization procedure is presented for evaluating the extent of interbasin transfer of water in the Peninsular Indian river system consisting of 15 reservoirs on four river basins. A system-dependent simulation model is developed incorporating the concept of reservoir zoning to facilitate releases and transfers. The simulation model generates a larger number of solutions which are then screened by the optimization model. The Box complex nonlinear programming algorithm is used for the optimization. The performance of the system is evaluated through simulation with the optimal reservoir zones with respect to four indices, reliability, resiliency, vulnerability and deficit ratio. The results indicate that by operating the system of 15 reservoirs as a single unit the existing utilization of water may be increased significantly.     

Delivering Improvement from Truth — the Fragile Link Between Analysis and Effective Change

In the history of operations research in industry there has been an abundance of analyses and recommendations produced in millions of man hours by dedicated OR specialists. And yet the net improvement is significantly lower than expected. There are numerous reasons for this shortfall: incomplete analysis, too much theory, incomplete implementation, unreliable recommendations, or a combination of some of these reasons.
By describing several examples, the major reasons for the fragility of the link between recommendation and implementation will be reviewed. What has to be done today to increase the likelihood of implementing an OR recommendation and thus improve the performance of an industrial entity by using the power of OR tools will then be described.     

改进的GMDH方法及其在参数预报中的应用

本文在综合了ＧＭＤＨ方法中几种有效的改进算法的基础上，进一步研究了变量预选及部分表达式的构成问题，采用最优化方法确定变量最佳组成式并进行变量筛选，由此得到精度更高、稳定性较好的模型，将其应用于聚丙烯熔指数的预报，仿真结果令人满意。     

用MS-EXCEL的规划求解模块优化油品调合

叙述了利用MS-EXCEL通用电子表格软件中的规划求解模块优化油品调合的方法,并以汽油调合为例,说明构造数学模型的方法,以及实施优化求解的具体过程。     

卫星包装箱的随机隔振优化分析

用钢丝绳隔振器将卫星包装箱支承在运输车上,将卫星与车辆简化为二自由度体系,优化分析了在随机路面上行驶时使包装箱响应最小之隔振参数,对实测得到的钢丝绳减振器的非线性迟滞性能作了描述,提出了统计线性化分析的方法。     

Multiobjective dynamic load-dispatching method for optimal operation of power systems

A new practical method is proposed which gives a quasi-optimal solution of the dynamic load-dispatching problem formulated by a multiconstraint multiobjective optimization problem. Here, the multiple constraints are rate reserve constraints and power flow ones, and the multiple objectives are fuel cost and CO₂ emission. The proposed method is an integration of the following three techniques: (1) “Group Dispatch Scheme,” which is developed by the authors, is used to satisfy a violated constraint easily. This scheme consists of three steps. The first step is to classify all generators into two groups. One is the group which should be more loaded to satisfy the violated constraint, and the other is the should-be less loaded group. The second step is to add some load to the former group, and to subtract the same load from the latter. The third step is to dispatch each group load to each groups generators, respectively; (2) the dynamic load-dispatching algorithm is used which provides, in practical time, quasi-optimal generation trajectories; (3) the conventional weighting parametric method is used to obtain a Pareto optimal solution of multiobjective problems. The effectiveness of the method is clarified by a computer simulation on the actual power system of Kansai Electric Power Company.     

Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times

In this article we study thetabu search (TS) method in an application for solving an important class of scheduling problems. Tabu search is characterized by integrating artificial intelligence and optimization principles, with particular emphasis on exploiting flexible memory structures, to yield a highly effective solution procedure. We first discuss the problem of minimizing the sum of the setup costs and linear delay penalties when N jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. A prototype TS method is developed for this problem using the common approach of exchanging the position of two jobs to transform one schedule into another. A more powerful method is then developed that employs insert moves in combination with swap moves to search the solution space. This method and the best parameters found for it during the preliminary experimentation with the prototype procedure are used to obtain solutions to a more complex problem that considers setup times in addition to setup costs. In this case, our procedure succeeded in finding optimal solutions to all problems for which these solutions are known and a better solution to a larger problem for which optimizing procedures exceeded a specified time limit (branch and bound) or reached a memory overflow (branch and bound/dynamic programming) before normal termination. These experiments confirm not only the effectiveness but also the robustness of the TS method, in terms of the solution quality obtained with a common set of parameter choices for two related but different problems.     

Optimizing a multiserver queuing system with a variable number of servers

A multiserver Poisson queuing system with losses, with a variable number of servers, and an additive quality functional is investigated. All major characteristic of the system are obtained in an explicit form. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 92–101, July–August 2007.     

Fast, large-scale model predictive control by partial enumeration

Partial enumeration (PE) is presented as a method for treating large, linear model predictive control applications that are out of reach with available MPC methods. PE uses both a table storage method and online optimization to achieve this goal. Versions of PE are shown to be closed-loop stable. PE is applied to an industrial example with more than 250 states, 32 inputs, and a 25-sample control horizon. The performance is less than 0.01% suboptimal, with average speedup factors in the range of 80-220, and worst-case speedups in the range of 4.9-39.2, compared to an existing MPC method. Small tables with only 25-200 entries were used to obtain this performance, while full enumeration is intractable for this example.     

Metaheuristic downhill simplex method in combinatorial optimization

The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP). An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented. The study was supported by INTAS (Project 06-1000017-8909). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007.