Simultaneous process optimization and heat integration based on rigorous process simulations

This paper introduces a simultaneous process optimization and heat integration approach, which can be used directly with the rigorous models in process simulators. In this approach, the overall process is optimized utilizing external derivative-free optimizers, which interact directly with the process simulation. The heat integration subproblem is formulated as an LP model and solved simultaneously during optimization of the flowsheet to update the minimum utility and heat exchanger area targets. A piecewise linear approximation for the composite curve is applied to obtain more accurate heat integration results. This paper describes the application of this simultaneous approach for three cases: a recycle process, a separation process and a power plant with carbon capture. Case study results indicate that this simultaneous approach is relatively easy to implement and achieves higher profit and lower operating cost and, in the case of the power plant example, higher net efficiency than the sequential approach.     

刮板输送机中板仿生耐磨优化试验研究

刮板输送机中板磨损失效已成为输送机运行故障的主要原因之一，为了提高中板耐磨性，基于蜣螂非光滑单元进行了仿生中板设计，以磨损量为响应值，进行了单因素和响应面法优化试验。根据响应面法试验结果得到的因素显著性影响顺序（从高至低）依次为：径向距离，深径比，直径，节距角。基于试验结果建立了磨损量与因素的回归预测模型，经试验对比发现，预测模型与真实试验的相对误差为3.2%。在特定工况（煤散料粒度为6~8 mm、载荷为20 N、刮板链速为0.65 m/s及试验时长为6 600 s）下，当深径比为1.41、直径为0.69 mm、节距角为6.55°和径向距离为4.66 mm时，磨损量最小，仿生中板的耐磨性提高了12.6%。分析其耐磨机理发现，与光滑板相比，仿生板的磨粒磨损及黏着磨损较轻。凹坑分布可破坏持续切削中板表面的煤粒运动状态。中板的仿生优化可为今后刮板输送机的设计提供一定参考。     

A modified particle swarm optimization with multiple subpopulations for multimodal function optimization problems

In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations.     

A semicontinuous approach for heterogeneous azeotropic distillation processes

The separation of azeotropes has substantial energy and investment costs, and the available methods require high capital costs for reconstruction of process plants. As an alternative, a semicontinuous configuration that utilizes an existing plant with minor modifications has been explored. In this paper, a semicontinuous, heterogeneous azeotropic distillation process is proposed and acetic acid dehydration process is used as a case study. To carry out the simulation work, Aspen HYSYS^® simulation software is used along with MATLAB^® and an interface program to handle the mode-transition of the semicontinuous process. Sensitivity analyses on operating parameters are performed to identify the process limits. Comparisons are made to conventional heterogeneous azeotropic distillation, and dividing-wall distillation column on the annual cost. The results proved that the semicontinuous system is the best setup in terms of total annual costs and energy requirements.     

Hierarchical multi-reservoir optimization modeling for real-world complexity with application to the Three Gorges system

High dimensionality in real-world multi-reservoir systems greatly hinders the application and popularity of evolutionary algorithms, especially for systems with heterogeneous units. An efficient hierarchical optimization framework is presented for search space reduction, determining the best water distributions, not only between cascade reservoirs, but also among different types of hydropower units. The framework is applied to the Three Gorges Project (TGP) system and the results demonstrate that the difficulties of multi-reservoir optimization caused by high dimensionality can be effectively solved by the proposed hierarchical method. For the day studied, power output could be increased by 6.79 GWh using an optimal decision with the same amount of water actually used; while the same amount of power could be generated with 2.59 × 10⁷ m³ less water compared to the historical policy. The methodology proposed is general in that it can be used for other reservoir systems and other types of heterogeneous unit generators.     

高瓦斯突出矿井底抽巷一巷多用技术研究与实践

胡底煤业为高瓦斯高突出高矿压的三高矿井。对高瓦斯高突出的治理，该矿采用“地面网络预抽、区域模块降量、底抽穿层保掘、高位顺层保采”的四级模式，施工底抽巷，实现“底抽穿层消突、区域模块降量、异巷探测增效、多巷通风治患、循环排矸减压”等“一巷多用”。该4种方法已在1303（上）、1305（上）工作面应用并推广，取得了良好的效果，大大提高了掘进效率且满足抽放、探放水、通风需要；回填矸石初步设计现已经完善，待下一步掘进将实现填矸作用。     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation.     

An unsupervised approach to generating generic summaries of documents

We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately.     

基于词法特征的恶意域名快速检测算法

针对互联网中恶意域名攻击事件频发，现有域名检测方法实时性不强的问题，提出一种基于词法特征的恶意域名快速检测算法。该算法根据恶意域名的特点，首先将所有待测域名按照长度进行正则化处理后赋予权值；然后利用聚类算法将待测域名划分成多个小组，并利用改进的堆排序算法按照组内权值总和计算各域名小组优先级，根据优先级降序依次计算各域名小组中每一域名与黑名单上域名之间的编辑距离；最后依据编辑距离值快速判定恶意域名。算法运行结果表明，基于词法特征的恶意域名快速检测算法与单一使用域名语义和单一使用域名词法的恶意域名检测算法相比，准确率分别提高1.7%与2.5%，检测速率分别提高13.9%与6.8%，具有更高的准确率和实时性。