# MULTI-OBJECTIVE OPTIMIZATION USING PARALLEL COMPUTATIONS

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 MULTI-OBJECTIVE OPTIMIZATION USING PARALLEL COMPUTATIONS Ausra Mackute-Varoneckiene, Antanas Zilinskas Institute of Mathematics and Informatics, Akademijos str. 4, LT Vilnius, Lithuania, Abstract. Applied optimization in process design or optimal control frequently is a multi-criteria problem. There are several approaches to the solution of multi-criteria problems, but the main approach is oriented to construct the Pareto set of the considered problem. In case of nonlinear models this problem is difficult especially if the objective functions are multimodal. Therefore application of parallel methods to solution of this problem is urgent. In the present paper efficiency of several evolutionary algorithms is compared taking into account their parallelization using multi-start model and implementation perspectives on computational grids. Keywords: multi-objective optimization, parallel computations, computational grids. 1 Introduction In many real world applications global optimization methods are applied to optimize multiple criteria functions. We consider multi-objective optimization problem defined as follows [11]:, 0,,, where is a vector of objective functions and 2. Decision vectors,,,,, where is population size, belong to the feasible region. Decision vector is Pareto optimal if there is no other solution which would improve some criteria, where,,,, without worsening at least one other criterion. A solution dominates ( ) when is better than in at least one objective and not worse in the others: ( 0 0 ). Two solutions are indifferent or incomparable ( ) if neither dominates, nor dominates. The set of non-dominated solutions is called Pareto optimal set. As all the objectives are equally important the aim of multi-objective optimization methods is not focused to find an optimum solution but a set of trade-off optimal solutions that provide a reasonable approximation of the true Pareto set. Objective functions whose nondominated vectors are in the Pareto optimal set constitute a Pareto front. Multi-criteria problems may be solved combining the multiple criteria into one scalar objective whose solution is a Pareto optimal point for the original multi-objective problem but usage of these methods do not warrant optimal Pareto front for problems with complicated Pareto sets. In last decade there has been a growing interest in evolutionary multi-objective optimization [11], [14], however the computation time needed for solving multi-objective optimization is usually large in solving real world optimization problems. In this paper, we suggest a parallel multi-objective evolutionary algorithm approach based on well known multi-objective evolutionary optimization algorithms: non-dominated sorting genetic algorithm II [6] and strength Pareto evolutionary algorithm II [15]. The efficiency of the proposed parallel algorithm versions is demonstrated using some multi-objective problems. 2 Multi-objective optimization methods 2.1 NSGA II The non-dominated sorting genetic algorithm II (NSGAII) [6] is a popular multi-objective evolutionary algorithm which improves the original NSGA proposed by Srinivas and Deb [12]. The original non-dominated sorting genetic algorithm is similar to a simple genetic algorithm except the classification of non-dominated fronts and the sharing operation. The non-dominated sorting genetic algorithm II includes several main modules: the fast non-dominated sorting and the diversity preservation [6]. In the fast non-dominated sorting every solution from the population is checked with a partially filled new set for domination. In the new set the first member from population is kept. Each solution from the population is compared with all members of the new set. If a solution dominates any member in the new set this member is removed from the new set, otherwise, if a solution is dominated by any member of the new set this solution is ignored. If a solution is not dominated by any member of the new set then this solution is entered to the new set. After this procedure when all solutions of the population are checked, members in the new set constitute the non-dominated solutions set. Since the use of sharing function approach in the original NSGA cause some difficulties because that solutions largely depends on the chosen sharing parameter value and overall complexity of the sharing approach

2 is O k in NSGAII the sharing function approach is replaced with a crowded comparison approach. Crowded comparison operator is used to find between solutions the one with better rank and if solutions belong to the same front this operator finds the solution which is located in a lesser crowded region. Estimate of the density of solutions surrounding a particular solution in the population is average distance of two points on either side of particular point along each of the objectives. The overall complexity of NSGAII is O nk, where k population size and n number of objectives. 2.2 SPEA II The strength Pareto evolutionary algorithm II () [17] is another popular multi-objective evolutionary algorithm which is based on its predecessor SPEA [16]. SPEA operates using two sets: a regular population and an archive of best solutions. For every generation archived solutions are updated by the combination of all non-dominated solutions in the regular population with the archived solutions. In this updating process all dominated or duplicate solutions are removed from the archive. In each generation new fitness values are assigned [17] to both: population and archived solution sets. Solutions with lower fitness values are given more importance, and solutions from the archived set are more likely to be chosen as a result. The final offspring population replaces the original population set to form the new population set for the next generation. An improved fitness assignment scheme is used in, which takes for each individual into account how many individuals it dominates and it is dominated by. This is done to improve decision making between solutions of equal fitness. Secondly, a nearest neighbour density estimation technique is incorporated in, which allows a more precise guidance of the search process. This is done to prevent the situation where there is only one archived solution which causes all population solutions to have the same fitness value. Thirdly, in only solutions from the archived set are used for the selection of parents for reproduction. 3 Parallelization paradigms The main goals of multi-objective evolutionary algorithms parallelization are usually the acceleration of the computation, the gain of solution quality according to the approximation of the true Pareto-Front and the diversity of the solutions. Parallel multi-objective evolutionary algorithms models are classified into main streams using different architectures [4]: The master slave model allows keeping the sequentiality of the original algorithm. The master keeps the population and manages the selection and the replacement steps. It sends sub-populations to the slaves that execute recombination and evaluation tasks. The slaves return back new solutions to the master. This approach is efficient when the cost of generating and evaluating new solutions is high. In the island model the population is constructed from a set of several sub-populations distributed among different processors. Each processor is responsible for the evolution of one sub-population and executes on a processing node all the steps of the own multi-objective algorithm. The goal is to obtain solutions with, at least, the same quality than the master slave model, but in a shorter runtime. In some cases the island model improves the quality of the solutions reached by masterslave model because the islands help to maintain diversity [5]. The diffusion model works with a population. Each processor is responsible for either a single individual or at most a part of population. The difference with respect to the island paradigm is that the diffusion-based scheme requires a neighbourhood structure of processors to perform the recombination and selection. There are additional two architectural streams separated according to whether the model manages a single solution or population of solutions [3],[2]: The parallel neighbourhood model divides the neighbourhood into partitions that are explored in parallel. It is particularly interesting when the evaluation of each solution is costly, and/or when the neighbourhood size is large. The multi-start model consists of executing in parallel several local searches, without any information exchange. This model tries to improve the quality of the search taking advantage of the diversity dispensed by each independent run (maybe using different parameters). In this work we will focus on parallelization of multi-objective evolutionary algorithms using multi-start model in order to achieve better diversity of solution in acceptable computation time. Experimental investigation has been made in the infrastructure of the LitGrid which is based on glite middleware. Workload Management System (WMS) in glite [http://glite.web.cern.ch/glite/] is responsible for distributing and managing jobs across computational resources available on Grid. Jobs in glite WMS are

3 defined using Job Description Language (JDL). Parallel versions of described algorithms were implemented using collection type of jobs. Collection jobs describe a set of independent jobs sharing the same requirements. When submitting a collection job, WMS takes all responsibility to find appropriate resources matching job requirements. When all the jobs from collection are done, the outputs are returned to the user. 4 Performance assessment In order to understand which one of the algorithms is better and in what aspects, the algorithms are compared using performance metrics which evaluates closeness of the obtained non-dominated set to the Pareto optimal front, distribution of solutions within the set and spread of the obtained non-dominated front [7], [18]. Metrics evaluating closeness to the Pareto optimal front: ER error rate [13] is calculated by the percentage of solutions that are not in the Pareto optimal front: ER N, where N is the size of the obtained set and e 1 if the solution i is not in the Pareto set, otherwise e 0. N GD generation distance [13] which is the average distance from the set of solutions to the Pareto set: GD N, where d N is the Euclidean distance from solution i to the nearest solution in the Pareto set. Metrics evaluating diversity among obtained non-dominated solutions: Spacing method [9]: S N N, where d min N M f f and f is the m objective function. N is the population size and M is the number of objectives. The interpretation of this metric is that the smaller the value S, the better the distribution in the set. Metric evaluating both closeness and diversity: Hyper-volume [10] an area of objective space covered by the obtained solutions. For two sets of solutions whichever has the greater value of hyper-volume is the best. 5 Test problems Usually for comparison of multi-objective evolutionary algorithms are used two criteria test problems. The main goal of this work is to compare performance of two parallel multi-objective evolutionary algorithms in several test problems with three criteria. Test functions were taken from literature: LZ07_F6 [8]: min cos 0.5 cos sin 2 min cos 0.5 sin sin 2 min sin sin 2 here: DTLZ2 [1]: here: 3, 1 is multiplication of 3, 3, 2 is multiplication of 3, 3, is multiplications of 3, 0, 1, 2,, 2, 10. min 2 1 cos 2 cos 2, min 2 1 cos 2 sin 2, min 2 1 sin 2, , 0 1, 1,,,

4 6 Empirical results Parallel evolutionary multi-objective optimization algorithms efficiency was evaluated according four criteria of efficiency: ER error rate, S spacing criteria, HV hyper-volume, GD generation distance. First we evaluated non-parallel versions of NSGAII and. Experiments were performed with various populations sizes and number of generations. In Table 1 are presented results of multi-criteria test problems optimization. Values of criteria shows that the most importance to quality of obtained Pareto gives defined population size; the population size is bigger, the approximated Pareto front is better. Even increasing of number of generations does not improve optimization results. Parallel versions of algorithms were investigated in a two ways. First we defined population size 200 and number of generations 5000 and performed these parallel algorithms on 5, 10, 15 processors. Results are presented in Table 2. Table 1. Performance assessment of non-parallel versions of algorithms LZ07_F6 DTLZ2 Algorithm ER S HV GD ER S HV GD NSGAII Pop: Gen: NSGAII Pop: Gen: NSGAII Pop: Gen: NSGAII Pop: Gen: NSGAII Pop: Gen: NSGAII Pop: Gen: Table 2. Performance assessment of parallel versions of algorithms LZ07_F6 DTLZ2 Algorithm ER S HV GD ER S HV GD NSGAII Pop: Gen: 5000 Proc: NSGAII Pop: Gen: 5000 Proc: NSGAII Pop: Gen: 5000 Proc: NSGAII Pop: Gen: 500 Proc: NSGAII Pop: Gen: 500 Proc: NSGAII Pop: Gen: 500 Proc:

5 Obtained results are similar to results of non-parallel performance of the algorithms. But non-parallel algorithms execution with used parameters is time consuming process and using parallel versions of algorithms improves performance by time criterion. For example, non-parallel with population size 1000 and number of generations 5000 execution takes s and parallel with population size 200, number of generations 5000 and number of processors 5 takes 5592 s. This is important because similar results are obtained in shorter time. Second experiment was performed to verify hypothesis that usage of larger population size and smaller number of generations on several processors enables to improve Pareto front approximation. For experimental investigation we used population size 1000, number of generations 500 and number of processors 5, 10, 15. Results are presented in Table 2. Comparing results with results obtained with non-parallel algorithms Pareto approximations of parallel algorithms are better. Better approximations of Pareto fronts are obtained with parallel version of algorithm. This can be observed in Figures 1-8. In these figures are presented Pareto fronts approximations obtained with nonparallel and parallel versions of algorithms and with various algorithm parameters. Figure 1. Pareto front approximation for LZ07_F6 problem with non-parallel version (pop. size Pareto front marked by ( ). Figure 2. Pareto front approximation for LZ07_F6 problem with parallel version (pop. size 1000, indicated by ( ). True Pareto front marked by ( ). Figure 3. Pareto front approximation for LZ07_F6 problem with non-parallel NSGAII version (pop. size Pareto front marked by ( ). Figure 4. Pareto front approximation for LZ07_F6 problem with parallel NSGAII version (pop. size 1000, indicated by ( ). True Pareto front marked by ( )

6 Figure 5. Pareto front approximation for DTLZ2 problem with non-parallel version (pop. size Pareto front marked by points (.). Figure 6. Pareto front approximation for DTLZ2 problem with parallel version (pop. size 1000, indicated by ( ). True Pareto front marked by points (.). Figure 7. Pareto front approximation for DTLZ2 problem with non-parallel NSGAII version (pop. size Pareto front marked by points (.). Figure 8. Pareto front approximation for DTLZ2 problem with parallel NSGAII version (pop. size 1000, indicated by ( ). True Pareto front marked by points (.). 7 Conclusions Multi-objective evolutionary optimization methods are efficient techniques for construction of Pareto front for problems with more than two criteria. Best approximation of Pareto front is obtained when large initial population is used. The considered methods are amenable to parallelization including grid technology. The use of multi-start model for parallelization of multi-objective algorithms reduced computation time and let to obtain better Pareto front approximations. 8 Acknowledgements The authors acknowledge the support of Lithuanian Fund for Science and Studies, and Agency for International Science and Technology Development Programmes in Lithuania through COST programme. References [1] Abraham A., Jain L. C., Goldberg R. Evolutionary Multiobjective Optimization: Theoretical Advances and Applications, Springer, [2] Banos R., Gil C., Paechter B., Ortega J. Parallelization of population-based multi-objective meta-heuristics: An empirical study. Applied Mathematical Modelling, vol. 30, 2006, pp [3] Cahon S., Melab N., Talbi E.-G. ParadisEO: a framework for the flexible design of parallel and distributed hybrid metaheuristics. J. Heuristics, 10 (3), 2004, pp

7 [4] Cant-paz E. A survey of parallel genetic algorithms. Calculateurs Paralleles, vol. 10, pp , www. illigal.ge.uiuc.edu/~cantupaz/publications/cparalleles98-survey.ps.gz, 1998 ( ) [5] Cant-Paz E. Migration policies, selection pressure and parallel evolutionary algorithms. Technical report Illigal TR , University of Illinois, Urbana-Champaign, 1999, doi= [6] Deb K., Pratap A., Agarwal S., Meyarivan T. A fast and elitist multi-objective genetic algorithm: NSGA II. IEEE Transactions on Evolutionary Computation, vol. 6, Nr. 2, 2002, pp [7] Deb K., Thiele L., Laumanns M., Zitzler E. Scalable test problems for evolutionary multi-objective optimization. In Abraham A., Jain R., Goldberg R. eds.: Evolutionary Multiobjective Optimization: Theoretical Advances and Application, Springer, 2005, pp [8] Li H., Zhang Q. Multiobjective Optimization Problems with Complicated Pareto Set, MOEA/D and NSGA-II. IEEE Transactions on Evolutionary Computation, in pres, [9] Naujoks, B., Beume, N., and Emmerich, M. Multi-objective optimisation using s-metric selection: application to three-dimensional solution spaces. In Evolutionary Computation, IEEE Press, the 2005 IEEE Congress on Publication Date: 2--5 Sept (Piscataway, NY, 2005), vol. 2, 2005, pp [10] Nebro A.J., Luna F., Alba E., Beham A., Dorronsoro B. AbYSS: Adapting Scatter Search for multiobjective optimization. Tech Rep. ITI , University of Málaga, [11] Miettinen K. M. Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, [12] Srinivas N., Deb K. Multi-objective function optimization using non-dominated sorting genetic algorithms. Evolutionary computation, Vol. 2, 1995, pp [13] Veldhuizen D. Multiobjective evolutionary algorithms: classifications, analyses, and new innovation. Ph. D. thesis, Department of electrical engineering and computer engineering, Airforce institute of technology, Ohio, 1999, [14] Wolpert D.H., Macready W.G. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, vol.1, Issue 1, 1997, pp , digital Object Identifier / [15] Zitzler E., Laumanns M., Thiele L. SPEA2: Improving the Strength Pareto Evolutionary Algorithm. In EUROGEN 2001.Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, Giannakoglou K., Tsahalis D., Periaux J., Papailou P., Fogarty T., Eds., Athens, Greece, 2002, pp [16] Zitzler E., Thiele L. An evolutionary algorithm for multiobjective optimization: The strength Pareto approach. Technical Report 43, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland, [17] Zitzler E., Thiele L. Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3(4), 1999, pp [18] Zitzler E., Thiele L., Deb K. Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation, 8(1), 2000, pp

### A New Multi-objective Evolutionary Optimisation Algorithm: The Two-Archive Algorithm

A New Multi-objective Evolutionary Optimisation Algorithm: The Two-Archive Algorithm Kata Praditwong 1 and Xin Yao 2 The Centre of Excellence for Research in Computational Intelligence and Applications(CERCIA),

### An Alternative Archiving Technique for Evolutionary Polygonal Approximation

An Alternative Archiving Technique for Evolutionary Polygonal Approximation José Luis Guerrero, Antonio Berlanga and José Manuel Molina Computer Science Department, Group of Applied Artificial Intelligence

### Simple Population Replacement Strategies for a Steady-State Multi-Objective Evolutionary Algorithm

Simple Population Replacement Strategies for a Steady-State Multi-Objective Evolutionary Christine L. Mumford School of Computer Science, Cardiff University PO Box 916, Cardiff CF24 3XF, United Kingdom

### An Evolutionary Algorithm in Grid Scheduling by multiobjective Optimization using variants of NSGA

International Journal of Scientific and Research Publications, Volume 2, Issue 9, September 2012 1 An Evolutionary Algorithm in Grid Scheduling by multiobjective Optimization using variants of NSGA Shahista

### A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II

182 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 2, APRIL 2002 A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II Kalyanmoy Deb, Associate Member, IEEE, Amrit Pratap, Sameer Agarwal,

### jmetal: a Java Framework for Developing Multi-Objective Optimization Metaheuristics

jmetal: a Java Framework for Developing Multi-Objective Optimization Metaheuristics Juan J. Durillo, Antonio J. Nebro, Francisco Luna, Bernabé Dorronsoro, Enrique Alba Departamento de Lenguajes y Ciencias

### BPM optimization Part 2: Workflow map optimization by using multiobjective algorithms

Part 2: Workflow map optimization by using multiobjective algorithms Determine the optimum process paths for the selected criteria by application of multiobjective optimization algorithms 4/12/2012 IBM

### Defining and Optimizing Indicator-based Diversity Measures in Multiobjective Search

Defining and Optimizing Indicator-based Diversity Measures in Multiobjective Search Tamara Ulrich, Johannes Bader, and Lothar Thiele Computer Engineering and Networks Laboratory, ETH Zurich 8092 Zurich,

### Multi-Objective Optimization to Workflow Grid Scheduling using Reference Point based Evolutionary Algorithm

Multi-Objective Optimization to Workflow Grid Scheduling using Reference Point based Evolutionary Algorithm Ritu Garg Assistant Professor Computer Engineering Department National Institute of Technology,

### Package NHEMOtree. February 19, 2015

Type Package Package NHEMOtree February 19, 2015 Title Non-hierarchical evolutionary multi-objective tree learner to perform cost-sensitive classification Depends partykit, emoa, sets, rpart Version 1.0

### On Sequential Online Archiving of Objective Vectors

On Sequential Online Archiving of Objective Vectors Manuel López-Ibáñez, Joshua Knowles, and Marco Laumanns IRIDIA Technical Report Series Technical Report No. TR/IRIDIA/2011-001 January 2011 Last revision:

### Introduction To Genetic Algorithms

1 Introduction To Genetic Algorithms Dr. Rajib Kumar Bhattacharjya Department of Civil Engineering IIT Guwahati Email: rkbc@iitg.ernet.in References 2 D. E. Goldberg, Genetic Algorithm In Search, Optimization

### Multi-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

### Non-dominated Rank based Sorting Genetic Algorithms

Fundamenta Informaticae 83 (2008) 231 252 231 IOS Press Non-dominated Rank based Sorting Genetic Algorithms Ashish Ghosh Machine Intelligence Unit and Center for Soft Computing Research Indian Statistical

### A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms

A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms MIGUEL CAMELO, YEZID DONOSO, HAROLD CASTRO Systems and Computer Engineering Department Universidad de los

### Multi-objective Approaches to Optimal Testing Resource Allocation in Modular Software Systems

Multi-objective Approaches to Optimal Testing Resource Allocation in Modular Software Systems Zai Wang 1, Ke Tang 1 and Xin Yao 1,2 1 Nature Inspired Computation and Applications Laboratory (NICAL), School

### A Study of Local Optima in the Biobjective Travelling Salesman Problem

A Study of Local Optima in the Biobjective Travelling Salesman Problem Luis Paquete, Marco Chiarandini and Thomas Stützle FG Intellektik, Technische Universität Darmstadt, Alexanderstr. 10, Darmstadt,

### Multi-Objective Optimization of Intrusion Detection Systems for Wireless Sensor Networks

Multi-Objective Optimization of Intrusion Detection Systems for Wireless Sensor Networks Martin Stehlík 1, Adam Saleh 1, Andriy Stetsko 1 and Vashek Matyáš 1 1 Masaryk University, Brno, Czech Republic

### A Novel Constraint Handling Strategy for Expensive Optimization Problems

th World Congress on Structural and Multidisciplinary Optimization 7 th - 2 th, June 25, Sydney Australia A Novel Constraint Handling Strategy for Expensive Optimization Problems Kalyan Shankar Bhattacharjee,

### Electric Distribution Network Multi objective Design Using Problem Specific Genetic Algorithm

Electric Distribution Network Multi objective Design Using Problem Specific Genetic Algorithm 1 Parita Vinodbhai Desai, 2 Jignesh Patel, 3 Sangeeta Jagdish Gurjar 1 Department of Electrical Engineering,

### The 10 th International Scientific Conference elearning and software for Education Bucharest, April 24-25, 2014 10.12753/2066-026X-14-081

The 10 th International Scientific Conference elearning and software for Education Bucharest, April 24-25, 2014 10.12753/2066-026X-14-081 DIFFERENT APPROACHES FOR SOLVING OPTIMIZATION PROBLEMS USING INTERACTIVE

### Hiroyuki Sato. Minami Miyakawa. Keiki Takadama ABSTRACT. Categories and Subject Descriptors. General Terms

Controlling election Area of Useful Infeasible olutions and Their Archive for Directed Mating in Evolutionary Constrained Multiobjective Optimization Minami Miyakawa The University of Electro-Communications

### 4. Design Space Exploration of Embedded Systems

4. Design Space Exploration of Embedded Systems Lothar Thiele ETH Zurich, Switzerland 4-1 Contents of Lectures (Lothar Thiele) 1. Introduction to Embedded System Design 2. Software for Embedded Systems

### Multiobjective Multicast Routing Algorithm

Multiobjective Multicast Routing Algorithm Jorge Crichigno, Benjamín Barán P. O. Box 9 - National University of Asunción Asunción Paraguay. Tel/Fax: (+9-) 89 {jcrichigno, bbaran}@cnc.una.py http://www.una.py

### Multi-Objective Problem Solving With Offspring on Enterprise Clouds

Multi-Objective Problem Solving With Offspring on Enterprise Clouds Christian Vecchiola, Michael Kirley, and Rajkumar Buyya Department of Computer Science & Software Engineering The University of Melbourne,

### An Optimal Design of Constellation of Multiple Regional Coverage

An Optimal Design of Constellation of Multiple Regional Coverage Based on NSGA-II 1 Xiaoqian Huang, 1,* Guangming Dai 1, School of Computer Science, China University of Geosciences, gmdai@cug.edu.cn *

### Multiobjective Optimization and Evolutionary Algorithms for the Application Mapping Problem in Multiprocessor System-on-Chip Design

358 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 10, NO. 3, JUNE 2006 Multiobjective Optimization and Evolutionary Algorithms for the Application Mapping Problem in Multiprocessor System-on-Chip

### 4. Zastosowania Optymalizacja wielokryterialna

4. Zastosowania Optymalizacja wielokryterialna Tadeusz Burczyński 1,2) 1), Department for Strength of Materials and Computational Mechanics, Konarskiego 18a, 44-100 Gliwice, Poland 2) Cracow University

### Multi-Objective Genetic Test Generation for Systems-on-Chip Hardware Verification

Multi-Objective Genetic Test Generation for Systems-on-Chip Hardware Verification Adriel Cheng Cheng-Chew Lim The University of Adelaide, Australia 5005 Abstract We propose a test generation method employing

### MULTI-OBJECTIVE EVOLUTIONARY SIMULATION- OPTIMIZATION OF PERSONNEL SCHEDULING

MULTI-OBJECTIVE EVOLUTIONARY SIMULATION- OPTIMIZATION OF PERSONNEL SCHEDULING Anna Syberfeldt 1, Martin Andersson 1, Amos Ng 1, and Victor Bengtsson 2 1 Virtual Systems Research Center, University of Skövde,

### Energy Efficiency Metaheuristic Mechanism for Cloud Broker in Multi-Cloud Computing

Energy Efficiency Metaheuristic Mechanism for Cloud Broker in Multi-Cloud Computing Anh Quan Nguyen, Alexandru-Adrian Tantar, Pascal Bouvry (1) El-Ghazali Talbi (2) {anh.nguyen, alexandru.tantar, pascal.bouvry}@uni.lu

### A Multi-Objective Optimisation Approach to IDS Sensor Placement

A Multi-Objective Optimisation Approach to IDS Sensor Placement Hao Chen 1, John A. Clark 1, Juan E. Tapiador 1, Siraj A. Shaikh 2, Howard Chivers 2, and Philip Nobles 2 1 Department of Computer Science

### Biopharmaceutical Portfolio Management Optimization under Uncertainty

Ian David Lockhart Bogle and Michael Fairweather (Editors), Proceedings of the 22nd European Symposium on Computer Aided Process Engineering, 17-20 June 2012, London. 2012 Elsevier B.V. All rights reserved

### ACO FOR OPTIMAL SENSOR LAYOUT

Stefka Fidanova 1, Pencho Marinov 1 and Enrique Alba 2 1 Institute for Parallel Processing, Bulgarian Academy of Science, Acad. G. Bonchev str. bl.25a, 1113 Sofia, Bulgaria 2 E.T.S.I. Informatica, Grupo

### Maintenance scheduling by variable dimension evolutionary algorithms

Advances in Safety and Reliability Kołowrocki (ed.) 2005 Taylor & Francis Group, London, ISBN 0 415 38340 4 Maintenance scheduling by variable dimension evolutionary algorithms P. Limbourg & H.-D. Kochs

### International Journal of Computer & Organization Trends Volume21 Number1 June 2015 A Study on Load Balancing in Cloud Computing

A Study on Load Balancing in Cloud Computing * Parveen Kumar * Er.Mandeep Kaur Guru kashi University,Talwandi Sabo Guru kashi University,Talwandi Sabo Abstract: Load Balancing is a computer networking

### Population-ACO for the Automotive Deployment Problem

Population-ACO for the Automotive Deployment Problem Evolutionary Multiobjective Optimisation I. Moser J. Montgomery Faculty of Information and Communication Technologies Swinburne University of Technology

### Population-ACO for the Automotive Deployment Problem

c ACM, 2011. This is the author s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 13th

### Genetic Algorithm Based Bi-Objective Task Scheduling in Hybrid Cloud Platform

Genetic Algorithm Based Bi-Objective Task Scheduling in Hybrid Cloud Platform Leena V. A., Ajeena Beegom A. S., and Rajasree M. S., Member, IACSIT Abstract Hybrid cloud is a type of the general cloud computing

### A Green Model of Cloud Resources Provisioning

A Green Model of Cloud Resources Provisioning Meriem Azaiez 1, Walid Chainbi 1 and Hanen Chihi 2 1 National Engineering School of Sousse, University of Sousse, Sousse, Tunisia 2 Institute of Computer Sciences

### An Empirical Study and Analysis of the Dynamic Load Balancing Techniques Used in Parallel Computing Systems

An Empirical Study and Analysis of the Dynamic Load Balancing Techniques Used in Parallel Computing Systems Ardhendu Mandal and Subhas Chandra Pal Department of Computer Science and Application, University

### A Multi-objective Scheduling Model for Solving the Resource-constrained Project Scheduling and Resource Leveling Problems. Jia Hu 1 and Ian Flood 2

A Multi-objective Scheduling Model for Solving the Resource-constrained Project Scheduling and Resource Leveling Problems Jia Hu 1 and Ian Flood 2 1 Ph.D. student, Rinker School of Building Construction,

### Multi-objective Robust Optimization Algorithms for Improving Energy Consumption and Thermal Comfort of Buildings

Multi-objective Robust Optimization Algorithms for Improving Energy Consumption and Thermal Comfort of Buildings M.Sc. Thesis by Robert Marijt Faculty of Computer Science at the University of Leiden, July,

### Bi-Objective Optimization of MQL Based Turning Process Using NSGA II

Bi-Objective Optimization of MQL Based Turning Process Using NSGA II N.Chandra Sekhar Reddy 1, D. Kondayya 2 P.G. Student, Department of Mechanical Engineering, Sreenidhi Institute of Science & Technology,

### Genetic Algorithms for Bridge Maintenance Scheduling. Master Thesis

Genetic Algorithms for Bridge Maintenance Scheduling Yan ZHANG Master Thesis 1st Examiner: Prof. Dr. Hans-Joachim Bungartz 2nd Examiner: Prof. Dr. rer.nat. Ernst Rank Assistant Advisor: DIPL.-ING. Katharina

### Nature of Real-World Multi-objective Vehicle Routing with Evolutionary Algorithms

Nature of Real-World Multi-objective Vehicle Routing with Evolutionary Algorithms Juan Castro-Gutierrez, Dario Landa-Silva ASAP Research Group, School of Computer Science University of Nottingham, UK jpc@cs.nott.ac.uk,

### The Automotive Deployment Problem: A Practical Application for Constrained Multiobjective Evolutionary Optimisation

WCCI 2010 IEEE World Congress on Computational Intelligence July, 18-23, 2010 - CCIB, Barcelona, Spain CEC IEEE The Automotive Deployment Problem: A Practical Application for Constrained Multiobjective

### Multi-variable Geometry Repair and Optimization of Passive Vibration Isolators

Multi-variable Geometry Repair and Optimization of Passive Vibration Isolators Alexander I.J. Forrester and Andy J. Keane University of Southampton, Southampton, Hampshire, SO17 1BJ, UK A range of techniques

### A Simulated Annealing Based Multi-objective Optimization Algorithm: AMOSA

A Simulated Annealing Based Multi-objective Optimization Algorithm: AMOSA Sanghamitra Bandyopadhyay, Sriparna Saha, Ujjwal Maulik and Kalyanmoy Deb 3 Machine Intelligence Unit, Indian Statistical Institute,

### MAGS An Approach Using Multi-Objective Evolutionary Algorithms for Grid Task Scheduling

Issue 2, Volume 5, 2011 117 MAGS An Approach Using Multi-Objective Evolutionary Algorithms for Grid Task Scheduling Miguel Camelo, Yezid Donoso, Harold Castro Systems and Computing Engineering Department

### On Set-Based Multiobjective Optimization

1 On Set-Based Multiobjective Optimization Eckart Zitzler, Lothar Thiele, and Johannes Bader Abstract Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can

### A GRAPHICAL TOOL FOR CLOUD-BASED BUILDING ENERGY SIMULATION. National Renewable Energy Laboratory, Golden, CO

2014 ASHRAE/IBPSA-USA Building Simulation Conference Atlanta, GA September 10-12, 2014 A GRAPHICAL TOOL FOR CLOUD-BASED BUILDING ENERGY SIMULATION Daniel L. Macumber1, Brian L. Ball1, and Nicholas L. Long1

### Solving a multi-mode bi-objective resource investment problem using meta-heuristic algorithms

Advanced Computational Techniques in Electromagnetics 0 No. (0) -8 Available online at www.ispacs.com/acte Volume 0, Issue, Year 0 Article ID acte-009, 8 Pages doi:0.899/0/acte-009 Research Article Solving

### A Multi-Objective Extremal Optimisation Approach Applied to RFID Antenna Design

A Multi-Objective Extremal Optimisation Approach Applied to RFID Antenna Design Pedro Gómez-Meneses, Marcus Randall and Andrew Lewis Abstract Extremal Optimisation (EO) is a recent nature-inspired meta-heuristic

### Consistencies and Contradictions of Performance Metrics in Multiobjective Optimization

IEEE TRANSACTIONS ON CYBERNETICS Consistencies and Contradictions of Performance Metrics in Multiobjective Optimization Siwei Jiang, Yew-Soon Ong, Jie Zhang, Liang Feng Abstract An important consideration

### Search Algorithm in Software Testing and Debugging

Search Algorithm in Software Testing and Debugging Hsueh-Chien Cheng Dec 8, 2010 Search Algorithm Search algorithm is a well-studied field in AI Computer chess Hill climbing A search... Evolutionary Algorithm

### A Multiobjective Genetic Fuzzy System for Obtaining Compact and Accurate Fuzzy Classifiers with Transparent Fuzzy Partitions

A Multiobjective Genetic Fuzzy System for Obtaining Compact and Accurate Fuzzy Classifiers with Transparent Fuzzy Partitions Pietari Pulkkinen Tampere University of Technology Department of Automation

### Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds

Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds REAL-WORLD SIMULATION-BASED MANUFACTURING OPTIMIZATION USING CUCKOO SEARCH

### Multiobjective Simulation Optimisation in Software Project Management

Multiobjective Simulation Optimisation in Software Project Management Mercedes Ruiz Dept of Computer Science The University of Cádiz 11002 Cádiz, Spain mercedes.ruiz@uca.es José C. Riquelme Dept of Computer

### Maintenance Scheduling of Fighter Aircraft Fleet with Multi-Objective Simulation-Optimization

Maintenance Scheduling of Fighter Aircraft Fleet with Multi-Objective Simulation-Optimization Ville Mattila, Kai Virtanen, and Raimo P. Hämäläinen Systems ville.a.mattila@tkk.fi, kai.virtanen@tkk.fi, raimo@hut.fi

### CHAPTER 4. APPLICATION AND COMPARISON OF MOEAs TO MORPP PROBLEM

68 CHAPTER 4 APPLICATION AND COMPARISON OF MOEAs TO MORPP PROBLEM 4.1 INTRODUCTION This chapter describes about the application and comparison of MOEAs viz. NSGA-II, MNSGA-II and I-GDE3 to solve MORPP

### GENETIC-BASED SOLUTIONS FOR INDEPENDENT BATCH SCHEDULING IN DATA GRIDS

GENETIC-BASED SOLUTIONS FOR INDEPENDENT BATCH SCHEDULING IN DATA GRIDS Joanna Ko lodziej Cracow University of Technology, Poland Email: jokolodziej@pk.edu.pl Samee U. Khan North Dakota State University

### Toward an Interactive Method for DMEA-II and Application to the Spam-Email Detection System

VNU Journal of Science: Comp. Science & Com. Eng. Vol. 30, No. 4 (2014) 29 43 Toward an Interactive Method for DMEA-II and Application to the Spam-Email Detection System Long Nguyen 1, Lam Thu Bui 1, Anh

### The Software Project Scheduling Problem: A Scalability Analysis of Multi-objective Metaheuristics

The Software Project Scheduling Problem: A Scalability Analysis of Multi-objective Metaheuristics Francisco Luna a,, David L. González-Álvarezb, Francisco Chicano c, Miguel A. Vega-Rodríguez b a Dept.

### Advances in Smart Systems Research : ISSN 2050-8662 : http://nimbusvault.net/publications/koala/assr/ Vol. 3. No. 3 : pp.

Advances in Smart Systems Research : ISSN 2050-8662 : http://nimbusvault.net/publications/koala/assr/ Vol. 3. No. 3 : pp.49-54 : isrp13-005 Optimized Communications on Cloud Computer Processor by Using

### On the Value of User Preferences in Search-Based Software Engineering: A Case Study in Software Product Lines

On the Value of User Preferences in Search-Based Software Engineering: A Case Study in Software Product Lines Abdel Salam Sayyad Tim Menzies Hany Ammar Lane Department of Computer Science and Electrical

### Multiobjective Simulation Optimisation in Software Project Management

Multiobjective Simulation Optimisation in Software Project Management Daniel Rodríguez Dept of Computer Science University of Alcalá 28871 Alcalá de Henares, Madrid, Spain daniel.rodriguezg@uah.es José

### Abstract. 1. Introduction

Optimization of Diesel Engine Emissions and Fuel Efficiency Using Genetic Algorithms and Phenomenological Model with EGR, Injection Timing and Multiple Injections Hiro Hiroyasu and Haiyan Miao, Kinki University

### Research on SQLite Database Query Optimization Based on Improved PSO Algorithm

, pp.239-246 http://dx.doi.org/10.14257/ijdta.2016.9.4.22 Research on SQLite Database Query Optimization Based on Improved PSO Algorithm Aite Zhao 1, Zhiqiang Wei 1 and Yongquan Yang 1,* 1 Ocean University

### A Performance Study of Load Balancing Strategies for Approximate String Matching on an MPI Heterogeneous System Environment

A Performance Study of Load Balancing Strategies for Approximate String Matching on an MPI Heterogeneous System Environment Panagiotis D. Michailidis and Konstantinos G. Margaritis Parallel and Distributed

### Multi-Objective Optimization for Multi-Satellite Scheduling System

Multi-Objective Optimization for Multi-Satellite Scheduling System Feng-Tai Hwang*, Yi-Yao Yeh** and Sheng-Yi Li*** *Associate Researcher, National Space Organization (NSPO) 8F, 9 Prosperity 1st Rd. Hsinchu

### International Journal of Software and Web Sciences (IJSWS) Web Log Mining Based on Improved FCM Algorithm using Multiobjective

International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International

### Game Theory Based Load Balanced Job Allocation in Distributed Systems

in Distributed Systems Anthony T. Chronopoulos Department of Computer Science University of Texas at San Antonio San Antonio, TX, USA atc@cs.utsa.edu Load balancing: problem formulation Load balancing

### Model-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms

Symposium on Automotive/Avionics Avionics Systems Engineering (SAASE) 2009, UC San Diego Model-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms Dipl.-Inform. Malte Lochau

### WORKFLOW ENGINE FOR CLOUDS

WORKFLOW ENGINE FOR CLOUDS By SURAJ PANDEY, DILEBAN KARUNAMOORTHY, and RAJKUMAR BUYYA Prepared by: Dr. Faramarz Safi Islamic Azad University, Najafabad Branch, Esfahan, Iran. Workflow Engine for clouds

### On the Order of Search for Personal Identification with Biometric Images

On the Order of Search for Personal Identification with Biometric Images Kensuke Baba Library, Kyushu University 10-1, Hakozaki 6, Higashi-ku Fukuoka, 812-8581, Japan baba.kensuke.060@m.kyushu-u.ac.jp

### Solving Three-objective Optimization Problems Using Evolutionary Dynamic Weighted Aggregation: Results and Analysis

Solving Three-objective Optimization Problems Using Evolutionary Dynamic Weighted Aggregation: Results and Analysis Abstract. In this paper, evolutionary dynamic weighted aggregation methods are generalized

### Comparison of Evolutionary Algorithms in Non-dominated Solutions of Time-Cost-Resource Optimization Problem

Comparison of Evolutionary Algorithms in Non-dominated Solutions of Time-Cost-Resource Optimization Problem Mehdi Tavakolan,Ph.D.Candidate Columbia University New York, NY Babak Ashuri,Ph.D. Georgia Institute

### ENHANCED CONFIDENCE INTERPRETATIONS OF GP BASED ENSEMBLE MODELING RESULTS

ENHANCED CONFIDENCE INTERPRETATIONS OF GP BASED ENSEMBLE MODELING RESULTS Michael Affenzeller (a), Stephan M. Winkler (b), Stefan Forstenlechner (c), Gabriel Kronberger (d), Michael Kommenda (e), Stefan

### A Novel Switch Mechanism for Load Balancing in Public Cloud

International OPEN ACCESS Journal Of Modern Engineering Research (IJMER) A Novel Switch Mechanism for Load Balancing in Public Cloud Kalathoti Rambabu 1, M. Chandra Sekhar 2 1 M. Tech (CSE), MVR College

### with a Preview of Version 4.2

9. LS-DYNA Forum, Bamberg 2010 Optimierung II An Overview of LS-OPT Functionality with a Preview of Version 4.2 Nielen Stander* David Björkevik**, Christoffer Belestam** Katharina Witowski Trent Eggleston

### Research Article QoS-Aware Multiobjective Optimization Algorithm for Web Services Selection with Deadline and Budget Constraints

Hindawi Publishing Corporation Advances in Mechanical Engineering Volume 214, Article ID 361298, 7 pages http://dx.doi.org/1.1155/214/361298 Research Article QoS-Aware Multiobjective Optimization Algorithm

### Evaluation of Crossover Operator Performance in Genetic Algorithms with Binary Representation

Evaluation of Crossover Operator Performance in Genetic Algorithms with Binary Representation Stjepan Picek, Marin Golub, and Domagoj Jakobovic Faculty of Electrical Engineering and Computing, Unska 3,

### HYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM. Jin-Lee KIM 1, M. ASCE

1560 HYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM Jin-Lee KIM 1, M. ASCE 1 Assistant Professor, Department of Civil Engineering and Construction

### Distributed Dynamic Load Balancing for Iterative-Stencil Applications

Distributed Dynamic Load Balancing for Iterative-Stencil Applications G. Dethier 1, P. Marchot 2 and P.A. de Marneffe 1 1 EECS Department, University of Liege, Belgium 2 Chemical Engineering Department,

### COMPUTATIONIMPROVEMENTOFSTOCKMARKETDECISIONMAKING MODELTHROUGHTHEAPPLICATIONOFGRID. Jovita Nenortaitė

ISSN 1392 124X INFORMATION TECHNOLOGY AND CONTROL, 2005, Vol.34, No.3 COMPUTATIONIMPROVEMENTOFSTOCKMARKETDECISIONMAKING MODELTHROUGHTHEAPPLICATIONOFGRID Jovita Nenortaitė InformaticsDepartment,VilniusUniversityKaunasFacultyofHumanities

### BMOA: Binary Magnetic Optimization Algorithm

International Journal of Machine Learning and Computing Vol. 2 No. 3 June 22 BMOA: Binary Magnetic Optimization Algorithm SeyedAli Mirjalili and Siti Zaiton Mohd Hashim Abstract Recently the behavior of

### Transmission expansion plan: ordinal and metaheuristic multiobjective optimization

Paper accepted for presentation at the 2011 IEEE Trondheim PowerTech 1 Transmission expansion plan: ordinal and metaheuristic multiobjective optimization J. D. Molina, GSM, IEEE and H. Rudnick, Fellow

### Differential Evolution Particle Swarm Optimization for Digital Filter Design

Differential Evolution Particle Swarm Optimization for Digital Filter Design Bipul Luitel, and Ganesh K. Venayagamoorthy, Abstract In this paper, swarm and evolutionary algorithms have been applied for

### Index Terms- Batch Scheduling, Evolutionary Algorithms, Multiobjective Optimization, NSGA-II.

Batch Scheduling By Evolutionary Algorithms for Multiobjective Optimization Charmi B. Desai, Narendra M. Patel L.D. College of Engineering, Ahmedabad Abstract - Multi-objective optimization problems are

### SCHEDULING AND INSPECTION PLANNING IN SOFTWARE DEVELOPMENT PROJECTS USING MULTI-OBJECTIVE HYPER-HEURISTIC EVOLUTIONARY ALGORITHM

SCHEDULING AND INSPECTION PLANNING IN SOFTWARE DEVELOPMENT PROJECTS USING MULTI-OBJECTIVE HYPER-HEURISTIC EVOLUTIONARY ALGORITHM A.Charan Kumari and K. Srinivas 2 Department of Physics & Computer Science,

### Limits of Scalability of Multiobjective Estimation of Distribution Algorithms

Limits of Scalability of Multiobjective Estimation of Distribution Algorithms Kumara Sastry 1, Martin Pelikan 2, David E. Goldberg 1 1 Illinois Genetic Algorithms Laboratory (IlliGAL) Department of General

### Development of Parallel Distributed Computing System for ATPG Program

Development of Parallel Distributed Computing System for ATPG Program ABSTRACT K. Han Electrical and Computer Engineering Auburn University I present an approach about how to increase the speed-up ratio

### Alpha Cut based Novel Selection for Genetic Algorithm

Alpha Cut based Novel for Genetic Algorithm Rakesh Kumar Professor Girdhar Gopal Research Scholar Rajesh Kumar Assistant Professor ABSTRACT Genetic algorithm (GA) has several genetic operators that can

### Evolving Path Generation Compliant Mechanisms (PGCM) using Local-search based Multi-objective Genetic Algorithm

Evolving Path Generation Compliant Mechanisms (PGCM) using Local-search based Multi-objective Genetic Algorithm *Deepak Sharma, Kalyanmoy Deb and N. N. Kishore Department of Mechanical Engineering Indian

### The Bi-Objective Pareto Constraint

The Bi-Objective Pareto Constraint Renaud Hartert and Pierre Schaus UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Belgium {renaud.hartert,pierre.schaus}@uclouvain.be Abstract. Multi-Objective

### A route planning optimisation system for the steelmaking industry based on Multi-Objective Evolutionary Algorithms

2014 UKSim-AMSS 8th European Modelling Symposium A route planning optimisation system for the steelmaking industry based on Multi-Objective Evolutionary Algorithms Gianluca Nastasi, Valentina Colla and