Thermoeconomic Optimization and Comparison of Plate-Fin Heat Exchangers Using Louver, Offset Strip, Triangular and Rectangular Fins Applied in 200 kW Microturbines

2017 ◽  
Vol 139 (10) ◽  
Author(s):  
Peyman Maghsoudi ◽  
Sadegh Sadeghi ◽  
Pedram Hanafizadeh
Keyword(s):  
Heat Exchangers ◽  
Optimization Problem ◽  
Net Present Value ◽  
Optimal Solutions ◽  
Counter Flow ◽  
Nsga Ii ◽  
Triangular Fin ◽  
Offset Strip Fin ◽  
Cycle Efficiency ◽  
Nondominated Sorting

In this paper, four types of plate-fin heat exchangers applied in 200 kW microturbines are investigated. Multi-objective optimization algorithm, NSGA-II (nondominated sorting genetic algorithm (GA)), is employed to maximize the efficiency of the recuperator and minimize its total cost, simultaneously. Feasible ranges of pressure drop, Reynolds number, and recuperator efficiency are obtained according to a penalty function. The optimizations are conducted for rectangular fin, triangular fin, louver fin, and offset strip fin recuperators with cross and counter flow arrangements. The results of each optimization problem are presented as a set of designs, called “Pareto-optimal solutions.” Afterward, for the designs, cycle efficiency and net present value (NPV) are compared based on technical and economic criteria, respectively. Maximum cycle efficiency occurring in a recuperator with louver fin and counter flow arrangement is found to be 38.17%. Finally, the optimum designs are compared based on nondominated sorting concept leading to the optimal solutions.

Hybrid QPSO-NNIA2 Algorithm for Multi-Objective Optimization Problem

2019 ◽  
Vol 33 (08) ◽  
pp. 1959025
Author(s):  
Lan Zhang
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problem ◽  
Nearest Neighbor ◽  
Superior Performance ◽  
Optimal Solutions ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Multi Objective ◽  
Evolution Algebra ◽  
Neighbor List

To improve the convergence and distribution of a multi-objective optimization algorithm, a hybrid multi-objective optimization algorithm, based on the quantum particle swarm optimization (QPSO) algorithm and adaptive ranks clone and neighbor list-based immune algorithm (NNIA2), is proposed. The contribution of this work is threefold. First, the vicinity distance was used instead of the crowding distance to update the archived optimal solutions in the QPSO algorithm. The archived optimal solutions are updated and maintained by using the dynamic vicinity distance based m-nearest neighbor list in the QPSO algorithm. Secondly, an adaptive dynamic threshold of unfitness function for constraint handling is introduced in the process. It is related to the evolution algebra and the feasible solution. Thirdly, a new metric called the distribution metric is proposed to depict the diversity and distribution of the Pareto optimal. In order to verify the validity and feasibility of the QPSO-NNIA2 algorithm, we compare it with the QPSO, NNIA2, NSGA-II, MOEA/D, and SPEA2 algorithms in solving unconstrained and constrained multi-objective problems. The simulation results show that the QPSO-NNIA2 algorithm achieves superior convergence and superior performance by three metrics compared to other algorithms.

scholarly journals A Multiobjective Approach to Homography Estimation

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Valentín Osuna-Enciso ◽  
Erik Cuevas ◽  
Diego Oliva ◽  
Virgilio Zúñiga ◽  
Marco Pérez-Cisneros ◽  
...  
Keyword(s):  
Optimization Problem ◽  
Consensus Algorithm ◽  
Superior Performance ◽  
Noise Tolerance ◽  
Nsga Ii ◽  
Multiobjective Approach ◽  
Homography Estimation ◽  
Random Sample Consensus ◽  
Random Sampling Consensus ◽  
Nondominated Sorting

In several machine vision problems, a relevant issue is the estimation of homographies between two different perspectives that hold an extensive set of abnormal data. A method to find such estimation is the random sampling consensus (RANSAC); in this, the goal is to maximize the number of matching points given a permissible error (Pe), according to a candidate model. However, those objectives are in conflict: a low Pe value increases the accuracy of the model but degrades its generalization ability that refers to the number of matching points that tolerate noisy data, whereas a high Pe value improves the noise tolerance of the model but adversely drives the process to false detections. This work considers the estimation process as a multiobjective optimization problem that seeks to maximize the number of matching points whereas Pe is simultaneously minimized. In order to solve the multiobjective formulation, two different evolutionary algorithms have been explored: the Nondominated Sorting Genetic Algorithm II (NSGA-II) and the Nondominated Sorting Differential Evolution (NSDE). Results considering acknowledged quality measures among original and transformed images over a well-known image benchmark show superior performance of the proposal than Random Sample Consensus algorithm.

scholarly journals Optimal Solutions of Multiproduct Batch Chemical Process Using Multiobjective Genetic Algorithm with Expert Decision System

2009 ◽  
Vol 2009 ◽  
pp. 1-9 ◽  
Author(s):  
Diab Mokeddem ◽  
Abdelhafid Khellaf
Keyword(s):  
Genetic Algorithm ◽  
Decision Maker ◽  
Optimization Problem ◽  
Optimal Solution ◽  
Solution Space ◽  
Fine Tuning ◽  
Plant Design ◽  
Optimal Solutions ◽  
Nsga Ii ◽  
Promethee Ii

Optimal design problem are widely known by their multiple performance measures that are often competing with each other. In this paper, an optimal multiproduct batch chemical plant design is presented. The design is firstly formulated as a multiobjective optimization problem, to be solved using the well suited non dominating sorting genetic algorithm (NSGA-II). The NSGA-II have capability to achieve fine tuning of variables in determining a set of non dominating solutions distributed along the Pareto front in a single run of the algorithm. The NSGA-II ability to identify a set of optimal solutions provides the decision-maker DM with a complete picture of the optimal solution space to gain better and appropriate choices. Then an outranking with PROMETHEE II helps the decision-maker to finalize the selection of a best compromise. The effectiveness of NSGA-II method with multiojective optimization problem is illustrated through two carefully referenced examples.

scholarly journals Modeling and Optimizing the Multi-Objective Portfolio Optimization Problem with Trapezoidal Fuzzy Parameters

2021 ◽  
Vol 26 (2) ◽  
pp. 36
Author(s):  
Alejandro Estrada-Padilla ◽  
Daniela Lopez-Garcia ◽  
Claudia Gómez-Santillán ◽  
Héctor Joaquín Fraire-Huacuja ◽  
Laura Cruz-Reyes ◽  
...  
Keyword(s):  
Steady State ◽  
Portfolio Optimization ◽  
Optimization Problem ◽  
Solution Process ◽  
Density Estimator ◽  
Nsga Ii ◽  
Spatial Spread ◽  
Multi Objective ◽  
Significant Difference ◽  
Portfolio Optimization Problem

A common issue in the Multi-Objective Portfolio Optimization Problem (MOPOP) is the presence of uncertainty that affects individual decisions, e.g., variations on resources or benefits of projects. Fuzzy numbers are successful in dealing with imprecise numerical quantities, and they found numerous applications in optimization. However, so far, they have not been used to tackle uncertainty in MOPOP. Hence, this work proposes to tackle MOPOP’s uncertainty with a new optimization model based on fuzzy trapezoidal parameters. Additionally, it proposes three novel steady-state algorithms as the model’s solution process. One approach integrates the Fuzzy Adaptive Multi-objective Evolutionary (FAME) methodology; the other two apply the Non-Dominated Genetic Algorithm (NSGA-II) methodology. One steady-state algorithm uses the Spatial Spread Deviation as a density estimator to improve the Pareto fronts’ distribution. This research work’s final contribution is developing a new defuzzification mapping that allows measuring algorithms’ performance using widely known metrics. The results show a significant difference in performance favoring the proposed steady-state algorithm based on the FAME methodology.

scholarly journals A Fast and Exact Greedy Algorithm for the Core–Periphery Problem

Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 94 ◽  
Author(s):  
Dario Fasino ◽  
Franca Rinaldi
Keyword(s):  
Structural Analysis ◽  
Optimization Problem ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Combinatorial Optimization Problem ◽  
Connected Subgraph ◽  
Optimal Solutions ◽  
The Core ◽  
Core Set ◽  
Key Concepts

The core–periphery structure is one of the key concepts in the structural analysis of complex networks. It consists of a partitioning of the node set of a given graph or network into two groups, called core and periphery, where the core nodes induce a well-connected subgraph and share connections with peripheral nodes, while the peripheral nodes are loosely connected to the core nodes and other peripheral nodes. We propose a polynomial-time algorithm to detect core–periphery structures in networks having a symmetric adjacency matrix. The core set is defined as the solution of a combinatorial optimization problem, which has a pleasant symmetry with respect to graph complementation. We provide a complete description of the optimal solutions to that problem and an exact and efficient algorithm to compute them. The proposed approach is extended to networks with loops and oriented edges. Numerical simulations are carried out on both synthetic and real-world networks to demonstrate the effectiveness and practicability of the proposed algorithm.

scholarly journals Applying NSGA-II to Shell-and-Tube Heat Exchangers: Insights from the Exergetic Optimization Perspective

2019 ◽  
Vol 1362 ◽  
pp. 012138
Author(s):  
Qusay K. Mojar Alshamusi ◽  
Layth S. Jasim Al-Hayder ◽  
Hassan A. Habeeb Alshamsi
Keyword(s):  
Heat Exchangers ◽  
Nsga Ii ◽  
Shell And Tube

scholarly journals An Improved MOEA/D Based on Reference Distance for Software Project Portfolio Optimization

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jing Xiao ◽  
Jing-Jing Li ◽  
Xi-Xi Hong ◽  
Min-Mei Huang ◽  
Xiao-Min Hu ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Evolutionary Algorithms ◽  
Portfolio Optimization ◽  
Optimization Problem ◽  
Experimental Comparison ◽  
Software Project ◽  
Project Portfolio ◽  
Multiobjective Evolutionary Algorithms ◽  
Reference Distance ◽  
Nondominated Sorting

As it is becoming extremely competitive in software industry, large software companies have to select their project portfolio to gain maximum return with limited resources under many constraints. Project portfolio optimization using multiobjective evolutionary algorithms is promising because they can provide solutions on the Pareto-optimal front that are difficult to be obtained by manual approaches. In this paper, we propose an improved MOEA/D (multiobjective evolutionary algorithm based on decomposition) based on reference distance (MOEA/D_RD) to solve the software project portfolio optimization problems with optimizing 2, 3, and 4 objectives. MOEA/D_RD replaces solutions based on reference distance during evolution process. Experimental comparison and analysis are performed among MOEA/D_RD and several state-of-the-art multiobjective evolutionary algorithms, that is, MOEA/D, nondominated sorting genetic algorithm II (NSGA2), and nondominated sorting genetic algorithm III (NSGA3). The results show that MOEA/D_RD and NSGA2 can solve the software project portfolio optimization problem more effectively. For 4-objective optimization problem, MOEA/D_RD is the most efficient algorithm compared with MOEA/D, NSGA2, and NSGA3 in terms of coverage, distribution, and stability of solutions.

Shape optimization of egg-shaped sewer pipes based on the nondominated sorting genetic algorithm (NSGA-II)

2022 ◽  
Vol 204 ◽  
pp. 111999
Author(s):  
Hanting Wu ◽  
Yangrui Huang ◽  
Lei Chen ◽  
Yingjie Zhu ◽  
Huaizheng Li
Keyword(s):  
Genetic Algorithm ◽  
Shape Optimization ◽  
Nsga Ii ◽  
Sewer Pipes ◽  
Nondominated Sorting
Sign in / Sign up

Export Citation Format

Share Document