scholarly journals An Extensive Study for a Wide Utilization of Green Architecture Parameters in Built Environment Based on Genetic Schemes

Buildings ◽  
2021 ◽  
Vol 11 (11) ◽  
pp. 507
Author(s):  
Ghada Elshafei ◽  
Silvia Vilčeková ◽  
Martina Zeleňáková ◽  
Abdelazim M. Negm
Keyword(s):  
Genetic Algorithm ◽  
Decision Making ◽  
Green Building ◽  
Extensive Study ◽  
Nsga Ii ◽  
Multi Objective ◽  
Green Architecture ◽  
Multi Objective Programming ◽  
The Neural Network ◽  
Economic Future

Recently, green structures turned into a huge path to an economic future. Green building outlines include finding the harmony between agreeable home living and a maintainable environment. Furthermore, the usage of modern technologies is seen as part of greener construction changes to make the urban environment more viable. This paper introduces an exhaustive state-of-art review and current practices to look for the ideal green arrangement’s models, procedures, and parameters utilizing the genetic algorithms innovations to help for settling on the most ideal choice from various options. The integrated Genetic Algorithm (GA) along with the Nondominated Sorting Genetic Algorithm strategy GA-NSGA-II is considered to be more accurate for predicting a viable future. The above methodology is widely relevant for its humility, ease of execution, and enormous durability. Besides other approaches, the GA was incorporated as well as the Neural Network (NN), Simulated Annealing (SA), Fuzzy Set theory, decision-making multicriteria, and multi-objective programming. The most fashionable methods are moderately the embedded GA-NSGA-II approaches. This paper gives an outline of the capability of GA-based MOO in supporting the advancement of methodologies of the techniques and parameters to find the best solution for the building decision-making cycle. The GA combined schemes can fulfill all the requirements for finding the optimality in the case of multi-objective problem-solving.

A Non-Dominated Sorting Genetic Algorithm Approach for Optimization of Multi-Objective Airport Gate Assignment Problem

2018 ◽  
Vol 2672 (23) ◽  
pp. 59-70 ◽  
Author(s):  
Seyedmirsajad Mokhtarimousavi ◽  
Danial Talebi ◽  
Hamidreza Asgari
Keyword(s):  
Genetic Algorithm ◽  
Decision Making ◽  
Supply And Demand ◽  
Multiple Criteria Decision Making ◽  
Financial Loss ◽  
Nsga Ii ◽  
Solution Approach ◽  
Multi Objective ◽  
Wide Range ◽  
Gate Assignment

Gate assignment problems (GAP) are one of the most substantial issues in airport operation. The ever-increasing demand producing high occupancy rates of gates, the potential financial loss from imbalances between supply and demand in congested airports, and the limited scope for expanding facilities present challenges that require an advanced methodology for optimal supply allocation. In principle, tackling GAP involves seeking to maintain an airport’s maximum capacity through the best possible allocation of resources (gates). There are a wide range of dependent and independent resources and limitations involved in the problem, adding to the complexity of GAP from both theoretical and practical perspectives. In this study, GAP is extended and mathematically formulated as a three-objective problem, taking into account all resources and restrictions, which can be directly linked to airport authorities’ multiple criteria decision-making processes. The preliminary goal of multi-objective formulation is to consider a wider scope, in which a higher number of objectives are simultaneously optimized, and thus to increase the practical efficiency of the final solution. The problem is solved by applying the second version of Non-dominated Sorting Genetic Algorithm (NSGA-II) as a parallel evolutionary optimization algorithm. Results illustrate that the proposed mathematical model could address most of the major criteria in the decision-making process in airport management in terms of passenger walking distances, robustness, and traditional costs. Moreover, the proposed solution approach shows promise in finding acceptable and plausible solutions compared with other multi-objective algorithms (BAT, PSO, ACO, and ABC).

Multi-Objective Design Optimization for Product Platform and Product Family Design Using Genetic Algorithms

2005 ◽  
Author(s):  
Satish V. K. Akundi ◽  
Timothy W. Simpson ◽  
Patrick M. Reed
Keyword(s):  
Genetic Algorithm ◽  
Decision Making ◽  
Genetic Algorithms ◽  
Product Family ◽  
Optimization Techniques ◽  
Product Platform ◽  
Product Family Design ◽  
Nsga Ii ◽  
Pareto Solution ◽  
Multi Objective

Many companies are using product families and platform-based product development to reduce costs and time-to-market while increasing product variety and customization. Multi-objective optimization is increasingly becoming a powerful tool to support product platform and product family design. In this paper, a genetic algorithm-based optimization method for product family design is suggested, and its application is demonstrated using a family of universal electric motors. Using an appropriate representation for the design variables and by adopting a suitable formulation for the genetic algorithm, a one-stage approach for product family design can be realized that requires no a priori platform decision-making, eliminating the need for higher-level problem-specific domain knowledge. Optimizing product platforms using multi-objective algorithms gives the designer a Pareto solution set, which can be used to make better decisions based on the trade-offs present across different objectives. Two Non-Dominated Sorting Genetic Algorithms, namely, NSGA-II and ε-NSGA-II, are described, and their performance is compared. Implementation challenges associated with the use of these algorithms are also discussed. Comparison of the results with existing benchmark designs suggests that the proposed multi-objective genetic algorithms perform better than conventional single-objective optimization techniques, while providing designers with more information to support decision making during product family design.

scholarly journals Elite Exploitation: A Combination of Mathematical Concept and EMO Approach for Multi-Objective Decision Making

Symmetry ◽  
2021 ◽  
Vol 13 (1) ◽  
pp. 136
Author(s):  
Wenxiao Li ◽  
Yushui Geng ◽  
Jing Zhao ◽  
Kang Zhang ◽  
Jianxin Liu
Keyword(s):  
Decision Making ◽  
Optimization Problems ◽  
Hybrid Genetic Algorithm ◽  
Decision Makers ◽  
Superior Performance ◽  
Test Problems ◽  
Mathematical Function ◽  
Hyperbolic Tangent ◽  
Nsga Ii ◽  
Multi Objective

This paper explores the combination of a classic mathematical function named “hyperbolic tangent” with a metaheuristic algorithm, and proposes a novel hybrid genetic algorithm called NSGA-II-BnF for multi-objective decision making. Recently, many metaheuristic evolutionary algorithms have been proposed for tackling multi-objective optimization problems (MOPs). These algorithms demonstrate excellent capabilities and offer available solutions to decision makers. However, their convergence performance may be challenged by some MOPs with elaborate Pareto fronts such as CFs, WFGs, and UFs, primarily due to the neglect of diversity. We solve this problem by proposing an algorithm with elite exploitation strategy, which contains two parts: first, we design a biased elite allocation strategy, which allocates computation resources appropriately to elites of the population by crowding distance-based roulette. Second, we propose a self-guided fast individual exploitation approach, which guides elites to generate neighbors by a symmetry exploitation operator, which is based on mathematical hyperbolic tangent function. Furthermore, we designed a mechanism to emphasize the algorithm’s applicability, which allows decision makers to adjust the exploitation intensity with their preferences. We compare our proposed NSGA-II-BnF with four other improved versions of NSGA-II (NSGA-IIconflict, rNSGA-II, RPDNSGA-II, and NSGA-II-SDR) and four competitive and widely-used algorithms (MOEA/D-DE, dMOPSO, SPEA-II, and SMPSO) on 36 test problems (DTLZ1–DTLZ7, WGF1–WFG9, UF1–UF10, and CF1–CF10), and measured using two widely used indicators—inverted generational distance (IGD) and hypervolume (HV). Experiment results demonstrate that NSGA-II-BnF exhibits superior performance to most of the algorithms on all test problems.

scholarly journals Analisis Perbandingan Aggregat Of Function (AOF) dengan Non-Dominated Sorting Genetic Algorithm (NSGA-II) dalam Menentukan Optimasi Multi-Objective pada Penjadwalan Mesin Produksi Flow Shop

2018 ◽  
Vol 17 (2) ◽  
pp. 158
Author(s):  
Fifin Sonata ◽  
Dede Prabowo Wiguna
Keyword(s):  
Genetic Algorithm ◽  
Flow Shop ◽  
Total Tardiness ◽  
Pareto Optimal ◽  
Nsga Ii ◽  
Trade Off ◽  
Multi Objective

Penjadwalan mesin produksi dalam dunia industri memiliki peranan penting sebagai bentuk pengambilan keputusan. Salah satu jenis sistem penjadwalan mesin produksi adalah sistem penjadwalan mesin produksi tipe flow shop. Dalam penjadwalan flow shop, terdapat sejumlah pekerjaan (job) yang tiap-tiap job memiliki urutan pekerjaan mesin yang sama. Optimasi penjadwalan mesin produksi flow shop berkaitan dengan penyusunan penjadwalan mesin yang mempertimbangkan 2 objek yaitu makespan dan total tardiness. Optimasi kedua permasalahan tersebut merupakan optimasi yang bertolak belakang sehingga diperlukan model yang mengintegrasikan permasalahan tersebut dengan optimasi multi-objective A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimazitaion : NSGA-II. Dalam penelitian ini akan dibandingkan 2 buah metode yaitu Aggregat Of Function (AOF) dengan NSGA-II agar dapat terlihat nilai solusinya. Penyelesaian penjadwalan mesin produksi flow shop dengan algoritma NSGA-II untuk membangun jadwal dengan meminimalkan makespan dan total tardiness.Tujuan yang ingin dicapai adalah mengetahui bahwa model yang dikembangkan akan memberikan solusi penjadwalan mesin produksi flow shop yang efisien berupa solusi pareto optimal yang dapat memberikan sekumpulan solusi alternatif bagi pengambil keputusan dalam membuat penjadwalan mesin produksi yang diharapkan. Solusi pareto optimal yang dihasilkan merupakan solusi optimasi multi-objective yang optimal dengan trade-off terhadap seluruh objek, sehingga seluruh solusi pareto optimal sama baiknya.

Kinematic Multi-Objective Optimization of Circular-Toothed Gerotor Pumps by Genetic Algorithm

2017 ◽  
Author(s):  
Andrew J. Robison ◽  
Andrea Vacca
Keyword(s):  
Genetic Algorithm ◽  
Design Method ◽  
Third Party ◽  
Low Flow ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Generation Algorithm ◽  
Multi Objective ◽  
Pareto Curve

A gerotor gear generation algorithm has been developed that evaluates key performance objective functions to be minimized or maximized, and then an optimization algorithm is applied to determine the best design. Because of their popularity, circular-toothed gerotors are the focus of this study, and future work can extend this procedure to other gear forms. Parametric equations defining the circular-toothed gear set have been derived and implemented. Two objective functions were used in this kinematic optimization: maximize the ratio of displacement to pump radius, which is a measure of compactness, and minimize the kinematic flow ripple, which can have a negative effect on system dynamics and could be a major source of noise. Designs were constrained to ensure drivability, so the need for additional synchronization gearing is eliminated. The NSGA-II genetic algorithm was then applied to the gear generation algorithm in modeFRONTIER, a commercial software that integrates multi-objective optimization with third-party engineering software. A clear Pareto front was identified, and a multi-criteria decision-making genetic algorithm was used to select three optimal designs with varying priorities of compactness vs low flow variation. In addition, three pumps used in industry were scaled and evaluated with the gear generation algorithm for comparison. The scaled industry pumps were all close to the Pareto curve, but the optimized designs offer a slight kinematic advantage, which demonstrates the usefulness of the proposed gerotor design method.

Multi-objective integrated planning and scheduling model for operating rooms under uncertainty

2018 ◽  
Vol 232 (9) ◽  
pp. 930-948 ◽  
Author(s):  
Javad Ansarifar ◽  
Reza Tavakkoli-Moghaddam ◽  
Faezeh Akhavizadegan ◽  
Saman Hassanzadeh Amin
Keyword(s):  
Genetic Algorithm ◽  
Decision Making ◽  
Particle Swarm Optimization ◽  
Heuristic Algorithms ◽  
Particle Swarm ◽  
Operating Rooms ◽  
Programming Approach ◽  
Test Problems ◽  
Swarm Optimization ◽  
Multi Objective

This article formulates the operating rooms considering several constraints of the real world, such as decision-making styles, multiple stages for surgeries, time windows for resources, and specialty and complexity of surgery. Based on planning, surgeries are assigned to the working days. Then, the scheduling part determines the sequence of surgeries per day. Moreover, an integrated fuzzy possibilistic–stochastic mathematical programming approach is applied to consider some sources of uncertainty, simultaneously. Net revenues of operating rooms are maximized through the first objective function. Minimizing a decision-making style inconsistency among human resources and maximizing utilization of operating rooms are considered as the second and third objectives, respectively. Two popular multi-objective meta-heuristic algorithms including Non-dominated Sorting Genetic Algorithm and Multi-Objective Particle Swarm Optimization are utilized for solving the developed model. Moreover, different comparison metrics are applied to compare the two proposed meta-heuristics. Several test problems based on the data obtained from a public hospital located in Iran are used to display the performance of the model. According to the results, Non-dominated Sorting Genetic Algorithm-II outperforms the Multi-Objective Particle Swarm Optimization algorithm in most of the utilized metrics. Moreover, the results indicate that our proposed model is more effective and efficient to schedule and plan surgeries and assign resources than manual scheduling.

Sign in / Sign up

Export Citation Format

Share Document