Multi-objective optimization using Trigonometric mutation multi-objective differential evolution algorithm
|
|
- Dwain Barker
- 5 years ago
- Views:
Transcription
1 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, Department of Chemical Engineering Birla Institute of Technology and Science (BITS), Pilani (Rajasthan) India; ashishg@bits-pilani.ac.in b Dean- Educational Hardware Division & Professor of Chemical Engineering Birla Institute of Technology and Science (BITS), PILANI (Rajasthan) India Phone: Ext. 59; Fax: bvbabu@bits-pilani.ac.in Homepage: * Corresponding Author: Abstract: In this study a trigonometric mutation strategy of multi-objective differential algorithm (MODE) is used successfully on selected test problems. The trigonometric mutation strategy consists of working principle of MODE-III algorithm with probability based an enhanced mutation strategy. The developed algorithm is also applied successfully on multi-objective optimization of benchmark test problems the Pareto optimal fronts are obtained. The important metrics such as the convergence and divergence metric are reported. The convergence and divergence history (with respect to number of generations) is reported and is compared with the other strategy of MODE. It is found that when a high value of trigonometric mutation probability (TMP) constant is used, the algorithm converges to a local region. However, a small value of TMP constant ensures that the algorithm converge to the true Pareto front at a faster rate. Such algorithm is useful in solving engineering optimization problems. Keywords: Multi-objective optimization; Evolutionary algorithms; Multiobjective differential evolution (MODE); Trigonometric mutation
2 Introduction When more than one objective problem is solved simultaneously it results in a set of solutions rather than a single point solution. Such solution technique is called as the multi-objective optimization. The speciality of these set of solutions is that they are equally good with respect to each other and are called as the non-dominated set. An efficient algorithm may result in a Pareto optimal set of solutions which is the set of non-dominated solutions. Several algorithms such as Non-dominated sorting genetic algorithm (NSGA) and its improved variants, Multi-objective simulated annealing (MOSA), Multi-Objective Differential Evolution (MODE) and its other improved strategies, Strength Pareto Evolutionary Algorithms (SPEA), Pareto Archived Evolutionary Strategy (PAES), etc. [, ] are developed to solve multi-objective optimization problems. In this work, trigonometric mutation operation is successfully incorporated in evolutionary multi-objective differential evolution algorithm. Simple mutation operation involves the random selection of first individual vector out of randomly selected three vectors. The scaled difference is added to this randomly selected individual. In case of trigonometric mutation operation, the center point of the hyper geometric point is taken as the vector to be perturbed. The developed algorithm is tested on various test problems and the Pareto optimal fronts are obtained. The important metrics such as the convergence and divergence metric are reported. The convergence and divergence history (with respect to number of generations) is reported and is compared with the other strategy of MODE. It is found that when a high value of trigonometric mutation probability (TMP) constant is used, the algorithm converges to a local region. However, a small value of TMP constant ensures that the algorithm converge to the true Pareto front at a faster rate. Such algorithm is useful in solving engineering optimization problems. The manuscript is organized in the following manner. A brief working principle of trigonometric MODE is give in next section, followed by problem formulation of test problems, the results and discussions and the conclusions. Trigonometric mutation differential Evolution algorithm [3] The mutation operation is carried out in MODE [4] and MODE-III [4] is based on simple differential evolution algorithm [6-8], where three distinct vectors are used. These vectors are perturbed by applying a scale factor so that hopefully an efficient vector (noisy random vector) is created [6]. However, the noisy random vector thus created does not always guaranty for direction towards the better function value. In this study, mutation is carried out using trigonometric mutation operation [9- concept to the selected vectors. Earlier trigonometric mutation operation was applied to differential evolution algorithm to solve single objective optimization problems [9-]. In this work we apply trigonometric mutation operation on MODE III algorithm to solve multi-objective optimization problems. The pseudo-code of trigonometric mutation operation carried out in trigonometric MODE algorithm may be represented as below. For detailed discussion on trigonometric mutation, readers may refer literature [9-]: **Pseudo-code for trigonometric mutation operation for MOO Select three distinct vectors X a, X b and X c other than X i do {
3 r =round (rand*np) r =round (rand*np) r 3 =round (rand*np) } while [(r == i) (r ==i) (r 3 == i) (r == r ) (r == r 3 ) (r == r 3 )] If (rand(,) >Mt) Tempp =f(xr ); Tempp =f(xr );; Tempp 3 =f(xr 3 ); Sum= Tempp + Tempp + Tempp p = Tempp /sum; p = Tempp /sum; p 3 = Tempp 3 /sum; for j=:d Xt,i,j = (Xr (,j)+x r (,j) + X r 3 (,j))/3 + abs(p -p )*(X r (,j) - X r (,j)) + abs(p 3 -p )*(X r (,j) - Xr 3 (j)) + abs(p -p 3 )*(X r 3 (,j)-x r (,j)); end for else X t,i =Xr + F (Xr -Xr 3 ) %Trial vector End Simple mutation operation involves the random selection of first individual vector out of the randomly selected three vectors. The weighted difference of the two vectors is added to the third randomly selected individual. In case of trigonometric mutation operation, the center point of the hyper geometric point is taken as the vector to be perturbed. As seen from the pseudo-code of trigonometric mutation operation for MOO, the perturbation in the trigonometric mutation operation is contributed together by three vertices of the triangle defined by three randomly selected vectors. The weights applied to the vectors differentials i.e. (p -p ), (p 3 -p ), and (p -p 3 ) ensures that the new point moves in the direction of improved objective function value. In case of single objective optimization, Tempp, Tempp and Tempp 3 (as given in pseudo-code above) are the variables which contain a single objective function value. However, in case of multi-objective optimization Tempp, Tempp and Tempp 3 are the vectors which contain the values of evaluated multiple objective functions. The sum is also a vector which contains the sum of individual objective functions. The mean value of all the objectives is calculated as shown by p, p and p 3 variables. The noisy random vector is now created by using the p, p and p 3 variables as weight as given in above pseudo-code. It is ensured that the noisy random vector moves towards a better direction where there is an improvement in the objective function value. The mutation probability used in this algorithm is.5%, i.e., if the random number generated is greater than.5 then trigonometric mutation operation is carried out otherwise simple mutation operation as given in MODE III algorithm is used [3].
4 Problem formulation of test problems Three benchmark test problems are considered namely SCH, SCH and KUR (Table ) for present study. Two important performance measures namely convergence metric and divergence metric [] are used to evaluate the performance of trigonometric MODE algorithm. Table. MOO test problems used in the present study Sr. No. Test Problem SCH- (Schaffer, 984) FON (Fonseca and Fleming, 995) 3 KUR (Kursawe, 99) Problem Type Min-Min Convex Min-Min Nonconvex Min-Min Nonconvex Disconnected Objective Functions Number of variables and Bounds n = = x = ( x ) 3 x 3 n n = 3 = exp x = i 4 x 4 i n i n = exp x + i = i n n n = 3 = exp. x + x = i i + 5 x 5 i i n.8 = x + 5sin x 3 i i i = Results and Discussion Three benchmark test problems are used to judge the performance of algorithm. Convergence and divergence metrics are evaluated and are compared with other well known algorithms from the literature. Table shows the mean () variance ( σ ) of convergence and mean and variance of divergence metrics respectively using MODE-III and trigonometric MODE algorithm. The mean and variance values of other algorithms (such as NSGA-II (both real- and binary-coded variants), SPEA, PAES) are also shown in the same table which are taken from the literature.
5 MODE-III Trigonometric MODE Real Coded NSGA-II True Pareto..8.6 f f.4.. MODE III Trigonometric MODE Real coded NSGA III True Pareto f f Fig. (a) Fig. (b) - -4 f MODE III Trigonometric MODE Real coded NSGA II True Pareto f Fig. (c) Fig.. Pareto fronts obtained using MODE III, Trigonometric MODE, and Real Coded NSGA II and True Pareto fronts for (a) SCH, (b) FON and (c) KUR Test problems All the simulation runs are taken with same value of control parameters as reported in the literature []. The Pareto fronts obtained using MODE III, Trigonometric MODE, Real Coded NSGA II are plotted along with true Pareto fronts for SCH, FON and KUR test problems and are shown in Fig.. Results in Table show that results obtained using trigonometric MODE algorithm are comparable in terms of mean and variance of convergence metric, however, divergence metric is higher than NSGA-II strategies.
6 Table. Convergence and divergence metrics obtained using several algorithms Algorithm SCH FON KUR Real coded NSGA-II ~ σ σ NSGA-II ~ Binary σ σ SPEA ~ σ σ PAES ~ σ σ MODE* σ σ MODE III* σ σ Trigonometric MODE * σ σ *Results obtained in the present study; ~ Results reported in Ref [] Though the algorithm is able to converge to the true Pareto front, diversity of solutions obtained on the Pareto front needs further attention. The Pareto fronts obtained using MODE-III and trigonometric MODE algorithms for SCH, FON and KUR test problems is shown through Fig. a-c respectively. In the figures, true Pareto front and results obtained using real-coded NSGA- II are also plotted. The source code for real-coded NSGA-II is downloaded from KanGAL ( A value of TMP is set to.5. It is observed that if only trigonometric mutation operation is used, the algorithm converges to a local Pareto front. Therefore it is ensured that simple mutation strategy of MODE-III and trigonometric mutation strategy works with equal probability (i.e. 5%).
7 Conclusions The working principle of trigonometric mutation strategy of MODE algorithm is presented in this paper. Three test problems (SCH, FON, and KUR) are considered for MOO. Pareto fronts are obtained fusing MODE III, trigonometric MODE and real-coded NSGA-II algorithms and are compared with true Pareto fronts. Important performance metrics (such as convergence and divergence metrics) are evaluated for both the strategies of MODE and are compared with other algorithms such as NSGA II (real- and binary coded variants), SPEA and PAES. It is observed that convergence of strategies of MODE are comparable as compared to other algorithms, however, diversity of solutions is relatively poor. References:. Deb, K. () Multi-Objective Optimization using Evolutionary Algorithms, John Wiley & Sons Limited, New York.. Tan, K. C., Khor, E. F., Lee, T. H. (5) Multiobjective evolutionary algorithms and applications, Springer-Verlag: London. 3. Gujarathi, A.M., Babu, B.V. (9) Improved Strategies of Multi-objective Differential Evolution (MODE) for Multi-objective Optimization. In Proceedings of 4th Indian International Conference on Artificial Intelligence (IICAI-9), Tumkur, Bangalore, December 6-8, Babu, B.V., Mubeen, J.H.S., Chakole, P.G. (7) Modeling, simulation, and optimization of wiped film poly ethylene terephthalate (PET) reactor using multi-objective differential evolution (MODE), Materials and Manufacturing Processes: Special Issue on Genetic Algorithms in Materials, Vol. (5), pp Babu, B.V., Gujarathi, A.M., Katla, P., Laxmi, V.B. (7) Strategies of multi-objective differential evolution (MODE) for optimization of adiabatic Styrene reactor, In Proceedings of International Conference on Emerging Mechanical Technology-Macro to Nano, BITS Pilani, India, Feb 6-8, pp Price, K.V., Storn, R. (997) Differential evolution a simple evolution strategy for fast optimization, Dr. Dobb s J., Vol. pp., Babu, B. V. (4) Process Plant Simulation, New York: Oxford University Press. 8. Onwubolu G. C. and Babu, B. V. (4) New Optimization Techniques in Engineering, Springer-Verlag, Heidelberg, Germany. 9. Fan, H. Y., Lampinen, J. (3). A trigonometric mutation operation to differential evolution. Journal of Global Optimization, vol. 7, Angira, R., Alladwar, S. (7). Optimization of dynamic systems: A trigonometric differential evolution approach, Computers and Chemical Engineering, Vol. 3,
Elitist-Multi-objective Differential Evolution (E- MODE) Algorithm for Multi-objective Optimization
Elitist-Multi-objective Differential Evolution (E- MODE) Algorithm for Multi-objective Optimization B. V. Babu, Ashish M. Gujarathi Dean Educational Hardware Division (EHD) and Professor, Department of
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationA Novel Hybrid Self Organizing Migrating Algorithm with Mutation for Global Optimization
International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-3, Issue-6, January 2014 A Novel Hybrid Self Organizing Migrating Algorithm with Mutation for Global Optimization
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 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 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 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 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 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 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 informationA Cultivated Differential Evolution Algorithm using modified Mutation and Selection Strategy
A Cultivated Differential Evolution Algorithm using modified Mutation and Selection Strategy Pooja *1 Praveena Chaturvedi 1 Pravesh Kumar 2 1. Department of Computer Science, Gurukula Kangri Vishwavidyalaya,
More informationGT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS
GT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS M. Chandrasekaran 1, D. Lakshmipathy 1 and P. Sriramya 2 1 Department of Mechanical Engineering, Vels University, Chennai, India 2
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 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 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 Multi-objective Optimization of Business Process Designs with Pre-processing
Evolutionary Multi-objective Optimization of Business Process Designs with Pre-processing Kostas Georgoulakos Department of Applied Informatics University of Macedonia Thessaloniki, Greece mai16027@uom.edu.gr
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 informationSimulation of Robot Manipulator Trajectory Optimization Design
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): -96, ISSN (Print): -956 Volume 5 Issue ǁ Feb. 7 ǁ PP.7-5 Simulation of Robot Manipulator Trajectory Optimization Design
More informationA Multi-Objective Approach for QoS-aware Service Composition
A Multi-Objective Approach for QoS-aware Service Composition Marcel Cremene, Mihai Suciu, Florin-Claudiu Pop, Denis Pallez and D. Dumitrescu Technical University of Cluj-Napoca, Romania Babes-Bolyai University
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 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 informationConstrained Multi-Objective Optimization of a Condenser Coil Using Evolutionary Algorithms
Purdue University Purdue e-pubs International Refrigeration and Air Conditioning Conference School of Mechanical Engineering 2004 Constrained Multi-Objective Optimization of a Condenser Coil Using Evolutionary
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 informationDimensionality Reduction in Multiobjective Optimization: The Minimum Objective Subset Problem
Eckart Zitzler ETH Zürich Dimo Brockhoff ETH Zurich Gene Expression Data Analysis 1 Computer Engineering and Networks Laboratory Dimensionality Reduction in Multiobjective Optimization: The Minimum Objective
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 informationExploration vs. Exploitation in Differential Evolution
Exploration vs. Exploitation in Differential Evolution Ângela A. R. Sá 1, Adriano O. Andrade 1, Alcimar B. Soares 1 and Slawomir J. Nasuto 2 Abstract. Differential Evolution (DE) is a tool for efficient
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 informationRevision of a Floating-Point Genetic Algorithm GENOCOP V for Nonlinear Programming Problems
4 The Open Cybernetics and Systemics Journal, 008,, 4-9 Revision of a Floating-Point Genetic Algorithm GENOCOP V for Nonlinear Programming Problems K. Kato *, M. Sakawa and H. Katagiri Department of Artificial
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 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 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 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 informationNon-Dominated Bi-Objective Genetic Mining Algorithm
Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 10, Number 6 (2017) pp. 1607-1614 Research India Publications http://www.ripublication.com Non-Dominated Bi-Objective Genetic Mining
More informationOptimal Design of Shell-and-Tube Heat Exchangers by Different Strategies of Differential Evolution
Optimal Design of Shell-and-Tube Heat Exchangers by Different Strategies of Differential Evolution B. V. Babu* and S. A. Munawar Abstract Department of Chemical Engineering Birla Institute of Technology
More informationEFFECTIVE CONCURRENT ENGINEERING WITH THE USAGE OF GENETIC ALGORITHMS FOR SOFTWARE DEVELOPMENT
EFFECTIVE CONCURRENT ENGINEERING WITH THE USAGE OF GENETIC ALGORITHMS FOR SOFTWARE DEVELOPMENT D.Sundar 1, Dr.K.Alagarsamy 2 1 Assistant Professor, Thiagarajar School of Management, Madurai, India 2 Associate
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 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 informationA New Modified Binary Differential Evolution Algorithm and its Applications
Appl. Math. Inf. Sci. 10, No. 5, 1965-1969 (2016) 1965 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.18576/amis/100538 A New Modified Binary Differential Evolution
More informationMechanical Component Design for Multiple Objectives Using Generalized Differential Evolution
Mechanical Component Design for Multiple Objectives Using Generalized Differential Evolution Saku Kukkonen, Jouni Lampinen Department of Information Technology Lappeenranta University of Technology P.O.
More informationBézier Curve Parametrization Using a Multiobjective Evolutionary Algorithm
International Journal of Computer Science and Applications c Technomathematics Research Foundation Vol. 11 No. 2, pp. 1-18, 2014 Bézier Curve Parametrization Using a Multiobjective Evolutionary Algorithm
More informationBinary Differential Evolution Strategies
Binary Differential Evolution Strategies A.P. Engelbrecht, Member, IEEE G. Pampará Abstract Differential evolution has shown to be a very powerful, yet simple, population-based optimization approach. The
More informationdivision 1 division 2 division 3 Pareto Optimum Solution f 2 (x) Min Max (x) f 1
The New Model of Parallel Genetic Algorithm in Multi-Objective Optimization Problems Divided Range Multi-Objective Genetic Algorithm Tomoyuki HIROYASU Mitsunori MIKI Sinya WATANABE Doshisha University,
More informationABSTRACT. Multiobjective optimization (MO) is the problem of maximizing/minimizing a set of nonlinear
ABSTRACT RADHAKRISHNAN, ALAMELU. Evolutionary Algorithms for Multiobjective Optimization with Applications in Portfolio Optimization. (Under the supervision of Dr. Negash Medhin.) Multiobjective optimization
More informationA Fuzzy Logic Controller Based Dynamic Routing Algorithm with SPDE based Differential Evolution Approach
A Fuzzy Logic Controller Based Dynamic Routing Algorithm with SPDE based Differential Evolution Approach Debraj De Sonai Ray Amit Konar Amita Chatterjee Department of Electronics & Telecommunication Engineering,
More informationBi-Objective Optimization for Scheduling in Heterogeneous Computing Systems
Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Tony Maciejewski, Kyle Tarplee, Ryan Friese, and Howard Jay Siegel Department of Electrical and Computer Engineering Colorado
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 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 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 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 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 informationI-MODE: An Interactive Multi-Objective Optimization and Decision-Making using Evolutionary Methods
I-MODE: An Interactive Multi-Objective Optimization and Decision-Making using Evolutionary Methods Kalyanmoy Deb and Shamik Chaudhuri Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute of Technology,
More informationEvolutionary Algorithms and the Cardinality Constrained Portfolio Optimization Problem
Evolutionary Algorithms and the Cardinality Constrained Portfolio Optimization Problem Felix Streichert, Holger Ulmer, and Andreas Zell Center for Bioinformatics Tübingen (ZBIT), University of Tübingen,
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 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 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 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 informationDecomposition of Multi-Objective Evolutionary Algorithm based on Estimation of Distribution
Appl. Math. Inf. Sci. 8, No. 1, 249-254 (2014) 249 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.12785/amis/080130 Decomposition of Multi-Objective Evolutionary
More informationInternational Journal of Mechatronics, Electrical and Computer Technology
Digital IIR Filter Design Using Genetic Algorithm and CCGA Method Majid Mobini Ms.c Electrical Engineering, Amirkabir University of Technology, Iran Abstract *Corresponding Author's E-mail: mobini@aut.ac.ir
More informationMultiobjective Job-Shop Scheduling With Genetic Algorithms Using a New Representation and Standard Uniform Crossover
Multiobjective Job-Shop Scheduling With Genetic Algorithms Using a New Representation and Standard Uniform Crossover J. Garen 1 1. Department of Economics, University of Osnabrück, Katharinenstraße 3,
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 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 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 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 informationA Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time
A Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time S. Suresh 1, V. Mani 1, S. N. Omkar 1, and H. J. Kim 2 1 Department of Aerospace Engineering,
More informationGlobal Optimization of a Magnetic Lattice using Genetic Algorithms
Global Optimization of a Magnetic Lattice using Genetic Algorithms Lingyun Yang September 3, 2008 Global Optimization of a Magnetic Lattice using Genetic Algorithms Lingyun Yang September 3, 2008 1 / 21
More informationTask Allocation for Minimizing Programs Completion Time in Multicomputer Systems
Task Allocation for Minimizing Programs Completion Time in Multicomputer Systems Gamal Attiya and Yskandar Hamam Groupe ESIEE Paris, Lab. A 2 SI Cité Descartes, BP 99, 93162 Noisy-Le-Grand, FRANCE {attiyag,hamamy}@esiee.fr
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 informationAn Exploration of Multi-Objective Scientific Workflow Scheduling in Cloud
International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2018 IJSRCSEIT Volume 3 Issue 3 ISSN : 2456-3307 An Exploration of Multi-Objective Scientific Workflow
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 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 informationA genetic algorithms approach to optimization parameter space of Geant-V prototype
A genetic algorithms approach to optimization parameter space of Geant-V prototype Oksana Shadura CERN, PH-SFT & National Technical Univ. of Ukraine Kyiv Polytechnic Institute Geant-V parameter space [1/2]
More informationEvolutionary Algorithm for Embedded System Topology Optimization. Supervisor: Prof. Dr. Martin Radetzki Author: Haowei Wang
Evolutionary Algorithm for Embedded System Topology Optimization Supervisor: Prof. Dr. Martin Radetzki Author: Haowei Wang Agenda Introduction to the problem Principle of evolutionary algorithm Model specification
More informationGenerating Uniformly Distributed Pareto Optimal Points for Constrained and Unconstrained Multicriteria Optimization
Generating Uniformly Distributed Pareto Optimal Points for Constrained and Unconstrained Multicriteria Optimization Crina Grosan Department of Computer Science Babes-Bolyai University Cluj-Napoca, Romania
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 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 informationDETERMINING PARETO OPTIMAL CONTROLLER PARAMETER SETS OF AIRCRAFT CONTROL SYSTEMS USING GENETIC ALGORITHM
DETERMINING PARETO OPTIMAL CONTROLLER PARAMETER SETS OF AIRCRAFT CONTROL SYSTEMS USING GENETIC ALGORITHM Can ÖZDEMİR and Ayşe KAHVECİOĞLU School of Civil Aviation Anadolu University 2647 Eskişehir TURKEY
More informationIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 12, NO. 4, AUGUST
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 12, NO. 4, AUGUST 2008 439 AbYSS: Adapting Scatter Search to Multiobjective Optimization Antonio J. Nebro, Francisco Luna, Student Member, IEEE, Enrique
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 informationAn Adaptive Normalization based Constrained Handling Methodology with Hybrid Bi-Objective and Penalty Function Approach
An Adaptive Normalization based Constrained Handling Methodology with Hybrid Bi-Objective and Penalty Function Approach Rituparna Datta and Kalyanmoy Deb Department of Mechanical Engineering, Indian Institute
More informationInternational Journal of Computer Techniques - Volume 3 Issue 2, Mar-Apr 2016
RESEARCH ARTICLE International Journal of Computer Techniques - Volume 3 Issue 2, Mar-Apr 2016 OPEN ACCESS A Comprehensive Review on Multi-Objective Optimization Using Genetic Algorithms Amarbir Singh*
More informationDesign of Curves and Surfaces Using Multi-Objective Optimization
Design of Curves and Surfaces Using Multi-Objective Optimization Rony Goldenthal and Michel Bercovier Abstract. Design by optimization of curves and surfaces is a powerful design technique. The mathematical
More informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
More information336 THE STATISTICAL SOFTWARE NEWSLETTER where z is one (randomly taken) pole of the simplex S, g the centroid of the remaining d poles of the simplex
THE STATISTICAL SOFTWARE NEWSLETTER 335 Simple Evolutionary Heuristics for Global Optimization Josef Tvrdk and Ivan Krivy University of Ostrava, Brafova 7, 701 03 Ostrava, Czech Republic Phone: +420.69.6160
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 information