Improved S-CDAS using Crossover Controlling the Number of Crossed Genes for Many-objective Optimization
|
|
- Calvin Sims
- 6 years ago
- Views:
Transcription
1 Improved S-CDAS using Crossover Controlling the Number of Crossed Genes for Many-objective Optimization Hiroyuki Sato Faculty of Informatics and Engineering, The University of Electro-Communications -5- Chofugaoka, Chofu, Tokyo, JAPAN Hernán E. Aguirre Faculty of Engineering, Shinshu University 4-7- Wakasato, Nagano, JAPAN Kiyoshi Tanaka Faculty of Engineering, Shinshu University 4-7- Wakasato, Nagano, JAPAN ABSTRACT Self-controlling dominance area of solutions (S-CDAS) reclassifies solutions in each front obtained by non-domination sorting to realize fine-grained ranking of solutions and improve the search performance of multi-objective evolutionary algorithms (MOEAs) in many-objective optimization problems (MaOPs). In this work, we further improve search performance of S-CDAS in MaOPs by analyzing genetic diversity in many-objective problems and enhancing crossover operators. First, we analyze genetic diversity in the population and the contribution of the conventional genetic operators when we increase the number of objectives, showing that the genetic diversity in the population significantly increases and offspring created by conventional crossover come to be not selected as parents because the operator becomes too disruptive and its effectiveness decrease. To overcome this problem, we implement crossover controlling the number of crossed genes (CCG) in S- CDAS and verify its effectiveness. Through performance verification using many-objective knapsack problems with 4 0 objectives, we show that the search performance of S-CDAS noticeably improves when we restrict the number of crossed genes. Also, we show that the effectiveness of CCG operator becomes significant as we increase the number of objectives. Furthermore, we show that offspring created by CCG are selected as parents more often than conventional crossover. Categories and Subject Descriptors I.2.8 [Artificial Intelligence]: Problem Solving, Control Methods, and Search Heuristic methods; G..6 [Numerical Analysis]: Optimization General Terms Algorithms, Design, Performance Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. GECCO, July 2 6, 20, Dublin, Ireland. Copyright 20 ACM //07...$0.00. Keywords Evolutionary many-objective optimization, self-control of dominance area of solutions, control of the number of crossed genes. INTRODUCTION The research interest of the multi-objective evolutionary algorithm (MOEA) [] community has rapidly shifted to develop effective algorithms for many-objective optimization problems (MaOPs) because more objective functions should be considered and optimized in recent complex applications. However, in general, MOEAs noticeably deteriorate their search performance as we increase the number of objectives to more than 4 [2, 3], especially Pareto dominancebased MOEAs such as NSGA-II [4] and SPEA2 [5]. This is because these MOEAs meet difficulty to rank solutions in the population, i.e., most of the solutions become non-dominated and the same rank is assigned to them, which seriously spoils proper selection pressure required in the evolution process[6, 7]. To overcome this problem, CDAS [8] relaxes the concepts of Pareto dominance by controlling dominance area of solutions using an user-defined parameter S to induce appropriate selection pressure in MOEA. CDAS achieves higher search performance in MaOP than NSGA- II [4] due to convergence by the effects of fine grained ranking of solutions using S < 0.5 [9]. Also, as a modification of CDAS, self-controlling dominance area of solutions (S-CDAS) has been proposed [0]. S-CDAS self-controls dominance areas without the need of an external parameter. Through performance verification using many-objective 0/ knapsack problems with 0 objectives, S-CDAS has shown that well-balanced search performance on both convergence and diversity compared to NSGA-II [4], IBEA ϵ+ [], MSOPS [2] and conventional CDAS with optimal parameter S [0]. In this work, we further improve search performance of S-CDAS in MaOPs by analyzing genetic diversity in many-objective problems and enhancing crossover operators. First, we analyze genetic diversity in the population and the contribution of the conventional genetic operators when we increase the number of objectives, showing that the genetic diversity in the population significantly increases and offspring created by conventional crossover come to be not selected as parents because the operator becomes too disruptive and its effectiveness decrease. To overcome this problem and enhance the search performance of S-CDAS in MaOPs, we apply controlling the number of crossed genes (CCG) [2] as crossover operator in S-CDAS. CCG TX, extension of two-point crossover, controls the maximum length of crossed genes by using the user-defined parameter α t. Also, CCG UX, extension of uniform crossover, controls the number of crossed genes by parameter α u. We verify the effec- 753
2 p 2 E 2 φ 2 (x) l 2 (x) rank += x p 2 F F F 2 F f 2 Solutions dominated by x rank += l (x) f 2 F 2 ω 2 (x) r(x) rank += F 3 F ω (x) φ (x) O=(O, O 2 ) f p O=(O, O 2 ) f E F p Figure : Reclassification of solutions in F by S-CDAS [0] Figure 2: Front classification by S-CDAS [0] tiveness of CCG TX and CCG UX in S-CDAS on many-objective 0/ knapsack problems with m = {4, 6, 8, 0} objectives. Also, we analyze the contribution of CCG for solutions search by observing the number of offsprings selected in parent population. 2. SELF-CONTROLLING DOMINANCE AREA OF SOLUTIONS (S-CDAS) S-CDAS [0] reclassifies solutions in each front F j (j =, 2, ) obtained by non-domination sorting [4] to realize fine-grained ranking, achieving well-converged solutions while keeping well-distributed solutions in the population. S-CDAS self-controls dominance area for each solution without using an external parameter using the procedure [0] described below. Fig. shows the illustration of the reclassification by S-CDAS. Step : Move the origin to O = (O, O 2,, O m ) in objective space. In this work, we set O i = fi min δ (i =, 2,, m), where fi min is the minimum value of the i-th objective function in F j and δ is a tiny constant value. Step 2: Create a set of landmark vectors L = {p, p 2,, p m }, where p i = (O, O 2,, fi max δ,, O m ), and fi max denotes the maximum value of the i-th objective function, which is derived from the extreme solution E i (i =, 2,, m) having the maximum fitness value for each objective function in F j. Step 3: Repeat the following calculation for all solutions in F j. Step 3-: For a single solution x, calculate φ(x) = (φ (x), φ 2(x),, φ m(x)) by Eq.() derived from sine theorem. Here, φ i(x) is the angle determined by the solution x and the landmark vector p i in the i-th objective function. φ(x) determines the individual dominance area of x, which does never dominate extreme solutions E i. φ i (x) = sin { r(x) sin(ωi(x)) l i(x) } (i =, 2,, m), where l i(x) is Euclidean distance between the solution x and the landmark vector p i. Step 3-2: Modify fitness values of all other solutions y F j by the following equation f i (y) = r(y) sin(ω i(y) + φ i (x)) sin(φ i(x)) (i =, 2,, m). Step 3-3: Check dominance relations between the solution x and all other solutions y F j. If a solution y F j is dominated by x, the counter (rank) of y is incremented. Step 4: Finally, reclassify all the solutions in F j based on the accumulated rank values, i.e., smaller rank corresponds to higher front, and larger rank corresponds to lower front. When multiple solutions have a same rank value, they are included in the same front. In S-CDAS, reclassification procedure is performed for each nondominated front F j (j =, 2, ) obtained by NSGA-II. That is, S-CDAS makes front distribution fine-grained, but superiority of each solution is never overturned by S-CDAS. In other words, superiority of solutions in fronts obtained by NSGA-II is maintained even after the reclassification by S-CDAS. Fig.2 shows that an example of reclassified fronts by S-CDAS, where all solutions area included in F by the classification of NSGA-II. We can see that different three fronts F, F 2 and F 3 are obtained by reclassification of S-CDAS. Also, S-CDAS always guarantees the inclusion of extreme solutions in F. In other words, in S-CDAS, not only highly converged solutions but also widely distributed ones are classified into higher front. () (2) 754
3 Average Hamming Distance n= 00 n= 250 n= 500 n= 750 n=000 Number of offspring selected in P t m= 2 m= 4 m= 6 m= 8 m= m (Number of objectives) Figure 3: Average hamming distance of solutions in the population obtained by S-CDAS using the conventional two-point crossover Figure 4: Number of offsprings selected in P t by S-CDAS using the conventional two-point crossover (n = 500) After the reclassification of all fronts, S-CDAS selects parent solutions P t from higher fronts until filling up the half size of entire population similar to NSGA-II [4]. Also, to create offspring solutions, the crowded tournament selection is applied [4]. 3. ANALYSIS ON CONTRIBUTIONS OF GE- NETIC OPERATORS IN S-CDAS To further enhance the search performance of S-CDAS in MaOPs, here we analyze the genetic diversity in the population and contributions of genetic operator for solutions search when we perform S-CDAS with conventional two-point crossover. Here, we use the population size N = 200 (parent population P t = 00, offspring population Q t = 00), crossover ratio P c =.0, and apply bit-flipping mutation with probability P m = /n. We compare the average in 30 runs and each run spend 2,000 generations. Also, we use many-objective knapsack problem [5] with m = {2, 4, 6, 8, 0} objectives and n = {00, 250, 500, 750, 000} items (bits). First, Fig.3 shows average hamming distance of solutions in the population evolved by S-CDAS with two-point crossover at the final generation. From this result, we can see that the average hamming distance of solutions in the population significantly increases by increasing the number of objectives m. That is, the genetic diversity in the population becomes noticeably diverse, and the population come to be widely distributed in the solution space by increasing the number of objectives m. In the case of m = 0 objectives and n =, 000 bits, note that the average hamming distance becomes around 75 bits at the final generation. In this case, if we randomly select two solutions from the population as parents, they will be different in 75 bits out of,000 bits. Thus, since diversity of genes in the population obtained by S-CDAS is significantly high in MaOPs, the likelihood that the conventional recombination becomes too disruptive is also high, making it an inefficient genetic operator for solutions search. Next, Fig.4 shows that transition of the number of offsprings selected as parent population P t when we perform S-CDAS with conventional two-point crossover. From the result, we can see that the number of offsprings survived through extinctive selection substantially decreases by increasing the number of objectives m. This result suggests that the contribution of conventional genetic operation for solutions search substantially deteriorates in MaOPs due to increasing the genetic diversity in the population as shown in Fig IMPROVED S-CDAS USING CONTROL- LING CROSSED GENES FOR CROSSOVER 4. Motivation In S-CDAS, if genes of solutions in the population become noticeably diverse in MaOPs, conventional crossover become too disruptive and inefficient genetic operation which create inferior offsprings. To solve this problem and realize efficient genetic operation, in this work we propose an improved S-CDAS which apply controlling the number of crossed genes (CCG) [2] as crossover operator. CCG crossover can control the number of crossed genes by using the user-defined parameter α, which maintain most of parent s gene structure in offspring and avoid too disruptive genetic operation. For the population having well-diverse gene structure, improved S-CDAS introduces CCG crossover to create offsprings can be survived through parent selection. In this section we introduce CCG for two-point crossover (CCG TX ) and uniform crossover (CCG UX ). 4.2 CCG for Two-point Crossover (CCG TX) When we apply the conventional one- or two-point crossover for individuals with n genes, the length of crossed genes vary in the range [0, n] by randomly chosen the crossover point(s). To restrict the variation of genes in crossover for parents having large difference in gene structure, in this work we propose controlling crossed genes (CCG) for crossover. In this section we explain CCG for twopoint crossover (CCG TX ). CCG TX controls the length of crossed genes by using a user-defined parameter α t. Fig.5 shows the conceptual diagram of CCG TX. First we randomly select parents A and B from the parent population P t, and randomly choose the st crossover point p. Then, we randomly determine the length of the crossed genes l in the range [0, α t n]. In the case of p + l n, the second crossover point is set to p 2 = p + l. In the case of p + l > n, the second crossover point is set to p 2 = p + l n. Here, the possible range of the parameter α t is [0.0,.0]. In this method, when we utilize a small α t, the length of crossed segment becomes short. On the other hand, a large α t indicates a 755
4 A B Parents Offsprings p p 2 p p 2 l α n t bits n bits A B Figure 5: CCG for two-point crossover (CCG TX ) A Mask B Parents set with probability α t n bits A B Offsprings Figure 6: CCG for uniform crossover (CCG UX ) long crossed segment. In the case of α t = 0.0, since the length of the crossed segment becomes α t n = 0, the solutions search is equivalent to only mutation without crossover. Also, in the case of α t =.0, the maximum length of the crossed segment become α t n = n. This case is equivalent to the conventional two-point crossover. In this work we verify the effects of CCG TX in MOEA varying α t in the range α t [0.0,.0]. 4.3 CCG for Uniform Crossover (CCG UX ) Next, we explain a method for CCG in uniform crossover (CCG UX ). As shown in Fig.6, for uniform crossover we randomly select two parents from the parent population and generate a n bit mask [3, 4]. For offspring A, if mask bit is 0, the gene is copied from parent A. If mask bit is, the gene is copied from parent B. Similarly, for offspring B, if mask bit is 0, the gene is copied from parent B. If mask bit is, the gene is copied from parent A. To control the number of crossed genes, in this work we control the probability of in the mask by using the parameter α u. The possible range of α u is [0, ], and α u = 0.5 indicates typical uniform crossover [3]. In this method, when we utilize a small α u, the number of crossed genes becomes small. On the other hand, when we utilize a large α u, the number of crossed genes becomes large. α u = 0.0 is equivalent to only mutation without crossover. Also, α u =.0 is equivalent to α u = 0.0 because all gene are exchanged in this crossover. In this work we verify the effects of CCG UX in MOEA varying α u in the range α u [0.0, 0.5] 5. PREPARATION 5. Algorithms and Selection Methods In this work, we implement CCG in S-CDAS [2] and compare the search performance with NSGA-II [4] and IBEA ϵ+ []. NSGA-II is dominance based MOEAs that use Pareto dominance to determine the superiority of solutions in parent selection. IBEA ϵ+ (Indicator-based Evolutionary Algorithm) introduces fine grained ranking of solutions by calculating fitness value based on the indicator I ϵ+ which measure the degree of superiority for each solution in the population []. 5.2 Problems, Parameters and Metrics In this paper we use many-objective 0/ knapsack problems [5] as benchmark problem. We generate problems with m = {2, 4, 6, 8, 0} objectives, n = 500 items (bits), and feasibility ratio ϕ = 0.5. For all algorithms to be compared, we adopt crossover with a crossover rate P c =.0, and apply bit-flipping mutation with a mutation rate P m = /n. In the following experiments, we show the average performance with 30 runs, each of which spent T = 2, 000 generations. Population size is set to N = 200 ( P t = Q t = 00). In IBEA ϵ+, scaling parameter κ is set to 0.05 similar to []. In this work, to evaluate the search performance of MOEAs we use HV, which measures the m-dimensional volume of the region enclosed by the obtained non-dominated solutions and a dominated reference point r in objective space. In this work we use r = (0, 0,, 0) as the reference point, while varying the reference point could lead to different absolute values of hypervolume. Obtained Pareto optimal solutions (POS) showing a higher value of hypervolume can be considered as a better set of solutions from both convergence and diversity viewpoints. To calculate the hypervolume, we use the improved dimension-sweep algorithm proposed by Fonseca et al. [6], which significantly reduces computational time especially for large m. To provide additional information separately on convergence and diversity of the obtained POS, in this work we also use Norm [7] and Maximum Spread (MS) [8], respectively. Higher value of Norm generally means higher convergence to true POS. Although Norm cannot precisely reflect (catch up) local features of the distribution of the obtained POS, we can observe the general tendency of POS from their values. On the other hand, higher MS indicates better diversity in POS, i.e. a widely spread Pareto front. 6. EXPERIMENTAL RESULTS AND DISCUS- SION 6. Effects of CCG TX in S-CDAS First, we verify the search performance of S-CDAS using CCG TX as we vary the parameter α t and the number of objectives m. Fig.7 shows results of HV as comprehensive metric, Norm as measure of convergence, and MS as measure of diversity of obtained POS. CCG TX with α t =.0 is equivalent to the conventional two-point crossover. The maximum length of crossed genes become short by decreasing α t. In these figures, all the plots are normalized by the results of NSGA-II using the conventional two-point crossover. First, from the result of Fig.7 (a), we can see that values of HV noticeably improve by decreasing α t to restrict the maximum number of crossed genes short. Also, the effectiveness becomes more significant by increasing the number of objectives m. Note that the optimal parameter to maximize the value of HV is α t = 0.03 for all objectives problem. In this case, the length of crossed genes is randomly determined in the range [0, α t n = 5]. Since the maximum length of crossed genes in conventional two-point crossover is n = 500 bits, this result reveals that the search performance of S- CDAS noticeably improves when we restrict the maximum length of crossed genes extremely short in MaOPs. The value of HV depends on the location of r. When we set r near from the obtained solutions, convergence is emphasized in HV calculation. On the other hand, when we set r far from the obtained solutions, diversity is emphasized. 756
5 .5.4 m = m = 0 Hypervolume.3.2 Norm.02 MS 0.9. m = α t α t α t (a) HV (b) Norm (c) MS Figure 7: Performance obtained by improved S-CDAS using CCG TX (n = 500) Hypervolume m = 0 Norm MS. 0.9 m = 0..0 m = α u α u α u (a) HV (b) Norm (c) MS Figure 8: Performance obtained by improved S-CDAS using CCG UX (n = 500) Next, from result of Fig.7 (b), values of Norm improve and the convergence of obtained POS is enhanced by decreasing α t in m 6 objectives problem. Also, similar to the result of HV, the improvement of convergence by CCG TX becomes significant by increasing m. Furthermore, from the result of Fig.7 (c), values of MS improve and the diversity of obtained POS enhances by decreasing α t. Summarizing, S-CDAS using CCG TX operator with a small α t improves convergence and diversity of obtained POS in MaOPs. Consequently, appreciably high HV is obtained and their effectiveness becomes larger as m increases. 6.2 Effects of CCG UX in S-CDAS Next, we verify the search performance of S-CDAS using CCG UX as we vary the parameter α u and the number of objectives m. Fig.8 show results of HV, Norm and MS. CCG UX with α u = 0.5 is equivalent to typical uniform crossover. The number of crossed genes becomes small by decreasing α u. Similar to the previous section, all the plots are normalized by the results of NSGA-II using the conventional two-point crossover. From Fig.8, results obtained by CCG UX have similar tendency to results obtained by CCG TX discussed in previous section. From results of Fig.8 (a), we can see that values of HV noticeably improve by decreasing α u. The optimal parameter to maximize the value of HV is α u = 0.0 for all objectives problem. In this case, the number of crossed genes becomes α u n = 5 bits for each crossover operation. Similar to CCG TX, values of HV significantly improve by restricting the number of crossed genes and their effectiveness becomes large by increasing m. Entirely, CCG UX achieves higher HV with higher convergence than CCG TX while diversity of POS obtained by CCG TX and CCG UX is nearly equivalent. 6.3 Comparison with Conventional MOEAs Next, we compare the search performance of S-CDAS using CCG operators with S-CDAS, NSGA-II and IBEA ϵ+ using conventional two-point and uniform crossover. Fig.9 shows results of HV, Norm and MS when we apply conventional two-point crossover and CCG TX. Also, Fig.0 shows results when we apply typical uniform crossover and CCG UX. For these figures, we plot results of S-CDAS using CCG with the optimal αt and αu maximizing the value of HV. Also, similar to previous sections, all the results are normalized by the results obtained by NSGA-II using conventional two-point crossover. First, from the result of Fig.9 (a), when we use the conventional 757
6 .7.6 Conv. NSGA-II (Two-point crossover) Conv. IBEA ε+ (Two-point crossover). Conv. NSGA-II (Two-point crossover) Conv. IBEA ε+ (Two-point crossover) Hypervolume Norm.05 Maximum Spread Conv. NSGA-II (Two-point crossover) Conv. IBEA ε+ (Two-point crossover) (a) HV (b) Norm (c) MS Figure 9: Performance comparison of MOEAs using the conventional two-point crossover and improved S-CDAS using CCG TX.7.6 Conv. NSGA-II (Uniform crossover) Conv. IBEA ε+ (Uniform crossover). Conv. NSGA-II (Uniform crossover) Conv. IBEA ε+ (Uniform crossover) Hypervolume Norm.05 Maximum Spread Conv. NSGA-II (Uniform crossover) Conv. IBEA ε+ (Uniform crossover) (a) HV (b) Norm (c) MS Figure 0: Performance comparison of MOEAs using the conventional uniform crossover and improved S-CDAS using CCG UX two-point crossover, we can see that S-CDAS and IBEA ϵ+ realizing fine-grained ranking achieve higher HV than NSGA-II by increasing the number of objectives m. IBEA ϵ+ achieves extremely high convergence of obtained POS but least diversity instead. Although NSGA-II shows highest diversity, convergence becomes the lowest. Consequently, NSGA-II shows the lowest HV in MOEAs compared in Fig.9. On the other hand, since S-CDAS using conventional two-point crossover achieves a well-balanced search between convergence and diversity, S-CDAS shows better HV than NSGA-II and IBEA ϵ+. Moreover, we can see that S-CDAS using CCG TX significantly improves HV. Note that the improvement by introducing CCG TX is higher than the one achieved by enhancing selection alone either through S-CDAS using conventional twopoint crossover or through IBEA ϵ+. Next, from Fig.9 (b), values of Norm improve by applying CCG TX in m 8 objectives problems. Furthermore, from Fig.9 (c), we can see that CCG TX work to improve MS and diversity of POS in the objective space. Next, Fig.0 obtained by CCG UX shows similar tendency to Fig.9 obtained by CCG TX. Although values of Norm obtained by S- CDAS using CCG UX are lower than S-CDAS using typical uniform crossover, S-CDAS using CCG UX achieves higher MS and obtain well-distributed solutions than S-CDAS using CCG TX. Consequently, we can see that S-CDAS using CCG UX achieves higher HV than S-CDAS using CCG TX. 7. ANALYSIS OF SOLUTIONS SEARCH BY IMPROVED S-CDAS USING CCG TX AND CCG UX Here, we analyze solutions search using CCG TX and CCG UX operators. To observe the variation of genes by conventional twopoint, uniform crossover and CCG, Fig. shows transition of average hamming distance between parent and offspring on the problem with objectives and n = 500 items (bits). For CCG TX and CCG UX, we use the optimal parameter α t and α u. When we compare conventional crossovers, we can see that average hamming distance between parent and offspring by two-point crossover is longer than uniform crossover. This is because, although typical uniform crossover exchanges around n/2 bits for each crossover, the length of crossed genes vary in the range [0, n] in the conventional two-point crossover. On the other hand, by applying CCG operators controlling the number of crossed genes, we can see that average hamming distance between parent and offspring 758
7 Average hamming distance Average hamming distance Figure : Transition of average hamming distance between parent and offspring (n = 500 items, objectives) Figure 2: Transition of average hamming distance of solutions in the population (n = 500 items, objectives) Number of offspring selected in P t Number of offspring selected in P t Figure 3: Number of offspring selected in P t (n = 500 items, objectives) Figure 4: Number of offspring selected in P t (n = 500 items, objectives) become significantly short and variation of genes in crossover become small. Next, Fig.2 shows transition of average hamming distance of solutions in the population when we apply conventional two-point, uniform crossover and CCG operators in S-CDAS. From this result, we can see that the average hamming distance of the population obtained by conventional two-point and uniform crossover decreases and deteriorate the genetic diversity in early stage of evolution. On the other hand, the average hamming distance of solutions in the population by CCG operators increases. From this result, we can see that CCG operators enhance the search performance of S-CDAS widely search in the solutions space by decreasing the number of crossed genes. Finally, to analyze the contribution of CCG TX and CCG UX for solutions search, we observe transition of the number of offsprings selected in parent population P t. Fig.3 shows the result obtained by S-CDAS using the conventional two-point crossover and CCG TX with optimal α t. Also, Fig.4 shows the result when we perform typical uniform crossover and CCG UX with optimal αu. From these results, we can see that the number of offsprings created by CCG operators is larger than conventional two-point and uniform crossover. These results reveal that CCG TX and CCG UX can create well-selected offsprings as parent population compare to conventional two-point and uniform crossovers. 8. CONCLUSIONS In this work, to further improve the search performance of MOEA using self-controlling dominance area of solutions (S-CDAS) in many-objective optimization problems, first we analyzed the genetic diversity in the population evolved by S-CDAS and the contribution of the conventional genetic operators when we increase the number of objectives m. As result, we showed that genetic diversity in the population significantly increases and offspring created by conventional crossover come to be not selected as parent by increasing the number of objectives m. In MOEAs, if genes of solutions in the population become noticeably diverse, conventional recombination might become too disruptive and decrease its effectiveness. To overcome this problem and enhance the evolutionary many-objective optimization by S-CDAS, we implemented CCG TX and CCG UX which control the number of crossed genes (CCG) in S-CDAS and verified its effectiveness. Through performance verification using many-objective knapsack problems with 759
8 4 0 objectives, we showed that the search performance of S- CDAS noticeably improves when we restrict the number of crossed genes short. Also, we showed that the effectiveness of CCG operator becomes significant as we increase the number of objectives m. Furthermore, we showed that offsprings created by CCG are selected as parents more times than conventional crossover. As future work, we want to design an algorithm to adaptively control parameters αt and α u during solutions search. Also, we are planning to study the effective crossover operators on manyobjective continuous optimization problems. Furthermore, we will enhance the algorithm of S-CDAS through the performance verification on problems having continuous variables or non-convex Pareto front. 9. REFERENCES [] K. Deb, Multi-Objective Optimization using Evolutionary Algorithms, John Wiley & Sons, 200. [2] E. J. Hughes, Evolutionary Many-Objective Optimisation: Many Once or One Many?, Proc IEEE Congress on Evolutionary Computation (CEC2005), pp , [3] H. Aguirre and K. Tanaka, Working Principles, Behavior, and Performance of MOEAs on MNK-Landscapes, European Journal of Operational Research, Vol. 8, Issue 3, pp , [4] K. Deb, S. Agrawal, A. Pratap and T. Meyarivan, A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II, KanGAL report 20000, [5] E. Zitzler, M. Laumanns and L. Thiele: SPEA2: Improving the Strength Pareto Evolutionary Algorithm, TIK-Report, No.03, 200. [6] H. Ishibuchi, N. Tsukamoto, and Y. Nojima, Evolutionary many-objective optimization: A short review, Proc IEEE Congress on Evolutionary Computation (CEC2008), pp , [7] T. Wagner, N. Beume and B. Naujoks, Pareto-, Aggregation-, and Indicator-Based Methods in Many-Objective Optimization, Proc. 4th Intl. Conf. on Evolutionary Multi-Criterion Optimization (EMO2007), pp , [8] H. Sato, H. Aguirre and K. Tanaka, Controlling Dominance Area of Solutions and Its Impact on the Performance of MOEAs, Proc. 4th Intl. Conf. Evolutionary Multi-Criterion Optimization (EMO 2006), LNCS, Vol.4403, pp.5 20, [9] H. Sato, H. Aguirre and K. Tanaka, Effect of Controlling Dominance Area of Solutions in MOEAs on Convex Problems with Many Objectives, Proc. 7th Intl. Conf. on Optimization: Techniques and Applications (ICOTA7), in CD-ROM, [0] H. Sato, H. Aguirre and K. Tanaka, Self-Controlling Dominance Area of Solutions in Evolutionary Many-objective Optimization, Proc. 8th Intl. Conf. on Simulated Evolution and Learning (SEAL200), LNCS, Vol.6457, pp , 200. [] E. Zitzler, S. Kunzili, Indicator-Based Selection in Multiobjective Search, Proc. 8th Intl. Conf. on Parallel Problem Solving from Nature (PPSN-VIII), LNCS Vol.3242, pp , [2] H. Sato, H. Aguirre and K. Tanaka, Genetic Diversity and Effective Crossover in Evolutionary Many-objective Optimization, Proc. 5th Intl. Conf. on Learning and Intelligent Optimization (LION 5), LNCS, 20, (to appear). [3] Syswerda, G., Uniform Crossover in Genetic Algorithms, Proc. 3rd Intl. Conf. on Genetic Algorithms (ICGA89), pp. 2 9, 989. [4] W. Spears and K.A. De Jong, An analysis of multi-point crossover, Proc. Foundations of Genetic Algorithms, 990. [5] E. Zitzler and L. Thiele, Multiobjective optimization using evolutionary algorithms a comparative case study, Proc. 5th Intl. Conf. on Parallel Problem Solving from Nature (PPSN-V), LNCS Vol.498, pp , 998. [6] C. Fonseca, L. Paquete, and M. López-Ibáñez, An Improved Dimension-sweep Algorithm for the Hypervolume Indicator, Proc IEEE Congress on Evolutionary Computation (CEC2006), pp.57-63, [7] M. Sato, H. Aguirre, K. Tanaka, Effects of δ-similar Elimination and Controlled Elitism in the NSGA-II Multiobjective Evolutionary Algorithm, Proc IEEE Congress on Evolutionary Computation (CEC2006), pp , [8] E. Zitzler, Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications, PhD thesis, Swiss Federal Institute of Technology, Zurich,
Comparison of Evolutionary Multiobjective Optimization with Reference Solution-Based Single-Objective Approach
Comparison of Evolutionary Multiobjective Optimization with Reference Solution-Based Single-Objective Approach Hisao Ishibuchi Graduate School of Engineering Osaka Prefecture University Sakai, Osaka 599-853,
More informationLamarckian Repair and Darwinian Repair in EMO Algorithms for Multiobjective 0/1 Knapsack Problems
Repair and Repair in EMO Algorithms for Multiobjective 0/ Knapsack Problems Shiori Kaige, Kaname Narukawa, and Hisao Ishibuchi Department of Industrial Engineering, Osaka Prefecture University, - Gakuen-cho,
More informationRecombination of Similar Parents in EMO Algorithms
H. Ishibuchi and K. Narukawa, Recombination of parents in EMO algorithms, Lecture Notes in Computer Science 341: Evolutionary Multi-Criterion Optimization, pp. 265-279, Springer, Berlin, March 25. (Proc.
More informationIncorporation of Scalarizing Fitness Functions into Evolutionary Multiobjective Optimization Algorithms
H. Ishibuchi, T. Doi, and Y. Nojima, Incorporation of scalarizing fitness functions into evolutionary multiobjective optimization algorithms, Lecture Notes in Computer Science 4193: Parallel Problem Solving
More informationUsing ɛ-dominance for Hidden and Degenerated Pareto-Fronts
IEEE Symposium Series on Computational Intelligence Using ɛ-dominance for Hidden and Degenerated Pareto-Fronts Heiner Zille Institute of Knowledge and Language Engineering University of Magdeburg, Germany
More informationA Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization
A Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization Hisao Ishibuchi and Youhei Shibata Department of Industrial Engineering, Osaka Prefecture University, - Gakuen-cho, Sakai,
More informationMulti-objective Optimization
Jugal K. Kalita Single vs. Single vs. Single Objective Optimization: When an optimization problem involves only one objective function, the task of finding the optimal solution is called single-objective
More informationAn Analysis on Selection for High-Resolution Approximations in Many-Objective Optimization
An Analysis on Selection for High-Resolution Approximations in Many-Objective Optimization Hernan Aguirre, Arnaud Liefooghe, Sébastien Verel, Kiyoshi Tanaka To cite this version: Hernan Aguirre, Arnaud
More informationROBUST MULTI-OBJECTIVE OPTIMIZATION OF WATER DISTRIBUTION NETWORKS
ROBUST MULTI-OBJECTIVE OPTIMIZATION OF WATER DISTRIBUTION NETWORKS Taishi Ohno, Hernán Aguirre, Kiyoshi Tanaka Faculty of Engineering, Shinshu University, Wakasato, Nagano-shi, Japan 15tm209f@shinshu-u.ac.jp,
More informationApproximation-Guided Evolutionary Multi-Objective Optimization
Approximation-Guided Evolutionary Multi-Objective Optimization Karl Bringmann 1, Tobias Friedrich 1, Frank Neumann 2, Markus Wagner 2 1 Max-Planck-Institut für Informatik, Campus E1.4, 66123 Saarbrücken,
More informationNCGA : Neighborhood Cultivation Genetic Algorithm for Multi-Objective Optimization Problems
: Neighborhood Cultivation Genetic Algorithm for Multi-Objective Optimization Problems Shinya Watanabe Graduate School of Engineering, Doshisha University 1-3 Tatara Miyakodani,Kyo-tanabe, Kyoto, 10-031,
More informationFinding Sets of Non-Dominated Solutions with High Spread and Well-Balanced Distribution using Generalized Strength Pareto Evolutionary Algorithm
16th World Congress of the International Fuzzy Systems Association (IFSA) 9th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT) Finding Sets of Non-Dominated Solutions with High
More informationEVOLUTIONARY algorithms (EAs) are a class of
An Investigation on Evolutionary Gradient Search for Multi-objective Optimization C. K. Goh, Y. S. Ong and K. C. Tan Abstract Evolutionary gradient search is a hybrid algorithm that exploits the complementary
More informationSPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2
SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2 Mifa Kim 1, Tomoyuki Hiroyasu 2, Mitsunori Miki 2, and Shinya Watanabe 3 1 Graduate School, Department of Knowledge Engineering
More informationR2-IBEA: R2 Indicator Based Evolutionary Algorithm for Multiobjective Optimization
R2-IBEA: R2 Indicator Based Evolutionary Algorithm for Multiobjective Optimization Dũng H. Phan Department of Computer Science University of Massachusetts, Boston Boston, MA 02125, USA Email: phdung@cs.umb.edu
More informationA Search Method with User s Preference Direction using Reference Lines
A Search Method with User s Preference Direction using Reference Lines Tomohiro Yoshikawa Graduate School of Engineering, Nagoya University, Nagoya, Japan, {yoshikawa}@cse.nagoya-u.ac.jp Abstract Recently,
More informationEvolutionary Algorithms: Lecture 4. Department of Cybernetics, CTU Prague.
Evolutionary Algorithms: Lecture 4 Jiří Kubaĺık Department of Cybernetics, CTU Prague http://labe.felk.cvut.cz/~posik/xe33scp/ pmulti-objective Optimization :: Many real-world problems involve multiple
More informationUsing Different Many-Objective Techniques in Particle Swarm Optimization for Many Objective Problems: An Empirical Study
International Journal of Computer Information Systems and Industrial Management Applications ISSN 2150-7988 Volume 3 (2011) pp.096-107 MIR Labs, www.mirlabs.net/ijcisim/index.html Using Different Many-Objective
More informationA Predictive Pareto Dominance Based Algorithm for Many-Objective Problems
10 th World Congress on Structural and Multidisciplinary Optimization May 19-24, 2013, Orlando, Florida, USA A Predictive Pareto Dominance Based Algorithm for Many-Objective Problems Edgar Galvan 1, Erin
More informationIndicator-Based Selection in Multiobjective Search
Indicator-Based Selection in Multiobjective Search Eckart Zitzler and Simon Künzli Swiss Federal Institute of Technology Zurich Computer Engineering and Networks Laboratory (TIK) Gloriastrasse 35, CH 8092
More informationMulti-Objective Optimization using Evolutionary Algorithms
Multi-Objective Optimization using Evolutionary Algorithms Kalyanmoy Deb Department of Mechanical Engineering, Indian Institute of Technology, Kanpur, India JOHN WILEY & SONS, LTD Chichester New York Weinheim
More informationDEMO: Differential Evolution for Multiobjective Optimization
DEMO: Differential Evolution for Multiobjective Optimization Tea Robič and Bogdan Filipič Department of Intelligent Systems, Jožef Stefan Institute, Jamova 39, SI-1000 Ljubljana, Slovenia tea.robic@ijs.si
More informationMulti-Objective Optimization using Evolutionary Algorithms
Multi-Objective Optimization using Evolutionary Algorithms Kalyanmoy Deb Department ofmechanical Engineering, Indian Institute of Technology, Kanpur, India JOHN WILEY & SONS, LTD Chichester New York Weinheim
More informationAn Evolutionary Many Objective Optimisation Algorithm with Adaptive Region Decomposition
1 An Evolutionary Many Objective Optimisation Algorithm with Adaptive Region Decomposition Hai-Lin Liu, Lei Chen, Qingfu Zhang, Senior Member, IEEE and Kalyanmoy Deb, Fellow, IEEE COIN Report Number 016014
More informationAn Evolutionary Multi-Objective Crowding Algorithm (EMOCA): Benchmark Test Function Results
Syracuse University SURFACE Electrical Engineering and Computer Science College of Engineering and Computer Science -0-005 An Evolutionary Multi-Objective Crowding Algorithm (EMOCA): Benchmark Test Function
More informationInvestigating the Effect of Parallelism in Decomposition Based Evolutionary Many-Objective Optimization Algorithms
Investigating the Effect of Parallelism in Decomposition Based Evolutionary Many-Objective Optimization Algorithms Lei Chen 1,2, Kalyanmoy Deb 2, and Hai-Lin Liu 1 1 Guangdong University of Technology,
More informationA Fast Approximation-Guided Evolutionary Multi-Objective Algorithm
A Fast Approximation-Guided Evolutionary Multi-Objective Algorithm Markus Wagner and Frank Neumann Evolutionary Computation Group School of Computer Science The University of Adelaide Adelaide, SA 5005,
More informationMechanical Component Design for Multiple Objectives Using Elitist Non-Dominated Sorting GA
Mechanical Component Design for Multiple Objectives Using Elitist Non-Dominated Sorting GA Kalyanmoy Deb, Amrit Pratap, and Subrajyoti Moitra Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute
More informationGECCO 2007 Tutorial / Evolutionary Multiobjective Optimization. Eckart Zitzler ETH Zürich. weight = 750g profit = 5.
Tutorial / Evolutionary Multiobjective Optimization Tutorial on Evolutionary Multiobjective Optimization Introductory Example: The Knapsack Problem weight = 75g profit = 5 weight = 5g profit = 8 weight
More informationMulti-objective Optimization
Some introductory figures from : Deb Kalyanmoy, Multi-Objective Optimization using Evolutionary Algorithms, Wiley 2001 Multi-objective Optimization Implementation of Constrained GA Based on NSGA-II Optimization
More informationPerformance Assessment of DMOEA-DD with CEC 2009 MOEA Competition Test Instances
Performance Assessment of DMOEA-DD with CEC 2009 MOEA Competition Test Instances Minzhong Liu, Xiufen Zou, Yu Chen, Zhijian Wu Abstract In this paper, the DMOEA-DD, which is an improvement of DMOEA[1,
More informationTHIS PAPER proposes a hybrid decoding to apply with
Proceedings of the 01 Federated Conference on Computer Science and Information Systems pp. 9 0 Biased Random Key Genetic Algorithm with Hybrid Decoding for Multi-objective Optimization Panwadee Tangpattanakul
More informationLate Parallelization and Feedback Approaches for Distributed Computation of Evolutionary Multiobjective Optimization Algorithms
Late arallelization and Feedback Approaches for Distributed Computation of Evolutionary Multiobjective Optimization Algorithms O. Tolga Altinoz Department of Electrical and Electronics Engineering Ankara
More informationDCMOGADES: Distributed Cooperation model of Multi-Objective Genetic Algorithm with Distributed Scheme
: Distributed Cooperation model of Multi-Objective Genetic Algorithm with Distributed Scheme Tamaki Okuda, Tomoyuki HIROYASU, Mitsunori Miki, Jiro Kamiura Shinaya Watanabe Department of Knowledge Engineering,
More informationResearch Article Evolutionary Multiobjective Optimization including Practically Desirable Solutions
Hindawi Advances in Operations Research Volume 7, Article ID 99454, 6 pages https://doi.org/.55/7/99454 Research Article Evolutionary Multiobjective Optimization including Practically Desirable Solutions
More informationImproved Pruning of Non-Dominated Solutions Based on Crowding Distance for Bi-Objective Optimization Problems
Improved Pruning of Non-Dominated Solutions Based on Crowding Distance for Bi-Objective Optimization Problems Saku Kukkonen and Kalyanmoy Deb Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute
More informationFinding a preferred diverse set of Pareto-optimal solutions for a limited number of function calls
Finding a preferred diverse set of Pareto-optimal solutions for a limited number of function calls Florian Siegmund, Amos H.C. Ng Virtual Systems Research Center University of Skövde P.O. 408, 541 48 Skövde,
More informationComparing Algorithms, Representations and Operators for the Multi-Objective Knapsack Problem
Comparing s, Representations and Operators for the Multi-Objective Knapsack Problem Gualtiero Colombo School of Computer Science Cardiff University United Kingdom G.Colombo@cs.cardiff.ac.uk Christine L.
More informationMultiobjective Formulations of Fuzzy Rule-Based Classification System Design
Multiobjective Formulations of Fuzzy Rule-Based Classification System Design Hisao Ishibuchi and Yusuke Nojima Graduate School of Engineering, Osaka Prefecture University, - Gakuen-cho, Sakai, Osaka 599-853,
More informationReference Point-Based Particle Swarm Optimization Using a Steady-State Approach
Reference Point-Based Particle Swarm Optimization Using a Steady-State Approach Richard Allmendinger,XiaodongLi 2,andJürgen Branke University of Karlsruhe, Institute AIFB, Karlsruhe, Germany 2 RMIT University,
More informationOptimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows
Optimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows Abel Garcia-Najera and John A. Bullinaria School of Computer Science, University of Birmingham Edgbaston, Birmingham
More informationEffects of Discrete Design-variable Precision on Real-Coded Genetic Algorithm
Effects of Discrete Design-variable Precision on Real-Coded Genetic Algorithm Toshiki Kondoh, Tomoaki Tatsukawa, Akira Oyama, Takeshi Watanabe and Kozo Fujii Graduate School of Engineering, Tokyo University
More informationEliteNSGA-III: An Improved Evolutionary Many- Objective Optimization Algorithm
EliteNSGA-III: An Improved Evolutionary Many- Objective Optimization Algorithm Amin Ibrahim, IEEE Member Faculty of Electrical, Computer, and Software Engineering University of Ontario Institute of Technology
More informationSolving Multi-objective Optimisation Problems Using the Potential Pareto Regions Evolutionary Algorithm
Solving Multi-objective Optimisation Problems Using the Potential Pareto Regions Evolutionary Algorithm Nasreddine Hallam, Graham Kendall, and Peter Blanchfield School of Computer Science and IT, The Univeristy
More informationInternational Conference on Computer Applications in Shipbuilding (ICCAS-2009) Shanghai, China Vol.2, pp
AUTOMATIC DESIGN FOR PIPE ARRANGEMENT CONSIDERING VALVE OPERATIONALITY H Kimura, Kyushu University, Japan S Iehira, Kyushu University, Japan SUMMARY We propose a novel evaluation method of valve operationality
More informationIncrementally Maximising Hypervolume for Selection in Multi-objective Evolutionary Algorithms
Incrementally Maximising Hypervolume for Selection in Multi-objective Evolutionary Algorithms Lucas Bradstreet, Student Member, IEEE, Lyndon While, Senior Member, IEEE, and Luigi Barone, Member, IEEE Abstract
More informationAn External Archive Guided Multiobjective Evolutionary Approach Based on Decomposition for Continuous Optimization
IEEE Congress on Evolutionary Computation (CEC) July -,, Beijing, China An External Archive Guided Multiobjective Evolutionary Approach Based on Decomposition for Continuous Optimization Yexing Li School
More informationEvolutionary multi-objective algorithm design issues
Evolutionary multi-objective algorithm design issues Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical Information Technology Karthik.sindhya@jyu.fi
More informationBayesian Optimization Algorithms for Multi-Objective Optimization
Bayesian Optimization Algorithms for Multi-Objective Optimization Marco Laumanns 1 and Jiri Ocenasek 2 1 ETH Zürich, Computer Engineering and Networks Laboratory, CH 8092 Zürich laumanns@tik.ee.ethz.ch
More informationA Performance Comparison Indicator for Pareto Front Approximations in Many-Objective Optimization
A Performance Comparison Indicator for Pareto Front Approximations in Many-Objective Optimization Miqing Li Department of Computer Science Brunel University London Uxbridge UB8 3PH, U. K. miqing.li@brunel.ac.uk
More informationMechanical Component Design for Multiple Objectives Using Elitist Non-Dominated Sorting GA
Mechanical Component Design for Multiple Objectives Using Elitist Non-Dominated Sorting GA Kalyanmoy Deb, Amrit Pratap, and Subrajyoti Moitra Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute
More informationReference Point Based Evolutionary Approach for Workflow Grid Scheduling
Reference Point Based Evolutionary Approach for Workflow Grid Scheduling R. Garg and A. K. Singh Abstract Grid computing facilitates the users to consume the services over the network. In order to optimize
More informationMultiobjective Prototype Optimization with Evolved Improvement Steps
Multiobjective Prototype Optimization with Evolved Improvement Steps Jiri Kubalik 1, Richard Mordinyi 2, and Stefan Biffl 3 1 Department of Cybernetics Czech Technical University in Prague Technicka 2,
More informationMultiobjective Optimization Using Adaptive Pareto Archived Evolution Strategy
Multiobjective Optimization Using Adaptive Pareto Archived Evolution Strategy Mihai Oltean Babeş-Bolyai University Department of Computer Science Kogalniceanu 1, Cluj-Napoca, 3400, Romania moltean@cs.ubbcluj.ro
More informationEfficient Non-domination Level Update Approach for Steady-State Evolutionary Multiobjective Optimization
Efficient Non-domination Level Update Approach for Steady-State Evolutionary Multiobjective Optimization Ke Li 1, Kalyanmoy Deb 1, Qingfu Zhang 2, and Sam Kwong 2 1 Department of Electrical and Computer
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
More informationEvolutionary Computation
Evolutionary Computation Lecture 9 Mul+- Objec+ve Evolu+onary Algorithms 1 Multi-objective optimization problem: minimize F(X) = ( f 1 (x),..., f m (x)) The objective functions may be conflicting or incommensurable.
More informationGeneralized Multiobjective Evolutionary Algorithm Guided by Descent Directions
DOI.7/s852-4-9255-y Generalized Multiobjective Evolutionary Algorithm Guided by Descent Directions Roman Denysiuk Lino Costa Isabel Espírito Santo Received: August 23 / Accepted: 9 March 24 Springer Science+Business
More informationA Distance Metric for Evolutionary Many-Objective Optimization Algorithms Using User-Preferences
A Distance Metric for Evolutionary Many-Objective Optimization Algorithms Using User-Preferences Upali K. Wickramasinghe and Xiaodong Li School of Computer Science and Information Technology, RMIT University,
More informationDevelopment of Evolutionary Multi-Objective Optimization
A. Mießen Page 1 of 13 Development of Evolutionary Multi-Objective Optimization Andreas Mießen RWTH Aachen University AVT - Aachener Verfahrenstechnik Process Systems Engineering Turmstrasse 46 D - 52056
More informationAvailable online at ScienceDirect. Procedia Computer Science 60 (2015 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 60 (2015 ) 178 187 19th International Conference on Knowledge Based and Intelligent Information and Engineering Systems
More informationAdaptive Crossover in Genetic Algorithms Using Statistics Mechanism
in Artificial Life VIII, Standish, Abbass, Bedau (eds)(mit Press) 2002. pp 182 185 1 Adaptive Crossover in Genetic Algorithms Using Statistics Mechanism Shengxiang Yang Department of Mathematics and Computer
More informationApproximation Model Guided Selection for Evolutionary Multiobjective Optimization
Approximation Model Guided Selection for Evolutionary Multiobjective Optimization Aimin Zhou 1, Qingfu Zhang 2, and Guixu Zhang 1 1 Each China Normal University, Shanghai, China 2 University of Essex,
More informationMulti-Objective Memetic Algorithm using Pattern Search Filter Methods
Multi-Objective Memetic Algorithm using Pattern Search Filter Methods F. Mendes V. Sousa M.F.P. Costa A. Gaspar-Cunha IPC/I3N - Institute of Polymers and Composites, University of Minho Guimarães, Portugal
More informationSPEA2: Improving the strength pareto evolutionary algorithm
Research Collection Working Paper SPEA2: Improving the strength pareto evolutionary algorithm Author(s): Zitzler, Eckart; Laumanns, Marco; Thiele, Lothar Publication Date: 2001 Permanent Link: https://doi.org/10.3929/ethz-a-004284029
More informationFinding Knees in Multi-objective Optimization
Finding Knees in Multi-objective Optimization Jürgen Branke 1, Kalyanmoy Deb 2, Henning Dierolf 1, and Matthias Osswald 1 1 Institute AIFB, University of Karlsruhe, Germany branke@aifb.uni-karlsruhe.de
More informationEffectiveness and efficiency of non-dominated sorting for evolutionary multi- and many-objective optimization
Complex Intell. Syst. (217) 3:247 263 DOI 1.17/s4747-17-57-5 ORIGINAL ARTICLE Effectiveness and efficiency of non-dominated sorting for evolutionary multi- and many-objective optimization Ye Tian 1 Handing
More informationBio-inspired Optimization and Design
Eckart Zitzler Computer Engineering and Networks Laboratory Introductory Example: The Knapsack Problem weight = 750g profit = 5 weight = 1500g profit = 8 weight = 300g profit = 7 weight = 1000g profit
More informationEmpirical Performance of the Approximation of the Least Hypervolume Contributor
Empirical Performance of the Approximation of the Least Hypervolume Contributor Krzysztof Nowak 1,MarcusMärtens 2, and Dario Izzo 1 1 European Space Agency, Noordwijk, The Netherlands 2 TU Delft, Delft,
More informationCHAPTER 6 REAL-VALUED GENETIC ALGORITHMS
CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS 6.1 Introduction Gradient-based algorithms have some weaknesses relative to engineering optimization. Specifically, it is difficult to use gradient-based algorithms
More informationTwo Heuristic Operations to Improve the Diversity of Two-objective Pareto Solutions
Two Heuristic Operations to Improve the Diversity of Two-objective Pareto Solutions Rinku Dewri and Darrell Whitley Computer Science, Colorado State University Fort Collins, CO 80524 {rinku,whitley}@cs.colostate.edu
More informationImproved Crowding Distance for NSGA-II
Improved Crowding Distance for NSGA-II Xiangxiang Chu and Xinjie Yu Department of Electrical Engineering, Tsinghua University, Beijing84, China Abstract:Non-dominated sorting genetic algorithm II (NSGA-II)
More informationComputational Intelligence
Computational Intelligence Winter Term 2016/17 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund Slides prepared by Dr. Nicola Beume (2012) Multiobjective
More informationMULTI-objective optimization problems (MOPs),
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL., NO., MONTH YEAR An Indicator Based Multi-Objective Evolutionary Algorithm with Reference Point Adaptation for Better Versatility Ye Tian, Ran Cheng,
More informationCommunication Strategies in Distributed Evolutionary Algorithms for Multi-objective Optimization
CONTI 2006 The 7 th INTERNATIONAL CONFERENCE ON TECHNICAL INFORMATICS, 8-9 June 2006, TIMISOARA, ROMANIA Communication Strategies in Distributed Evolutionary Algorithms for Multi-objective Optimization
More information1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra
Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation
More informationThe Genetic Algorithm for finding the maxima of single-variable functions
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding
More informationMetaheuristics for the Bi-objective Ring Star Problem
Metaheuristics for the Bi-objective Ring Star Problem Arnaud Liefooghe 1, Laetitia Jourdan 1, Matthieu Basseur 2, El-Ghazali Talbi 1, and Edmund K. Burke 2 1 INRIA-Futurs, LIFL, CNRS Université des Sciences
More informationUsing an outward selective pressure for improving the search quality of the MOEA/D algorithm
Comput Optim Appl (25) 6:57 67 DOI.7/s589-5-9733-9 Using an outward selective pressure for improving the search quality of the MOEA/D algorithm Krzysztof Michalak Received: 2 January 24 / Published online:
More informationRevisiting the NSGA-II Crowding-Distance Computation
Revisiting the NSGA-II Crowding-Distance Computation Félix-Antoine Fortin felix-antoine.fortin.1@ulaval.ca Marc Parizeau marc.parizeau@gel.ulaval.ca Laboratoire de vision et systèmes numériques Département
More informationAn Experimental Multi-Objective Study of the SVM Model Selection problem
An Experimental Multi-Objective Study of the SVM Model Selection problem Giuseppe Narzisi Courant Institute of Mathematical Sciences New York, NY 10012, USA narzisi@nyu.edu Abstract. Support Vector machines
More informationGENERIC SCHEME OF A RESTART META-HEURISTIC OPERATOR FOR MULTI-OBJECTIVE GENETIC ALGORITHMS
International Journal on Information Technologies & Security, 2 (vol. 10), 2018 101 GENERIC SCHEME OF A RESTART META-HEURISTIC OPERATOR FOR MULTI-OBJECTIVE GENETIC ALGORITHMS Christina Brester, Ivan Ryzhikov,
More informationMULTIOBJECTIVE INTRINSIC HARDWARE EVOLUTION. Paul Kaufmann, Marco Platzner
MULTIOBJECTIVE INTRINSIC HARDWARE EVOLUTION Paul Kaufmann, Marco Platzner University of Paderborn Warburger Str. 00 33098 Paderborn, Germany email: {paul.kaufmann,platzner}@upb.de ABSTRACT Evolutionary
More informationDouble Archive Pareto Local Search
Double Archive Pareto Local Search Oded Maler CNRS-VERIMAG University of Grenoble Alpes, France Email: oded.maler@imag.fr Abhinav Srivastav VERIMAG University of Grenoble Alpes, France Email: abhinav.srivastav@imag.fr
More informationExploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search
Seventh International Conference on Hybrid Intelligent Systems Exploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search Crina Grosan and Ajith Abraham Faculty of Information Technology,
More informationMulti-objective Optimization Algorithm based on Magnetotactic Bacterium
Vol.78 (MulGrab 24), pp.6-64 http://dx.doi.org/.4257/astl.24.78. Multi-obective Optimization Algorithm based on Magnetotactic Bacterium Zhidan Xu Institute of Basic Science, Harbin University of Commerce,
More informationUniversiteit Leiden Opleiding Informatica
Universiteit Leiden Opleiding Informatica A New Approach to Target Region Based Multi-objective Evolutionary Algorithms Yali Wang MASTER S THESIS Leiden Institute of Advanced Computer Science (LIACS) Leiden
More informationAn Angle based Constrained Many-objective Evolutionary Algorithm
APPLIED INTELLIGENCE manuscript No. (will be inserted by the editor) An Angle based Constrained Many-objective Evolutionary Algorithm Yi Xiang Jing Peng Yuren Zhou Li Zefeng Chen Miqing Received: date
More informationBalancing Survival of Feasible and Infeasible Solutions in Evolutionary Optimization Algorithms
Balancing Survival of Feasible and Infeasible Solutions in Evolutionary Optimization Algorithms Zhichao Lu,, Kalyanmoy Deb, and Hemant Singh Electrical and Computer Engineering Michigan State University,
More informationAuthor s Accepted Manuscript
Author s Accepted Manuscript On The Use of Two Reference Points in Decomposition Based Multiobjective Evolutionary Algorithms Zhenkun Wang, Qingfu Zhang, Hui Li, Hisao Ishibuchi, Licheng Jiao www.elsevier.com/locate/swevo
More informationTowards Understanding Evolutionary Bilevel Multi-Objective Optimization Algorithm
Towards Understanding Evolutionary Bilevel Multi-Objective Optimization Algorithm Ankur Sinha and Kalyanmoy Deb Helsinki School of Economics, PO Box, FIN-, Helsinki, Finland (e-mail: ankur.sinha@hse.fi,
More informationIncorporating Decision-Maker Preferences into the PADDS Multi- Objective Optimization Algorithm for the Design of Water Distribution Systems
Incorporating Decision-Maker Preferences into the PADDS Multi- Objective Optimization Algorithm for the Design of Water Distribution Systems Bryan A. Tolson 1, Mohammadamin Jahanpour 2 1,2 Department of
More informationDeconstructing Multi-objective Evolutionary Algorithms: An Iterative Analysis on the Permutation Flow-Shop Problem
Deconstructing Multi-objective Evolutionary Algorithms: An Iterative Analysis on the Permutation Flow-Shop Problem Leonardo C. T. Bezerra, Manuel López-Ibáñez, and Thomas Stützle IRIDIA, Université Libre
More informationA Level-Wise Load Balanced Scientific Workflow Execution Optimization using NSGA-II
2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing A Level-Wise Load Balanced Scientific Workflow Execution Optimization using NSGA-II Phyo Thandar Thant Graduate School of
More informationMutation Operators based on Variable Grouping for Multi-objective Large-scale Optimization
Mutation Operators based on Variable Grouping for Multi-objective Large-scale Optimization Heiner Zille, Hisao Ishibuchi, Sanaz Mostaghim and Yusuke Nojima Institute for Intelligent Cooperating Systems
More informationA Comparative Study of Dynamic Resampling Strategies for Guided Evolutionary Multi-Objective Optimization
A Comparative Study of Dynamic Resampling Strategies for Guided Evolutionary Multi-Objective Optimization KanGAL Report Number 203008 Florian Siegmund, Amos H.C. Ng Virtual Systems Research Center University
More informationCompromise Based Evolutionary Multiobjective Optimization Algorithm for Multidisciplinary Optimization
Compromise Based Evolutionary Multiobjective Optimization Algorithm for Multidisciplinary Optimization Benoît Guédas, Xavier Gandibleux, Philippe Dépincé To cite this version: Benoît Guédas, Xavier Gandibleux,
More informationThe Multi-Objective Genetic Algorithm Based Techniques for Intrusion Detection
ISSN (Online): 2409-4285 www.ijcsse.org Page: 23-29 The Multi-Objective Genetic Algorithm Based Techniques for Intrusion Detection Gulshan Kumar Department of Computer Application, SBS State Technical
More informationFuzzy-Pareto-Dominance and its Application in Evolutionary Multi-Objective Optimization
Fuzzy-Pareto-Dominance and its Application in Evolutionary Multi-Objective Optimization Mario Köppen, Raul Vicente-Garcia, and Bertram Nickolay Fraunhofer IPK, Pascalstr. 8-9, 10587 Berlin, Germany {mario.koeppen
More informationLocating the boundaries of Pareto fronts: A Many-Objective Evolutionary Algorithm Based on Corner Solution Search
Locating the boundaries of Pareto fronts: A Many-Objective Evolutionary Algorithm Based on Corner Solution Search Xinye Cai, Haoran Sun, Chunyang Zhu, Zhenyu Li, Qingfu Zhang arxiv:8.297v [cs.ai] 8 Jun
More information