An Evolutionary Multi-Objective Crowding Algorithm (EMOCA): Benchmark Test Function Results
|
|
- Kristian Palmer
- 5 years ago
- Views:
Transcription
1 Syracuse University SURFACE Electrical Engineering and Computer Science College of Engineering and Computer Science An Evolutionary Multi-Objective Crowding Algorithm (EMOCA): Benchmark Test Function Results Ramesh Rajagopalan Syracuse University, Chilukuri K. Mohan Syracuse University, Kishan G. Mehrotra Syracuse University, Pramod K. Varshney Syracuse University, Follow this and additional works at: Part of the Electrical and Computer Engineering Commons Recommended Citation R. Rajagopalan, C. K. Mohan, K. G. Mehrotra, and P. K. Varshney, "An evolutionary multi-objective crowding algorithm (EMOCA): Benchmark test function results," in nd Indian International Conference on Artificial Intelligence, IICAI 005, December 0, December, 005, Pune, India, 005, pp This Article is brought to you for free and open access by the College of Engineering and Computer Science at SURFACE. It has been accepted for inclusion in Electrical Engineering and Computer Science by an authorized administrator of SURFACE. For more information, please contact surface@syr.edu.
2 An Evolutionary Multi-Objective Crowding Algorithm (EMOCA): Benchmark Test Function Results Ramesh Rajagopalan, Chilukuri K. Mohan, Kishan G. Mehrotra, and Pramod K. Varshney Department of Electrical Engineering and Computer Science Syracuse University, Syracuse, NY ,USA {rarajago, ckmohan, mehrotra, Abstract. A new evolutionary multi-objective crowding algorithm (EMOCA) is evaluated using nine benchmark multiobjective optimization problems, and shown to produce non-dominated solutions with significant diversity, outperforming state-of-the-art multi-objective evolutionary algorithms viz., Non-dominated Sorting Genetic Algorithm II (NSGA-II), Strength Pareto Evolutionary algorithm II (SPEA-II) and Pareto Archived Evolution Strategy (PAES) on most of the test problems. The key new approach in EMOCA is to use a diversity-emphasizing probabilistic approach in determining whether an offspring individual is considered in the replacement selection phase, along with the use of a non-domination ranking scheme. This approach appears to provide a useful compromise between the two concerns of dominance and diversity in the evolving population.. Introduction Many scientific and engineering applications require simultaneous consideration of two or more objectives that must be optimized together while evaluating the tradeoffs between these objectives. Considerable research efforts have recently been devoted to developing efficient algorithms for solving such Multi-Objective Optimization (MOO) problems. Classical optimization methods suggest converting the multi-objective optimization problem into a single objective optimization problem, e.g., by attempting to minimize a weighted sum of the various objective functions, using weights that represent relative preference strengths. However, this approach yields only a single solution rather than a collection of non-dominated or Pareto-optimal solutions corresponding to different tradeoff points. In addition, this approach cannot be used if the relative importance or weights associated with different objectives are not known. Iterating the weighted approach with different weight values is also unsuccessful in discovering the non-dominated solutions if the Paretooptimal front is non-convex [5]. Considerable success in solving MOO problems has been obtained in recent years by using Multi-Objective Evolutionary Algorithms (MOEAs), e.g., [], [], [3], [4], [6]; a comprehensive introduction to evolutionary multi-objective optimization is given in [5]. Their success in addressing MOO problems arises from the fact that they work with a population of candidate solutions, If each objective function f j is to be maximized, then a solution vector a dominates b, written a»b, if and only if i {,.m} : f i (a) f i (b), and j {,.m} : f j (a) > f j (b). A solution is Non-dominated or Pareto-optimal if it is not dominated by any other candidate solution. The Pareto-optimal front or Pareto set is the collection of all Paretooptimal solutions for a problem.
3 exploring multiple non-dominated solutions in parallel, whereas traditional approaches are crippled by focusing on one solution at a time. MOEAs have been found to be successful in handling complex problem features such as discontinuity, multi-modality and disjoint objective spaces, and are evaluated based on their ability to find Pareto-optimal solutions, as well as discover well-distributed and widely spread solutions that represent the variety of tradeoff points inherent in the problem description. Recently, we formulated some practical path planning problems as MOO problems and explored their solution using MOEAs; in the process, we formulated a new evolutionary multi-objective crowding algorithm (EMOCA), using a probabilistic approach that considers both domination and diversity criteria in determining whether an offspring individual is considered for the replacement selection phase [7,8]. This approach appears to provide a useful compromise between the two concerns of dominance and diversity in the evolving population, and we subsequently found that it was successful in other real world applications such as sensor placement and mobile agent routing in sensor networks [9,0]. This led to the question of whether EMOCA is of general applicability, and how it compares to other well-known and established MOEAs on benchmark problems. This paper addresses this question, evaluating the performance of EMOCA on several test functions suggested by Deb et al. [5] and Zitzler et al. []. We compare the performance of EMOCA with NSGA-II, SPEA-II and PAES using metrics that evaluate convergence and diversity of solutions, on nine benchmark problems used elsewhere to compare MOEAs. Our simulation results indicate that EMOCA outperforms the other algorithms in most of the test problems. In the light of the No-Free-Lunch theorems, it is impossible to argue for the superiority of any single algorithm over others, but we suggest that EMOCA is an important first candidate to be considered when one is hungry for a good algorithm to a difficult MOO problem. In Section, we review existing literature on some recently proposed multi- objective evolutionary algorithms. In Section 3, we describe EMOCA in detail. The benchmark test problems used in our simulations are given in Section 4. Simulation results and conclusions are presented in Sections 5 and 6, respectively.. Evolutionary Multi-objective Optimization Algorithms MOEAs usually employ Pareto-based fitness assignment to guide the search towards the true Paretooptimal front. Density estimation methods such as crowding distance and squeeze factor are used to preserve population diversity [6]. We briefly review three state-of-the-art MOEAs PAES, NSGA-II and SPEA-II which incorporates these features. For details, readers are encouraged to refer to the original studies.. Pareto Archived Evolutionary Strategy (PAES) Knowles et al. [] developed a MOEA called PAES. PAES uses a (+)-ES. PAES is a local search algorithm that simulates a random mutation hill climbing strategy. In PAES, the offspring is compared with the parent in each iteration. If the offspring dominates the parent, the offspring is accepted as the parent for the next iteration. If the parent dominates the offspring, the offspring is discarded and a new mutated solution is created. If the parent and offspring are mutually non-dominating, the decision is made by comparing the parent and offspring with an archive of best solutions found so far. PAES performs better in problems having search space with non-uniformly dense solutions. For our simulations, we used PAES code from the following website: Strength Pareto Evolutionary Algorithm II (SPEA-II) Zitzler et al. have proposed SPEA-II [4] as an improved version of SPEA [3] and showed that SPEA-II obtains better performance than SPEA over all test problems considered in [4]. Each individual in SPEA-II is assigned a strength value which represents the number of solutions it dominates. The fitness of an
4 individual is the sum of strengths of the individuals that dominate the current one. Binary tournament selection is employed to generate the mating population. The individuals with identical fitness are compared based on the density, a decreasing function of the distance to the k th nearest data point. SPEA-II is a generational algorithm with an elitist strategy which maintains an archive of non-dominated individuals at each generation. A truncation method is used in the elitist archive to maintain a constant number of elitists. For our simulations, we used SPEA-II code from the following website: Non-dominated Sorting Genetic Algorithm II (NSGA-II) NSGA II [] assigns a Pareto rank to each individual based on a non-dominated sorting approach. This approach performs a non-dominated sorting of individuals in the population and identifies different nondominated fronts F, F, F k., where elements of F are non-dominated, and each element of F i+ is dominated only by some elements of F, F,, F i. NSGA-II employs binary tournament selection based on Pareto rank of the individuals with ties broken based on the crowding distance. The crowding distance method is employed to estimate the diversity of a solution. The algorithm combines attractive features such as elitism, fast non-dominated sorting and parameter less fitness sharing. NSGA- II has been widely used in several real world optimization problems. For our simulations, we used NSGA-II code from the following website: 3. Evolutionary multi-objective crowding algorithm (EMOCA) An efficient MOEA should produce several widely spread and uniformly spaced solutions while guaranteeing convergence to Pareto-optimal front. Figure shows the general overview of EMOCA. The individual steps of EMOCA are then described below.. Initialize;. For the number of iterations determined by computational bounds, do:.. Generate Mating Population;.. Generate offspring by crossover followed by mutation;.3. Create a new pool consisting of parents and some offspring;.4. Trim new pool to generate the population for the next iteration;.5. Update archive to contain all non-dominated solutions Figure : EMOCA algorithm overview 3. Mating Population Generation EMOCA employs binary tournament selection to fill the mating population. Each solution is assigned a fitness value equal to its total rank defined as the sum of its non-domination rank and diversity rank, defined below: Non-domination rank: The non-dominated sorting procedure suggested by Deb et al. [] is employed to calculate the nondomination rank of individuals in the population. According to this approach, each individual in the population is compared with every other individual to find if it is dominated. This process yields the solutions belonging to the first non-dominated front. The solutions of the first front are temporarily discounted and the above procedure is repeated to find the solutions of the next front. The process is repeated until all non-dominated fronts are identified. A non-domination rank j is assigned to each element of front F j. Hence, solutions belonging to the same non-dominated front are assigned the same rank.
5 Diversity rank: The crowding density of each solution is determined by using the crowding distance measure employed in NSGA-II. To estimate the density of solutions surrounding a particular solution x i in a front, we compute the average distance of two solutions on either side of solution x i along each of the objectives. A very large value of crowding distance is assigned to the boundary solutions in a front. For all other solutions within a front, the following procedure is used to assign the crowding distance [6]. For each solution x i of front F, initialize crowding distance d(x i ) to be 0; For each objective function f m do: Sort the solutions in F along objective f m ; d(x i ) = d(x i ) + f m (the individual that precedes x i in the sorted sequence) - f m (the individual that follows x i in the sorted sequence) A solution with a higher crowding distance indicates better diversity. The solutions in the population are sorted and ranked based on the crowding distance. The solution with the highest crowding distance is assigned the best (lowest) diversity rank. 3. New Pool Generation A New Pool is generated consisting of all the parents and some of the offspring, following a comparison of each offspring with its parents, considering both domination and crowding density. There are three possible cases: Case : If the offspring dominates the parent, the offspring is added to the new pool. Case : If the parent dominates the offspring, the crowding distance measure is used to calculate the probability of acceptance of the offspring. If the offspring has a higher crowding distance than the parent, it is added to the new pool with a probability P given by P = - exp (ψ (parent)- ψ (offspring)) where ψ denotes the crowding distance of a solution. An offspring with a higher crowding distance (better diversity) than the parent has a high probability of acceptance. This strategy rewards solutions with higher diversity by allowing them to survive in future generations. Case 3: If the parent and offspring are mutually non-dominating, then the offspring is added to the new pool if it has a higher crowding distance than the parent Trimming New Pool The new pool is sorted based on the primary criterion of non-domination rank and the secondary criterion of diversity rank. In other words, solutions with the same non-domination rank are compared based on diversity rank. The new population will consist of the first µ elements of the sorted list containing solutions grouped into different fronts: F, F, F n where elements of F i+ are dominated only by elements in F, F,,..F i.. EMOCA maintains an archive of non-dominated solutions at every generation. The above procedure indicates that EMOCA is a simple algorithm which maintains a balance between convergence and diversity. Convergence is emphasized by the concept of non-domination rank. Diversity is maintained in the population by using diversity rank in the tournament selection and population reduction phase. The crowding distance can also be implemented in the parameter space []. However, in our approach we calculate the crowding distance in the objective space. The computational complexity of NSGA-II and PAES are O(MN ) [] and O(MN d) [] per iteration respectively where M is the number of objectives, N is the population size and d is the depth parameter. SPEA-II has a computational complexity of O( N log N ) [4] per iteration where N is the sum of population size and archive size. The computational complexity of EMOCA is similar to NSGA-II of the order of O(MN ) per iteration.
6 4. Test Problems We choose four widely used test problems called FON, POL, KUR and SCH from [5] and five test problems called ZDT, ZDT, ZDT3, ZDT4, ZDT5 and ZDT6 from []. These bi-objective problems are summarized in Table. Table :Summary of test problems and the associated Pareto optimal fronts Problem n, range Objective functions and their parameters Characteristics of the Paretooptimal front KUR 3, [-5,5] n n 8 3 f ( x) 0 exp( 0. x i + x i + ), f ( x) = xi + 5sin x ), = i= i i= FON 3, [-4,4] f ( x) = exp( ( i x j j= 3 + ( ) / i 3) ), i=,, SCH,[0 3,0 3 ] f ( x = x, POL,[- π,π ] ZDT 30, [0,] f ) g g h ( x) = ( x ) f, ` =.5 sin x h ) + 3) + ( x cos x cos x + ) = 0.5sin cos+ sin.5cos =.5sin cos+ sin 0.5 cos h = 0.5 sin x ] + sin x + sin x f ( x) = [ + ( g ( g h ) ], f ( x) = [( x + ( x.5 cos x 0.5 cos x x) = x, f ( x) = g( x)[ x / g( ) ] ), ZDT 30, [0,] f ( x) = x, f ( x) = g( x)[ ( x / g( x)) ], ZDT3 30, [0,] ZDT4 x [0,] x i [ 5,5] ZDT6 0,[0,] f( x) = x, f ( x) = g( x)[ x / g( x) ( x / g( x)) sin(0π x ), n where g( x) = + 9( xi ) /( n ) for ZDT,ZDT and ZDT3. f ( x) = x, f i= g( x) = + 0( n ) + g( x) = + 9[( ( x) = g( x)[ i= n i= f ( x) = exp( 4x ) sin f ( x) = g( x)[ ( f n x / g( x)],,3 [ x i 0 cos(4πx )] 6 ( x) / g( x)) x ) /( n )] i 0.5 ] i (4πx ), : convex, : non-convex, :connected, : disconnected, 3: numerous local Pareto-optimal solutions
7 The test problems chosen by us span a wide variety of characteristics of the Pareto-optimal front such as non-convexity and disconnectivity. We have used a real coded representation for individuals. In the implementation of NSGA-II [], simulated binary crossover (SBX) and parameter based mutation have been used. The studies in [3] showed that SBX outperforms binary coded genetic algorithms for continuous search space problems. Since the test problems in this study have continuous search space, we have employed SBX and parameter based mutation for EMOCA, NSGA-II, SPEA-II and PAES. 5. Simulation Results In this section, we present the simulation results of EMOCA, NSGA-II, SPEA-II and PAES for the different test problems. For fairness of comparison with the work in [], we have used a population size of 00. The algorithms were simulated for 50 generations over 30 trials. No further improvements in the performance of the algorithms were observed after 50 generations. The crossover probability was 0.9 and mutation probability was chosen to be /n where n is the number of decision variables. The algorithms exhibited similar performances for small variations in population size, crossover and mutation probabilities. We have used distribution indices of 0 for the simulated binary crossover and mutation []. For PAES, we have used a depth value of 4. We have used an archive size of 00 for all approaches. We performed experiments on an Intel Pentium 4 processor (3. GHz, GB RAM). All approaches required an average computational time of second per trial. Performance comparison of MOEAs is a very difficult task as discussed in [4]. Several performance metrics have been proposed. According to the study in [4], no single satisfactory metric exists. While evaluating the performance of MOEAs, we should take into account both convergence to the Pareto optimal front and diversity. However, for benchmark test function study, certain metrics have been found to be appropriate for performance comparison []. As suggested in [], we use the generational distance and the spread metric to evaluate the performance of different algorithms. 5.. Generational Distance Veldhuizen et al. [5] proposed the generational distance (GD) metric which evaluates the convergence of the non-dominated solutions obtained by the algorithm to the true Pareto-optimal front. A lower value of the metric indicates a better convergence. The GD metric is defined as GD = ( Q 0.5 d i ) where Q i= indicates the set of non-dominated solutions obtained by the algorithm and d i is the Euclidean distance between the solution i Q and the nearest solution of the Pareto-optimal front P *. The generational distance measures the extent of convergence to the Pareto-optimal front. Since the Pareto-optimal solutions for the test functions are known, we find a set of 500 uniformly spaced solutions [] from the true Paretooptimal front in the objective space. For each solution obtained with the algorithm, we compute the minimum Euclidean distance of it from the solutions of the Pareto-optimal front. The average of these distances gives the generational distance. A lower value of the generational distance indicates a better performance. Table shows the and of the generational distance values obtained over 30 trials. The results clearly indicate that EMOCA outperforms NSGA-II in all test problems except in FON. EMOCA outperforms SPEA-II and PAES in all test problems except ZDT3. The performance of EMOCA is identical to SPEA-II and PAES in ZDT3 as observed from Table. These results confirm that EMOCA performs the best in a majority of the test problems. In particular, for problems ZDT4 and ZDT6, EMOCA obtains much lower generational distance values as compared to the other algorithms.
8 Table : Mean and of generational distance over 30 trials Problem EMOCA NSGA-II SPEA-II PAES KUR FON SCH POL ZDT ZDT ZDT ZDT ZDT Set Coverage Metric Zitzler et al. [6] have proposed the set coverage metric (C-metric). The C metric calculates the fraction of solutions in one non-dominated set (obtained by one algorithm) that are dominated by those obtained by the other algorithm. The C metric is defined as C(A,B)= {b B a A:a»b} / B. C(A,B)= indicates that every solution in B is dominated by solutions in A and C(A,B)=0 s that none of the solutions in B is dominated by any element in A. Since the C metric is asymmetric, it is necessary to examine both C(A,B) and C(B,A). It can be argued that evolutionary algorithm A is better than evolutionary algorithm B, if over many trials we repeatedly and consistently observe that C(A,B) is significantly higher than C(B,A). Table 3 shows the and of the C metric values for different algorithms over 30 trials. The results show that C(other algorithm, EMOCA) is consistently low, with relatively high values for C(EMOCA, other algorithm), confirming the superior performance of EMOCA.
9 Table 3: Mean and of C metric values comparing EMOCA with various algorithms: all results are averages over 30 trials Problem C(NSGA-II,EMOCA) C(EMOCA,NSGA-II) C(SPEA-II, EMOCA) C(EMOCA, SPEA-II) C(PAES,EMOCA) C(EMOCA,PAES) KUR FON SCH POL ZDT ZDT ZDT ZDT ZDT Domination Metric We have proposed a symmetric metric called the domination metric (Dom metric) to evaluate the relative performance of two MOEAs [8]. This metric is based on the number of solutions (obtained by one algorithm) dominated by each solution obtained by the other algorithm. The Dom metric is defined as: Dom(A,B) = d(a,b)/(d(a,b)+d(b,a)), where d(x,y)= {y Y x»y}. x Mutually non-dominating solutions are ignored while evaluating the dominance factor d(a,b) so that Dom (B,A)=-Dom (A,B). Consequently, for two algorithms A and B, it is sufficient to measure the performance in terms of Dom(A,B). If each solution of algorithm A dominates every solution of algorithm B, then Dom (A,B)= and Dom(B,A)=0. Table 4 shows Dom-metric values comparing EMOCA with other algorithms.
10 Table 4: Mean and of Dom metric values comparing EMOCA with NSGA-II, PAES and SPEA-II : all results are averages over 30 trials. Problem Dom (EMOCA,NSGA-II) Dom(EMOCA,SPEA- II) Dom (EMOCA,PAES) KUR FON SCH POL ZDT ZDT ZDT ZDT ZDT Consistently, we find that Dom(EMOCA, other algorithm) > 0.5, except for problem FON for which NSGA-II has better performance according to this metric, and ZDT3 for which SPEA-II and PAES have better performance. In other words, the solutions obtained by EMOCA tend to dominate those obtained by the other algorithms, more than the latter dominate EMOCA Spread Metric To evaluate the diversity of the solutions obtained, Deb et al. [] suggested the spread metric. The spread metric is defined as: = M m= M m= d e m e Q + i= d m + Q d d i d where d i is the Euclidean distance between neighboring solutions and d is the value of the e distances. The parameter d m is the distance between extreme solutions of the Pareto-optimal front and the nearest solution of Q corresponding to the m th objective function. For an ideal distribution of solutions, = 0. A value of close to zero indicates that the non-dominated solutions obtained by the algorithm are uniformly spaced.
11 Table 5: Mean and of the spread metric: all results are averages over 30 trials Problem EMOCA NSGA-II SPEA-II PAES KUR FON SCH POL ZDT ZDT ZDT ZDT ZDT Table 5 shows the and of the diversity metric (spread) obtained over 30 trials. The results indicate that EMOCA outperforms NSGA-II and PAES in all test problems in terms of the spread. In problem ZDT4, SPEA-II performs the best in terms of spread. In all other test problems EMOCA performs better than SPEA-II. These results show that EMOCA obtains a more uniformly spaced and a better spread of solutions compared to the other algorithms. EMOCA incorporates diversity preservation as an integral part of the algorithm. The values obtained by EMOCA are much lower than those obtained by the other algorithms. This shows that EMOCA discovers a diverse set of non-dominated solutions with near- uniform spacing Plots of Non-Dominated Solutions Obtained The averages and s of the performance metrics give a clear indication of the performance of different algorithms. To appreciate the nature of solutions obtained by EMOCA, we plot the Pareto surfaces obtained by different algorithms for a few selective examples. Figure shows the Pareto plots obtained by EMOCA, NSGA-II, SPEA-II and PAES on ZDT6. ZDT6 has a non-convex Pareto-optimal front with nonuniform spacing between the solutions. The plot shows that EMOCA performs the best for ZDT6. EMOCA obtains a better spread and convergence compared to the other algorithms. SPEA-II performs slightly worse than EMOCA while PAES has the worst performance on ZDT6. We can also observe that the Pareto front obtained by EMOCA covers a wider region of the objective space compared to the Pareto fronts obtained by the other algorithms.
12 Figure : Performance comparison of EMOCA, NSGA-II, SPEA-II and PAES on ZDT6. The remaining figures show pairwise comparisons of EMOCA with other algorithms to reduce clutter. Figure 3 shows the non-dominated solutions obtained by EMOCA and NSGA-II on KUR. The problem KUR has discontinuous regions in the Pareto-optimal front. The plots show that EMOCA is able to discover several diverse non-dominated solutions compared to NSGA-II. Figure 3: Performance comparison of EMOCA and NSGA-II on KUR The problem ZDT has a non-convex Pareto-optimal front. Figure 4 shows the non-dominated solutions obtained by EMOCA and NSGA-II on ZDT. The plot indicates that EMOCA obtains uniformly spaced
13 diverse set of non-dominated solutions compared to NSGA-II. This observation is confirmed by a very low value of the spread metric for EMOCA as shown in Table 4. Figure 4: Non-dominated solutions obtained by EMOCA on ZDT Figure 5 shows the performance comparison of EMOCA and NSGA-II on ZDT4. The problem ZDT4 has 9 different local Pareto-optimal fronts [6]. This is a challenging problem for MOEAs. The plots clearly show that EMOCA has a better convergence and diversity compared to NSGA-II. Figure 5: Performance comparison of EMOCA and NSGA-II on ZDT4
14 Figure 6 shows the Pareto plots obtained by EMOCA and SPEA-II on POL. The function POL has a non-convex and disconnected Pareto-optimal front. From the plot, we observe that EMOCA obtains solutions with better convergence and spacing compared to the solutions obtained by SPEA-II. Figure 6: Performance comparison of EMOCA and SPEA-II on POL Figure 7 shows the Pareto plots obtained by EMOCA and PAES on SCH. The plots show that EMOCA obtains a better convergence towards the Pareto-optimal front than PAES. Figure 7: Performance comparison of EMOCA and PAES on SCH
15 7. Conclusions We have proposed a new MOEA called EMOCA which employs a stochastic replacement selection strategy that considers both non-domination and diversity. EMOCA was successful in several real world applications such as path planning, sensor placement and mobile agent routing in wireless sensor networks [7, 8, 9, 0]. In this paper, we have compared the performance of EMOCA with NSGA-II, SPEA-II and PAES on nine difficult test problems with distinct features. Several performance measures were used to compare the algorithms. The simulation results show that EMOCA outperforms the other algorithms in eight out of the nine test problems in terms of convergence and diversity, consistently discovering a widely spread set of non-dominated solutions. The successful performance of EMOCA in these test problems shows that EMOCA is an efficient multi-objective optimization algorithm which should find extensive applications in optimization problems spanning a wide variety of areas from path planning to wireless networks.
16 References:. J. Knowles and D. Corne, The Pareto archived evolution strategy: A new baseline algorithm for multi-objective optimization, In Proceedings of the 999 congress on Evolutionary Computation, pp.98-05, K. Deb, A. Pratap, S. Agarwal and T. Meyarivan, A fast and elitist multi-objective genetic algorithm: NSGA-II, Proc. Parallel Problem Solving from Nature VI, pp , E. Zitzler, and L. Thiele, Multiobjective optimization using evolutionary algorithms A comparative study, Proc. Parallel Problem Solving from Nature V, pp. 9-30, E. Zitzler, M. Laumanns, and L. Thiele, SPEA: Improving the strength pareto evolutionary algorithm, Swiss Federal Institute of Technology, Tech. Rep. TIK-Rep. 03, K. Deb, Multi-objective optimization using evolutionary algorithms, Wiley and Sons, England, C.A. Coello Coello and G. B. Lamont. Application of multi-objective evolutionary algorithms, World Scientific, Singapore, R. Rajagopalan, Path planning with evolutionary algorithms, M.S. Thesis, Department of Electrical Engineering & Computer Science, Syracuse University, July R. Rajagopalan, C.K. Mohan, K.G. Mehrotra and P.K. Varshney, Evolutionary Multi-objective crowding algorithm for path computations, Proc. Fifth International Conference on Knowledge based Computer Systems, pp , Dec R. Rajagopalan, C.K. Mohan, P.K. Varshney and K.G. Mehrotra, Sensor placement for energy efficient target detection in wireless sensor networks: A multi-objective optimization approach, 39 th Annual Conference on Information Sciences and Systems, Baltimore, MaryLand, March R. Rajagoapalan, C.K. Mohan, P.K. Varshney and K.G. Mehrotra, Multi-objective mobile agent routing in wireless sensor networks, IEEE Congress on Evolutionary Computation, September 005 (accepted).. E. Zitzler, K. Deb, and L. Thiele, Comparison of multi-objective evolutionary algorithm: Empirical results, Evolutionary Computation, vol. 8, pp , K. Deb, Multi-objective genetic algorithms: Problem difficulties and construction of test functions, Evolutionary Computation, Vol.7, pp , K.Deb, and R.B. Agarwal, Simulated binary crossover for continuous search space, Complex Systems, Vol. 9, pp.5-48, J.D. Knowles, and D.W. Corne, On metrics for comparing non-dominated sets, Proc. IEEE Congress on Evolutionary Computation, pp. 7-76, D.V. Veldhuizen, Multi-objective evolutionary algorithms: Classifications, analyses and new innovations, Ph.D. Thesis, Air Force Institute of Technology, Ohio, Technical Report AFIT/DS/ENG/99-0, E. Zitzler, Evolutionary algorithms for multi-objective optimization: Methods and applications, Ph.D. Thesis, Swiss Federal Institute of Technology (ETH) (Dissertation ETH No. 3398).
Finding 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 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 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 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 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 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 informationComparison 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationAdaptive Multi-objective Particle Swarm Optimization Algorithm
Adaptive Multi-objective Particle Swarm Optimization Algorithm P. K. Tripathi, Sanghamitra Bandyopadhyay, Senior Member, IEEE and S. K. Pal, Fellow, IEEE Abstract In this article we describe a novel Particle
More informationPerformance Evaluation of Vector Evaluated Gravitational Search Algorithm II
170 New Trends in Software Methodologies, Tools and Techniques H. Fujita et al. (Eds.) IOS Press, 2014 2014 The authors and IOS Press. All rights reserved. doi:10.3233/978-1-61499-434-3-170 Performance
More informationExperimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization
Experimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization adfa, p. 1, 2011. Springer-Verlag Berlin Heidelberg 2011 Devang Agarwal and Deepak Sharma Department of Mechanical
More informationImproved S-CDAS using Crossover Controlling the Number of Crossed Genes for Many-objective Optimization
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-
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 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 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
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 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 informationMulti-objective optimization using Trigonometric mutation multi-objective differential evolution algorithm
Multi-objective optimization using Trigonometric mutation multi-objective differential evolution algorithm Ashish M Gujarathi a, Ankita Lohumi, Mansi Mishra, Digvijay Sharma, B. V. Babu b* a Lecturer,
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 informationminimizing minimizing
The Pareto Envelope-based Selection Algorithm for Multiobjective Optimization David W. Corne, Joshua D. Knowles, Martin J. Oates School of Computer Science, Cybernetics and Electronic Engineering University
More informationDynamic Uniform Scaling for Multiobjective Genetic Algorithms
Dynamic Uniform Scaling for Multiobjective Genetic Algorithms Gerulf K. M. Pedersen 1 and David E. Goldberg 2 1 Aalborg University, Department of Control Engineering, Fredrik Bajers Vej 7, DK-922 Aalborg
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 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 Using Genetic Algorithms
Multi-Objective Optimization Using Genetic Algorithms Mikhail Gaerlan Computational Physics PH 4433 December 8, 2015 1 Optimization Optimization is a general term for a type of numerical problem that involves
More informationMulti-Objective Evolutionary Algorithms
Multi-Objective Evolutionary Algorithms Kalyanmoy Deb a Kanpur Genetic Algorithm Laboratory (KanGAL) Indian Institute o Technology Kanpur Kanpur, Pin 0806 INDIA deb@iitk.ac.in http://www.iitk.ac.in/kangal/deb.html
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 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 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 informationAn Improved Multi-Objective Evolutionary Algorithm with Adaptable Parameters
Nova Southeastern University NSUWorks CEC Theses and Dissertations College of Engineering and Computing 26 An Improved Multi-Objective Evolutionary Algorithm with Adaptable Parameters Khoa Duc Tran Nova
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 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 informationIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL., NO., MONTH YEAR 1
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL., NO., MONTH YEAR 1 An Efficient Approach to Non-dominated Sorting for Evolutionary Multi-objective Optimization Xingyi Zhang, Ye Tian, Ran Cheng, and
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 informationAn efficient multi-objective optimization algorithm based on swarm intelligence for engineering design
Engineering Optimization Vol. 39, No. 1, January 2007, 49 68 An efficient multi-objective optimization algorithm based on swarm intelligence for engineering design M. JANGA REDDY and D. NAGESH KUMAR* Department
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 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 informationA Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II
A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, and T Meyarivan Kanpur Genetic Algorithms Laboratory (KanGAL)
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 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 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 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 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 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 informationSTUDY OF MULTI-OBJECTIVE OPTIMIZATION AND ITS IMPLEMENTATION USING NSGA-II
STUDY OF MULTI-OBJECTIVE OPTIMIZATION AND ITS IMPLEMENTATION USING NSGA-II A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Bachelor of Technology in Electrical Engineering.
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 informationOn The Effects of Archiving, Elitism, And Density Based Selection in Evolutionary Multi-Objective Optimization
On The Effects of Archiving, Elitism, And Density Based Selection in Evolutionary Multi-Objective Optimization Marco Laumanns, Eckart Zitzler, and Lothar Thiele ETH Zürich, Institut TIK, CH 8092 Zürich,
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 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 informationOptimo: A BIM-based Multi-Objective Optimization Tool Utilizing Visual Programming for High Performance Building Design
Optimo: A BIM-based Multi-Objective Optimization Tool Utilizing Visual Programming for High Performance Building Design Mohammad Rahmani Asl 1, Alexander Stoupine 2, Saied Zarrinmehr 3, Wei Yan 4 1,2,3,4
More informationMulti-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design
City University of New York (CUNY) CUNY Academic Works International Conference on Hydroinformatics 8-1-2014 Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design Matthew
More informationParallel Multi-objective Optimization using Master-Slave Model on Heterogeneous Resources
Parallel Multi-objective Optimization using Master-Slave Model on Heterogeneous Resources Sanaz Mostaghim, Jürgen Branke, Andrew Lewis, Hartmut Schmeck Abstract In this paper, we study parallelization
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 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 informationPERFORMANCE SCALING OF MULTI-OBJECTIVE EVOLUTIONARY ALGORITHMS. Vineet Khare
PERFORMANCE SCALING OF MULTI-OBJECTIVE EVOLUTIONARY ALGORITHMS Vineet Khare School of Computer Science The University of Birmingham Edgbaston, Birmingham B15 2TT, U.K. msc39vxk@cs.bham.ac.uk Project Supervisors
More informationScienceDirect. Differential Search Algorithm for Multiobjective Problems
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 48 (2015 ) 22 28 International Conference on Intelligent Computing, Communication & Convergence (ICCC-2015) (ICCC-2014)
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 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 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 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 informationA Multi-Tier Adaptive Grid Algorithm for the Evolutionary Multi-Objective Optimisation of Complex Problems
Soft Computing manuscript No. (will be inserted by the editor) A Multi-Tier Adaptive Grid Algorithm for the Evolutionary Multi-Objective Optimisation of Complex Problems Shahin Rostami Alex Shenfield Received:
More informationA Model-Based Evolutionary Algorithm for Bi-objective Optimization
A Model-Based Evolutionary Algorithm for Bi-objective Optimization Aimin Zhou 1, Qingfu Zhang 1, Yaochu Jin 2, Edward Tsang 1 and Tatsuya Okabe 3 1 Department of Computer Science, University of Essex,
More informationParallel Multi-objective Optimization using Master-Slave Model on Heterogeneous Resources
Parallel Multi-objective Optimization using Master-Slave Model on Heterogeneous Resources Author Mostaghim, Sanaz, Branke, Jurgen, Lewis, Andrew, Schmeck, Hartmut Published 008 Conference Title IEEE Congress
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 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 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 informationAssessing the Convergence Properties of NSGA-II for Direct Crashworthiness Optimization
10 th International LS-DYNA Users Conference Opitmization (1) Assessing the Convergence Properties of NSGA-II for Direct Crashworthiness Optimization Guangye Li 1, Tushar Goel 2, Nielen Stander 2 1 IBM
More informationX/$ IEEE
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 12, NO. 1, FEBRUARY 2008 41 RM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm Qingfu Zhang, Senior Member, IEEE,
More informationETEA: A Euclidean Minimum Spanning Tree-Based Evolutionary Algorithm for Multi-Objective Optimization
ETEA: A Euclidean Minimum Spanning Tree-Based Evolutionary Algorithm for Multi-Objective Optimization Miqing Li miqing.li@brunel.ac.uk Department of Information Systems and Computing, Brunel University,
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 informationA Multiobjective Memetic Algorithm Based on Particle Swarm Optimization
A Multiobjective Memetic Algorithm Based on Particle Swarm Optimization Dr. Liu Dasheng James Cook University, Singapore / 48 Outline of Talk. Particle Swam Optimization 2. Multiobjective Particle Swarm
More informationCHAPTER 2 MULTI-OBJECTIVE REACTIVE POWER OPTIMIZATION
19 CHAPTER 2 MULTI-OBJECTIE REACTIE POWER OPTIMIZATION 2.1 INTRODUCTION In this chapter, a fundamental knowledge of the Multi-Objective Optimization (MOO) problem and the methods to solve are presented.
More informationMLPSO: MULTI-LEADER PARTICLE SWARM OPTIMIZATION FOR MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
MLPSO: MULTI-LEADER PARTICLE SWARM OPTIMIZATION FOR MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Zuwairie Ibrahim 1, Kian Sheng Lim 2, Salinda Buyamin 2, Siti Nurzulaikha Satiman 1, Mohd Helmi Suib 1, Badaruddin
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 informationAn Algorithm Based on Differential Evolution for Multi-Objective Problems
International Journal of Computational Intelligence Research. ISSN 973-873 Vol., No.2 (25), pp. 5 69 c Research India Publications http://www.ijcir.info An Algorithm Based on Differential Evolution for
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 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 informationMULTI-OBJECTIVE GENETIC LOCAL SEARCH ALGORITHM FOR SUPPLY CHAIN SIMULATION OPTIMISATION
MULTI-OBJECTIVE GENETIC LOCAL SEARCH ALGORITHM FOR SUPPLY CHAIN SIMULATION OPTIMISATION Galina Merkuryeva (a), Liana Napalkova (b) (a) (b) Department of Modelling and Simulation, Riga Technical University,
More informationMultiobjective Optimisation. Why? Panorama. General Formulation. Decision Space and Objective Space. 1 of 7 02/03/15 09:49.
ITNPD8/CSCU9YO Multiobjective Optimisation An Overview Nadarajen Veerapen (nve@cs.stir.ac.uk) University of Stirling Why? Classic optimisation: 1 objective Example: Minimise cost Reality is often more
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 informationA Multi-objective Evolutionary Algorithm of Principal Curve Model Based on Clustering Analysis
A Multi-objective Evolutionary Algorithm of Principal Curve Model Based on Clustering Analysis Qiong Yuan1,2, Guangming Dai1,2* 1 School of Computer Science, China University of Geosciences, Wuhan 430074,
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 informationAn Evolutionary Algorithm with Advanced Goal and Priority Specification for Multi-objective Optimization
Journal of Artificial Intelligence Research 8 (2003) 83-25 Submitted 9/0; published 2/03 An Evolutionary Algorithm with Advanced Goal and Priority Specification for Multi-objective Optimization Kay Chen
More informationDiscovering Knowledge Rules with Multi-Objective Evolutionary Computing
2010 Ninth International Conference on Machine Learning and Applications Discovering Knowledge Rules with Multi-Objective Evolutionary Computing Rafael Giusti, Gustavo E. A. P. A. Batista Instituto de
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 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 informationCombining Convergence and Diversity in Evolutionary Multi-Objective Optimization
Combining Convergence and Diversity in Evolutionary Multi-Objective Optimization Marco Laumanns laumanns@tik.ee.ethz.ch Department of Information Technology and Electrical Engineering, Swiss Federal Institute
More information