scholarly journals A Comprehensive Study on Metaheuristic Techniques Using Genetic Approach

2019 ◽  
Vol 7 (8) ◽  
pp. 23-31
Author(s):  
G. Kalyani ◽  
K. Krishna Jyothi ◽  
T. Pratyusha
Keyword(s):  
Pareto Front ◽  
Optimization Problems ◽  
Real Life ◽  
Decision Makers ◽  
Benchmark Problems ◽  
Multiple Decision Makers ◽  
Trade Offs ◽  
Solution Methods ◽  
Metaheuristic Techniques ◽  
Comprehensive Study

Most real-life optimization problems involve multiple objective functions. Finding  a  solution  that  satisfies  the  decision-maker  is  very  difficult  owing  to  conflict  between  the  objectives.  Furthermore,  the  solution  depends  on  the  decision-maker’s preference.  Metaheuristic solution methods have become common tools to solve these problems.  The  task  of  obtaining  solutions  that  take  account  of  a  decision-maker’s preference  is  at  the  forefront  of  current  research.  It  is  also  possible  to  have  multiple decision-makers with different preferences and with different  decision-making  powers. It may not be easy to express a preference using crisp numbers. In this study, the preferences of multiple decision-makers were simulated  and  a solution based on  a genetic  algorithm was  developed  to  solve  multi-objective  optimization  problems.  The  preferences  were collected  as  fuzzy  conditional  trade-offs  and  they  were  updated  while  running  the algorithm interactively with the decision-makers. The proposed method was tested using well-known benchmark problems.  The solutions were found to converge around the Pareto front of the problems.

scholarly journals Comparing interactive evolutionary multiobjective optimization methods with an artificial decision maker

2021 ◽  
Author(s):  
Bekir Afsar ◽  
Ana B. Ruiz ◽  
Kaisa Miettinen
Keyword(s):  
Multiobjective Optimization ◽  
Decision Maker ◽  
Optimization Problems ◽  
Optimization Methods ◽  
Decision Makers ◽  
Interactive Methods ◽  
Preference Information ◽  
Evolutionary Methods ◽  
Solution Processes ◽  
Trade Offs

AbstractSolving multiobjective optimization problems with interactive methods enables a decision maker with domain expertise to direct the search for the most preferred trade-offs with preference information and learn about the problem. There are different interactive methods, and it is important to compare them and find the best-suited one for solving the problem in question. Comparisons with real decision makers are expensive, and artificial decision makers (ADMs) have been proposed to simulate humans in basic testing before involving real decision makers. Existing ADMs only consider one type of preference information. In this paper, we propose ADM-II, which is tailored to assess several interactive evolutionary methods and is able to handle different types of preference information. We consider two phases of interactive solution processes, i.e., learning and decision phases separately, so that the proposed ADM-II generates preference information in different ways in each of them to reflect the nature of the phases. We demonstrate how ADM-II can be applied with different methods and problems. We also propose an indicator to assess and compare the performance of interactive evolutionary methods.

Optimization of Shell and Tube Heat Exchanger Using Alpha Tuning Elephant Herding Optimization (EHO) Technique

2021 ◽  
Vol 52 ◽  
pp. 92-101
Author(s):  
Jiten Makadia ◽  
C.D. Sankhavara
Keyword(s):  
Particle Swarm Optimization ◽  
Heat Exchanger ◽  
Optimization Problems ◽  
Cost Optimization ◽  
Real Life ◽  
Particle Swarm ◽  
Benchmark Problems ◽  
Swarm Optimization ◽  
Tube Heat Exchanger ◽  
Shell And Tube

Swarm Intelligence algorithms like PSO (Particle Swarm Optimization), ACO (Ant Colony Optimization), ABC (Artificial Bee Colony), Glow-worm swarm Optimization, etc. have been utilized by researchers for solving optimization problems. This work presents the application of a novel modified EHO (Elephant Herding Optimization) for cost optimization of shell and tube heat exchanger. A comparison of the results obtained by EHO in two benchmark problems shows that it is superior to those obtained with genetic algorithm and particle swarm optimization. The overall cost reduction is 13.3 % and 9.68% for both the benchmark problem compared to PSO. Results indicate that EHO can be effectively utilized for solving real-life optimization problems.

scholarly journals Optimization using evolutionary metaheuristic techniques: a brief review

2018 ◽  
Vol 15 (1) ◽  
pp. 44-53 ◽  
Author(s):  
Sajja Radhika ◽  
Aparna Chaparala
Keyword(s):  
Optimization Problems ◽  
Real Life ◽  
Multi Objective Optimization ◽  
Swarm Optimization ◽  
Multi Objective ◽  
Life Problems ◽  
Evolutionary Metaheuristic ◽  
Teaching Learning Based Optimization ◽  
Metaheuristic Techniques ◽  
Teaching Learning

Optimization is necessary for finding appropriate solutions to a range of real life problems. Evolutionary-approach-based meta-heuristics have gained prominence in recent years for solving Multi Objective Optimization Problems (MOOP). Multi Objective Evolutionary Approaches (MOEA) has substantial success across a variety of real-world engineering applications. The present paper attempts to provide a general overview of a few selected algorithms, including genetic algorithms, ant colony optimization, particle swarm optimization, and simulated annealing techniques. Additionally, the review is extended to present differential evolution and teaching-learning-based optimization. Few applications of the said algorithms are also presented. This review intends to serve as a reference for further work in this domain.

scholarly journals Hierarchical multilevel optimization with multiple-leaders multiple-followers setting and nonseparable objectives

2021 ◽  
Vol 55 (5) ◽  
pp. 2915-2939
Author(s):  
Addis Belete Zewde ◽  
Semu Mitiku Kassa
Keyword(s):  
Decision Makers ◽  
Multilevel Optimization ◽  
Equal Status ◽  
Multiple Decision Makers ◽  
Decision Variables ◽  
Solution Methods ◽  
Upper Level ◽  
Parametric Algorithm ◽  
Multiple Followers ◽  
Hierarchical Multilevel Optimization

Hierarchical multilevel multi-leader multi-follower problems are non-cooperative decision problems in which multiple decision-makers of equal status in the upper-level and multiple decision-makers of equal status are involved at each of the lower-levels of the hierarchy. Much of solution methods proposed so far on the topic are either model specific which may work only for a particular sub-class of problems or are based on some strong assumptions and only for two level cases. In this paper, we have considered hierarchical multilevel multi-leader multi-follower problems in which the objective functions contain separable and non-separable terms (but the non-separable terms can be written as a factor of two functions, a function which depends on other level decision variables and a function which is common to all objectives across the same level) and shared constraint. We have proposed a solution algorithm to such problems by equivalent reformulation as a hierarchical multilevel problem involving single decision maker at all levels of the hierarchy. Then, we applied a multi-parametric algorithm to solve the resulting single leader single followers problem.

scholarly journals Comparative Study of Knee-Based Algorithms for Many-Objective Optimization Problems

2018 ◽  
Vol 12 (1) ◽  
pp. 7-16
Author(s):  
Saad M. Alzahrani ◽  
Naruemon Wattanapongsakorn
Keyword(s):  
Optimization Problems ◽  
Benchmark Problems ◽  
Multi Objective Optimization ◽  
Trade Off ◽  
Knee Region ◽  
Multi Objective ◽  
Trade Offs ◽  
Conflicting Objectives ◽  
Small Set ◽  
Optimum Solution

Nowadays, most real-world optimization problems consist of many and often conflicting objectives to be optimized simultaneously. Although, many current Multi-Objective optimization algorithms can efficiently solve problems with 3 or less objectives, their performance deteriorates proportionally with the increasing of the objectives number. Furthermore, in many situations the decision maker (DM) is not interested in all trade-off solutions obtained but rather interested in a single optimum solution or a small set of those trade-offs. Therefore, determining an optimum solution or a small set of trade-off solutions is a difficult task. However, an interesting method for finding such solutions is identifying solutions in the Knee region. Solutions in the Knee region can be considered the best obtained solution in the obtained trade-off set especially if there is no preference or equally important objectives. In this paper, a pruning strategy was used to find solutions in the Knee region of Pareto optimal fronts for some benchmark problems obtained by NSGA-II, MOEA/D-DE and a promising new Multi-Objective optimization algorithm NSGA-III. Lastly, those knee solutions found were compared and evaluated using a generational distance performance metric, computation time and a statistical one-way ANOVA test.

Collective intelligence approaches in interactive evolutionary multi-objective optimization

2020 ◽  
Vol 28 (1) ◽  
pp. 95-108 ◽  
Author(s):  
Daniel Cinalli ◽  
Luis Martí ◽  
Nayat Sanchez-Pi ◽  
Ana Cristina Bicharra Garcia
Keyword(s):  
Collective Intelligence ◽  
Real Life ◽  
Decision Makers ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Trade Offs ◽  
Life Problems ◽  
Conflicting Objectives ◽  
Optimal Set

Abstract Evolutionary multi-objective optimization algorithms (EMOAs) have been successfully applied in many real-life problems. EMOAs approximate the set of trade-offs between multiple conflicting objectives, known as the Pareto optimal set. Reference point approaches can alleviate the optimization process by highlighting relevant areas of the Pareto set and support the decision makers to take the more confident evaluation. One important drawback of this approaches is that they require an in-depth knowledge of the problem being solved in order to function correctly. Collective intelligence has been put forward as an alternative to deal with situations like these. This paper extends some well-known EMOAs to incorporate collective preferences and interactive techniques. Similarly, two new preference-based multi-objective optimization performance indicators are introduced in order to analyze the results produced by the proposed algorithms in the comparative experiments carried out.

Archive of Useful Solutions for Directed Mating in Evolutionary Constrained Multiobjective Optimization

2014 ◽  
Vol 18 (2) ◽  
pp. 221-231 ◽  
Author(s):  
Minami Miyakawa ◽  
◽  
Keiki Takadama ◽  
Hiroyuki Sato
Keyword(s):  
Pareto Front ◽  
Optimization Problems ◽  
Selection Process ◽  
Benchmark Problems ◽  
Search Performance ◽  
Next Generation ◽  
Multi Objective ◽  
Objective Space ◽  
Feasible Solutions ◽  
Constrained Multiobjective Optimization

As an evolutionary approach to solve multi-objective optimization problems involving several constraints, recently a multi-objective evolutionary algorithm (MOEA) using two-stage non-dominated sorting and directed mating (TNSDM) has been proposed. In TNSDM, directed mating utilizes infeasible solutions dominating feasible solutions in the objective space to generate offspring. In our previous studies, significant contribution of directed mating to the improvement of the search performancewas verified on several benchmark problems. However, in the conventional TNSDM, infeasible solutions utilized in directed mating are discarded in the selection process of parents (elites) population and cannot be utilized in the next generation. TNSDM has potential to further improve the search performance by archiving useful solutions for directed mating to the next generation and repeatedly utilizing them in directed mating. To further improve effects of directed mating in TNSDM, in this work, we propose an archiving strategy of useful solutions for directed mating. We verify the search performance of TNSDM using the proposed archive by varying the size of archive, and compare its search performance with the conventional CNSGA-II and RTS onmobjectiveskknapsacks problems. As results, we show that the search performance of TNSDM is improved by introducing the proposed archive in aspects of diversity of the obtained solutions in the objective space and convergence of solutions toward the optimal Pareto front.

Hyperplane-Approximation-Based Method for Many-Objective Optimization Problems with Redundant Objectives

2019 ◽  
Vol 27 (2) ◽  
pp. 313-344
Author(s):  
Yifan Li ◽  
Hai-Lin Liu ◽  
E. D. Goodman
Keyword(s):  
Pareto Front ◽  
Optimization Problems ◽  
Approximation Error ◽  
Main Idea ◽  
Benchmark Problems ◽  
Performance Metric ◽  
Dominance Structure ◽  
Objective Reduction ◽  
Pareto Fronts ◽  
Linearly Degenerate

For a many-objective optimization problem with redundant objectives, we propose two novel objective reduction algorithms for linearly and, nonlinearly degenerate Pareto fronts. They are called LHA and NLHA respectively. The main idea of the proposed algorithms is to use a hyperplane with non-negative sparse coefficients to roughly approximate the structure of the PF. This approach is quite different from the previous objective reduction algorithms that are based on correlation or dominance structure. Especially in NLHA, in order to reduce the approximation error, we transform a nonlinearly degenerate Pareto front into a nearly linearly degenerate Pareto front via a power transformation. In addition, an objective reduction framework integrating a magnitude adjustment mechanism and a performance metric [Formula: see text] are also proposed here. Finally, to demonstrate the performance of the proposed algorithms, comparative experiments are done with two correlation-based algorithms, LPCA and NLMVUPCA, and with two dominance-structure-based algorithms, PCSEA and greedy [Formula: see text]MOSS, on three benchmark problems: DTLZ5(I,M), MAOP(I,M), and WFG3(I,M). Experimental results show that the proposed algorithms are more effective.

Applying CI in Biology through PSO

2020 ◽  
pp. 502-527
Author(s):  
Rojalina Priyadarshini ◽  
Nilamadhab Dash ◽  
Brojo Kishore Mishra ◽  
Rachita Misra
Keyword(s):  
Optimization Problems ◽  
Real Life ◽  
Population Based ◽  
Computing Methods ◽  
Future Research ◽  
Natural Systems ◽  
Solution Methods ◽  
Working Together ◽  
Future Research Directions ◽  
Population Based Algorithm

Conventional computing methods face challenges dealing with real world problems, which are characterised by noisy or incomplete data. To find solutions for such problems, natural systems have evolved over the years and on analysis it has been found these contain many simple elements when working together to solve real life complex problems. Swarm Intelligence (SI) is one of the techniques which is inspired by nature and is a population based algorithm motivated by the collective behaviour of a group of social insects. Particle swarm optimization (PSO) is one of the techniques belonging to this group, used to solve some optimization problems. This chapter will discuss some of the problems existing in computational biology, their contemporary solution methods followed by the use of PSO to address those problems. Along with this several applications of PSO are discussed in few of the relevant fields are discussed having some future research directions on this field.

Adaptive Control of Dominance Area of Solutions in Evolutionary Many-Objective Optimization

2015 ◽  
Vol 11 (02) ◽  
pp. 135-150 ◽  
Author(s):  
Kouhei Tomita ◽  
Minami Miyakawa ◽  
Hiroyuki Sato
Keyword(s):  
Pareto Front ◽  
Optimization Problems ◽  
Benchmark Problems ◽  
Pareto Optimal ◽  
Search Performance ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Pareto Dominance ◽  
Nsga Ii ◽  
Convergence Of Solutions

Controlling the dominance area of solutions (CDAS) relaxes the concept of Pareto dominance with an user-defined parameter S. CDAS with S < 0.5 expands the dominance area and improves the search performance of multi-objective evolutionary algorithms (MOEAs) especially in many-objective optimization problems (MaOPs) by enhancing convergence of solutions toward the optimal Pareto front. However, there is a problem that CDAS with an expanded dominance area (S < 0.5) generally cannot approximate entire Pareto front. To overcome this problem we propose an adaptive CDAS (A-CDAS) that adaptively controls the dominance area of solutions during the solutions search. Our method improves the search performance in MaOPs by approximating the entire Pareto front while keeping high convergence. In early generations, A-CDAS tries to converge solutions toward the optimal Pareto front by using an expanded dominance area with S < 0.5. When we detect convergence of solutions, we gradually increase S and contract the dominance area of solutions to obtain Pareto optimal solutions (POS) covering the entire optimal Pareto front. We verify the effectiveness and the search performance of the proposed A-CDAS on concave and convex DTLZ3 benchmark problems with 2–8 objectives, and show that the proposed A-CDAS achieves higher search performance than conventional non-dominated sorting genetic algorithm II (NSGA-II) and CDAS with an expanded dominance area.

Sign in / Sign up

Export Citation Format

Share Document