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.     

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.     

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.     

Multiobjective PSO based adaption of neural network topology for pixel classification in satellite imagery

The proposed work involves the multiobjective PSO based adaption of optimal neural network topology for the classification of multispectral satellite images. It is per pixel supervised classification using spectral bands (original feature space). This paper also presents a thorough experimental analysis to investigate the behavior of neural network classifier for given problem. Based on 1050 number of experiments, we conclude that following two critical issues needs to be addressed: (1) selection of most discriminative spectral bands and (2) determination of optimal number of nodes in hidden layer. We propose new methodology based on multiobjective particle swarm optimization (MOPSO) technique to determine discriminative spectral bands and the number of hidden layer node simultaneously. The accuracy with neural network structure thus obtained is compared with that of traditional classifiers like MLC and Euclidean classifier. The performance of proposed classifier is evaluated quantitatively using Xie-Beni and β indexes. The result shows the superiority of the proposed method to the conventional one.     

An optimization model for evaluating the economic impact of availability and maintenance notions during the synthesis and design of a power plant

In this paper, we introduce an optimization strategy in order to comprehensively quantify the impact of availability and maintenance notions during the early stages of synthesis and design of a new natural gas combined cycle power plant. A detailed state-space approach is thoroughly discussed, where influence of maintenance funds on each component's repair rate is directly assessed.In this context, analysis of the reliability characteristics of the system is centered at two designer-adopted parameters, which largely influence the obtained results: the number of components which may fail independently at the same time, and the number of simultaneous failure/repair events.Then, optimal solutions are evaluated as the availability-related parameters and the amount of resources assigned for maintenance actions are varied across a wide range of feasible values, which enable obtaining more accurate and detailed estimations of the expected economic performance for the project when compared with traditional economic evaluation approaches.     

A new decomposition based evolutionary algorithm with uniform designs for many-objective optimization

For many-objective optimization problems, how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition based evolutionary algorithm with uniform designs is proposed to achieve the goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and the size of the weight vectors neither increases nonlinearly with the number of objectives nor considers a formulaic setting. A crossover operator based on the uniform design method is constructed to enhance the search capacity of the proposed algorithm. Moreover, in order to improve the convergence performance of the algorithm, a sub-population strategy is used to optimize each sub-problem. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on six benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence.