Maintenance scheduling by variable dimension evolutionary algorithms
|
|
- Cori Chandler
- 8 years ago
- Views:
Transcription
1 Advances in Safety and Reliability Kołowrocki (ed.) 2005 Taylor & Francis Group, London, ISBN Maintenance scheduling by variable dimension evolutionary algorithms P. Limbourg & H.-D. Kochs Institute of Information Technology, Department of Engineering, University of Duisburg-Essen, Duisburg, Germany ABSTRACT: Lots of research has been done on optimization strategies finding optimal maintenance schedules. Much less attention is turned to how the schedule is represented to the algorithm. Either the search space is represented as a binary string leading to highly complex combinatorial problem or maintenance operations are restricted to regular intervals which may prevent optimal solutions. An adequate representation however is vitally important for result quality. This work presents several nonstandard input representations and compares them to the standard binary representation. An evolutionary algorithm with extensions to handle variable length genomes is used for the comparison. The results demonstrate that two new representations performs equal or better than the binary representation scheme. A second analysis shows that the performance also increases using modified genetic operators. Thus, the choice of alternative representations leads to better results in the same amount of time and without any loss of accuracy. 1 INTRODUCTION Scheduling the maintenance of technical systems is a nontrivial optimization task which is influenced by many different aspects like reliability and cost optimization. Normally, these two aspects are conflicting as short maintenance intervals cause high maintenance costs. The resulting problems are highly complex and therefore the use of black box optimization strategies has been extensively researched. The optimization of a maintenance schedule can be viewed as a three layered model (Figure 1). The system model simulates the maintenance of a technical system. It receives a maintenance schedule containing a list of maintenance events for all components. Its output are values such as the reliability over time R(t) and the maintenance costs CS. Methods for modelling and calculating reliability are reaching from Monte Carlo simulations, Petri nets and Markov models to reliability block diagrams (Billinton and Allan 1992). The topmost layer is the optimization strategy. Optimization strategies are problem solving heuristics which intelligently guess new solutions based on older experiences and some general assumptions. Its output are decision values. Most of the used optimization strategies are vector-based. The decision values are restricted to vectors with binary/integer/real elements of constant length, so called decision vectors x. For each decision value, they need to receive an objective vector y as a feedback. Many applied strategies belong to the field of evolutionary algorithms (Bris et al. 2003; Elegbede and Adjallah 2003) while other Figure 1. Maintenance optimization process as a three layered model. 1267
2 strategies such as dynamic programming (Barata et al. 2002) and tabu search (Gopalakrishnan et al. 2001) are also used. The middle layer, the input/output coding (I/O coding) is rarely investigated by researchers but simply stated. The output coding maps the system model output to an objective vector. This vector could be of one dimension (single objective optimization) or of more than one dimension (multi-objective optimization). The input coding is responsible for the transformation of the decision vector to a maintenance schedule. In this work we compare different input coding functions and line out the influence of these functions on the optimization results. Section 3 introduces the system model and output coding used. Section 4 introduces the six different input codings investigated. In section 5 the optimization strategy, an evolutionary algorithm is presented and some extensions to cope with variable dimension decision values are shown. Section 6 shows the results of some comparative tests evaluating the proposed input codings and algorithm extensions. Finally, section 7 draws conclusions of this work and proposes some further research directions. 2 NOMENCLATURE R(t): System reliability function I(t): Importance index CS: Maintenance cost C i : Component i C : Number of components a i : Age of component C i λ: Exponential parameter, failure rate α, β: Weibull parameters PF i (a i ): Failure probability of C i with age a i x: Decision vector x x: Decision vector array X : Decision space x min, x max : Borders of the decision space y Y : Objective vector y, decision space Y w 1, w 2 : Weight factors M: Maintenance matrix T: Number of simulation points of time d min, d max : Minimal and maximal dimension of the decision space X dim a : Vector array dimension dim(x): Dimension of vector x U(a, b): Random number from a uniform distribution in interval [a, b] N(m, σ): Random number from a normal distribution with mean m and standard deviation σ p cross : Crossover probability p mut : Point mutation probability p ins : Insert mutation probability p del : Deletion mutation probability BIN: BINary coding Figure 2. System 1, component MTTF is between 500 and 3000 days. Figure 3. System 2, component MTTF is between 750 and 2850 days. BINC: BINary Component coding VA: Variable length Absolute coding VAC: Variable length Absolute Component coding VR: Variable length Relative coding VAC: Variable length Relative Component coding LIC: Length Independent Crossover LDC: Length Dependent Crossover UMUT: Uniform MUTation NMUT: Normally distributed MUTation. 3 SYSTEM MODEL AND OUTPUT CODING Two simplified system models were used as test cases. They were represented as reliability block diagrams. Failure distribution of the components i were either defined as Weibull or exponential distributions. System 1 (Figure 2) represents a series system with 10 components. All components have exponential failure functions with failure rate λ i. System 2 (Figure 3) also consists of 10 components but both failure functions and system structure are much more complex. The failure functions are described by Weibull distributions with characteristic life α i and shape β i. Maintenance durations are assumed as very short and therefore not affecting the working state of the component. If a component fails, the failure remains undetected (hidden fault) and it is only replaced in a preventive maintenance action. Corrective maintenance is not considered. After the replacement, the component 1268
3 Figure 4. Importance indices I(t) over one year. is in an as-good-as-new state. All hidden failures are removed. Algorithmically this is done by setting its age back to zero. The system reliability is exactly calculated through a minimal cut algorithm. Simulation outputs are the reliability function R(t) which describes the system reliability as a function of simulation time and the maintenance costs CS of the maintenance schedule. In this simple model we assume that each maintenance event has the same costs and no other costs are accrued. The system was simulated for five years with a simulation step size of 30 days leading to T = 60 simulation steps. Each step is a possible point of time for maintenance. R(t) was multiplied with an importance index function I(t) that reflects the costs of a failure depending on the simulation time. The cost of a system failure may vary in reality due to several reasons, e.g. contractual terms, the amount of customers and spare situation. If this is the case, periodic maintenance schedules will not lead to the optimal solution, and codings allowing nonperiodic schedules are necessary. We assumed high failure costs in winter months and low costs in summer months and thus chose I(t) as seen in Figure 4. This is realistic for gas networks or power plants where load increases in colder seasons. The output coding maps these values to the twodimensional objective vector y. y 1 is the average reliability weighted with the importance factor, y 2 represents the maintenance costs: Figure 5. BIN coding. its component centered version. All codings allow nonperiodic maintenance schedules and are therefore adequate for system models with time dependent cost functions. As we use a time discrete system model, a maintenance schedule can be defined as a binary maintenance matrix M ={0, 1} C T with elements m ij where row i belongs to C i and column j belongs to time interval j = 1,..., T. Ifm ij = 1, component C i is scheduled for maintenance at point of time j (see matrix M in Figure 5). We differentiate between two general forms of decision values, the decision vector x and the decision vector array x. If we define a minimal and maximal dimension d min, d max N, then a real-valued decision vector can be stated as: If d min = d max, the decision space is of constant dimension which is the standard restriction by optimization algorithms. A decision vector array is a vector of vectors, where each element is a vector of dimension d min dim(x i ) d max. The dimension of the vector array itself is denoted as dim a and kept constant in our experiments. A real-valued vector array is defined as: 4 INPUT CODING The performance of four input codings allowing variable length encoding (VA, VAC, VR and VRC) are investigated in comparison to two input codings of constant length (BIN, BINC). The binary input coding BIN is applied in (Lapa et al. 2003), BINC is Maintenance schedules can be viewed as vector arrays with dim a = C where each vector depicts a maintenance schedule for one component. This will be referred to as component centered coding. All proposed codings are surjective so that each possible maintenance matrix may be generated. But only BIN and BINC coding are bijective. All other codings map different decision values to one schedule. What seems to be an unnecessary enlargement of the decision space 1269
4 Figure 7. VA coding. Figure 6. BINC coding. complexity can turn to an advantage if the objective function becomes smoother or easier to optimize. 4.1 BIN and BINC coding The decision vector of the BIN input coding is defined as a binary vector of length C T. It defines for each component and each point of time if the component is scheduled for maintenance. This coding is simply a linear version of the maintenance matrix M. An example is given in Figure 5. If x 3 = 1 and x 16 = 1, then C 1 would be maintained at t = 3 and C 2 at t = 6. Figure 8. VAC coding. BINC coding (Figure 6) is the very similar vector array coding. Each transposed element vector x T 1... C of x BINC defines one row of the maintenance schedule: Each element defines a maintenance event and as the number of events may vary so does the vector dimension (Figure 7). This automatically leads to the necessity of different optimization strategies that are able to handle decision vectors with variable dimension. If e.g. x VA contains the elements 3 and 37, then C 1 would be scheduled for maintenance at t = 3 and C 4 at t = 7. In VAC coding (Figure 8), each element vector defines one row of M. All values directly represent maintenance times of the appertaining component. 4.2 VA coding VA (variable dimension absolute) coding maps a natural valued vector x VA with dimension 0 n C T to a maintenance schedule: If for example x 11 = 3 and x 42 = 7, then (C 1, t = 3) and (C 4, t = 7) would be maintenance events. 1270
5 Figure 9. VR coding. 4.3 VR coding In the VR (variable dimension relative) coding similar to VA coding, one element describes one maintenance action. The difference between these two coding schemes is that in VR coding each maintenance event depends on the preceding event. This relative notation defines the schedule through time intervals between two maintenance events: Given the example in Figure 9, we denote that 5 l=1 x 1 = 37 and therefore (C 4, t = 7) is a maintenance event. The VA row shows the associated VA coding. VRC coding works similar to VAC coding (see Figure 8) but using the relative notation. 5 OPTIMIZATION STRATEGY To evaluate the performance of the different coding strategies, a simple genetic algorithm as proposed in (Dorsey and Mayer 1995) was chosen. According to Occam s Razor we do not use much more complex algorithms like SPEA2 (Zitzler et al. 2001) or NSGA2 (Deb et al. 2000) in the hope to achieve more general results with simpler algorithms. As genetic algorithms do not support variable dimension chromosomes we extended it with a different initialization method and new crossover and mutation operators inspired by techniques from the field of genetic programming (Banzhaf et al. 1998). Figure 10. VRC coding. 5.1 General overview and terminology The evolutionary algorithms terminology is strongly related to biological evolution. To prevent misunderstandings, we give a short introduction to the used terms. Evolutionary algorithms are optimization algorithms inspired by nature s strategy to create optimal life forms for a given environment. Evolution can be regarded as a blind optimization progress. Individuals that are well adapted to their environment survive and can generate offsprings which transport successful genetic material through the evolutionary process. This well-known principle is called selection. Selection is solely a phenotypic process. Offspring is normally generated through sexual reproduction of two individuals which mix their genomes through crossover. At some point of the evolutionary process random undirected mutations, changes in the genome of a single individual can occur. Mutations introduce new genetic material in the population which then can make its stand. Evolutionary algorithms transfer this scheme to optimization problems Figure 11. The algorithm maintains a population (set) of individuals (possible maintenance schedules) which are the subject of an artificial evolutionary process. An individual consists of a genotype (decision vector) and a phenotype (objective vector).we refer to the decision vector as genome and a single value as gene. If we deal with a decision vector array, the element vectors will be referred as chromosomes in analogy to the natural genome. Starting point of each optimization run is an initial population of randomly created individuals (initialization). The optimization process is divided into generation steps consisting of selection, crossover, mutation and evaluation phases. Each generation, parenting individuals from the old population are selected for crossover and mutation. The newly created individuals which form the new generation are evaluated by the objective function and the next generation step starts. If a stop condition (e.g. number of generations exceeded) 1271
6 holds then the algorithm ends, else the next generation step starts. 5.2 Initialization A random length strategy as depicted in (Banzhaf et al. 1998) was chosen to initialize the individuals of the first generation. Each chromosome first obtains a uniform random length between the minimal and the maximal dimension of the problem. Then all chromosomes are initialized with uniform random numbers. 5.3 Selection and elitism We decided to apply binary tournament selection as described in (Bäck 1996) and a stochastic elitism operator. The fitness function f sel : R 2 R maps the objective vector to one dimension by a weighted sum instead of using a Pareto approach as the latter leads to strong difficulties in performance assessment of different input codings and algorithms (Okabe et al. 2003). For a better illustration, f sel can be interpreted as the profit. w 1 then constitutes the yield of a working system while w 2 represents the costs of a maintenance event. Each generation, the best individual found is inserted with a probability of Crossover With a probability of p cross, two individuals are choosen for crossover. Variable dimension crossover is different to standard crossover insofar as the chromosomes x, x of the two chromosomes crossed can be of different length. We therefore have to select one crossover point p/p N per chromosome. Then the crossover takes place Figure 12. Two crossover operators were investigated, length independent crossover (LIC) and length dependent crossover (LDC). The LIC operator is a straightforward extension of the onepoint crossover operator used in most standard genetic algorithms (Goldberg 1989). Both crossover points are drawn from a uniform distribution: The LIC operator doesn t take the length of the chromosomes into account. Huge length differences between the offspring and parent chromosomes can result. This may not necessarily be an advantage because the search cannot focus on length regions with good solutions (see section 6). The LDC operator tackles this problem. One crossover point is uniform randomly chosen. The second point heavily depends on the first: A random integer from a normal distribution with mean m = 0 and standard deviation σ = dim(x )/4 is Figure 11. Overview of a genetic algorithm. Figure 12. length. Crossover between individuals with different 1272
7 drawn and added to the crossover point. This guarantees a length variation which is necessary to reach new length regions. N(0, dim(x )/4) is limited so that 0 < p < dim(x ) holds. 5.5 Mutation Three different types of mutation are implemented: Point mutation, insert mutation and deletion mutation. Each value of an individual will be chosen with a probability p mut for point mutation. Binary mutation described in (Goldberg 1989) is used by the binary codings. Integer mutation is done either choosing a new random value at the mutation position (UMUT) or adding a normally distributed value (NMUT) as described in (Bäck 1996). The strategy parameter was fixed at σ = (x max x min )/4 to reduce experimental complexity. Insert and deletion mutation operators are introduced to generate variations in the individual length. At each crossover point a new random value is inserted with probability p ins. This results in a length increase of the individual. The deletion mutation works vice versa. With a probability p del, a position will be deleted and the individual shortened. Table 1. Best parameter combinations. System 1 System 2 Coding Crossover Mutation Crossover Mutation BIN BINC VA VAC VR VRC RESULTS We compared the different codings and operators simulating the systems over T = 60 simulation steps. Each step, all components could be maintained resulting in a choice of 600 maintenance points for both systems and thus in a large combinatoric decision space with possible schedules. The objective weights were set to w 1 = 600 and w 2 = 1. The experimental setup is divided into three stages: 1. Derive good standard parameter values for all test sets. 2. Compare all test sets using the derived parameter values. 3. Analyze additional operators. The test sets compared are the six coding alternatives BIN, BINC, VA, VAC, VR and VRC. For parameter fitting, a full factorial design plan was created. The initial values chosen were p mut = {0.01, 0.1, 0.2} and p cross = {0.7, 0.9}. As we expect more general results by the use of a simple genetic algorithm, we kept it as simple as possible in step 1 and 2. LIC and UMUT were used, insert and deletion mutation switched off. They will be investigated in step three. Each combination was repeated 10 times. The derived parameters are shown in Table 1. In step two we started a comparative test on all six codings. The population size was 20. Figures 13 and 15 show the best individual found (average over 10 runs) in relation to the current generation. Figures 14 and 16 are snapshots of the best solution found at generation 500 (Boxplot). Clearly the worst input coding on both systems is VR. It seems to converge very early to some local minima and shows a very slow optimization progress. VA scores better in both systems but is also worse than BIN coding. BINC coding shows slight advantages Figure 13. System 1. Best individual (average over 100 runs), Figure 14. System 1. Best individual after 500 generations, boxplot, 1273
8 Figure 15. System 2. Best individual (average over 100 runs), Figure 17. Best individual after 500 generations, additional Operators, VAC coding. Figure 16. System 2. Best individual after 500 generations, boxplot, Figure 18. Best individual after 500 generations, additional Operators, VRC coding. over BIN. The best input codings seem to be VAC and VRC. VAC clearly outperforms BIN and BINC in system 2 while in system 1 it is worse. VRC produces by far the best results in system 1 and is only beaten by VAC in system 2. The investigation of the additional operators was carried out using system 2 and the most successful codings VAC and VRC. Referring to the algorithm of step two (Normal), four test sets were evaluated: LDC: Length dependent crossover instead of LIC. NMUT: NMUT instead of UMUT. INS: Insert mutation turned on with p ins = DEL: Deletion mutation turned on with p del = The results, represented as boxplots in Figures 17 and 18 show that the operators perform different depending on the coding used. VRC coding results could be slightly but insignificantly improved by deletion mutation, the other operators perform worse. VAC coding leads to clearly better results using length dependent crossover and may also be improved if NMUT is applied. The INS mutation performed worse results, DEL was equal. 7 CONCLUSIONS AND OUTLOOK The results show that the input coding is highly important for effective maintenance optimization. Of the proposed five alternative coding strategies, two performed equal or better than the standard encoding (Lapa et al. 2003) in the test cases. Some of the additionally introduced operators for genetic algorithms also achieve good results. Together, they form a powerful alternative to standard evolutionary maintenance optimization. This work is only a first investigation on variable dimension maintenance scheduling. Further research 1274
9 going beyond this work could include the development and adaption of new genetic operators such as Explicitly Defined Introns (Banzhaf et al. 1998) to handle maintenance schedules and the evaluation of the proposed methods in a Pareto multi-objective approach. The extension to other system models could also be of interest. ACKNOWLEDGEMENTS The authors would like to thank Dr. Jörg Petersen for his support and inspirational comments andtim Hohm for the great collaboration where some ideas of this work emerged. REFERENCES Bäck,T. (1996). EvolutionaryAlgorithms intheory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. New York: Oxford Univ. Press. Banzhaf, W., P. Nordin, R.E. Keller, and F. Francone (1998). Genetic Programming :An Introduction: On theautomatic Evolution of Computer Programs and Its Applications. San Francisco: Academic Press/Morgan Kaufmann. Barata, J., C.G. Soares, M. Marseguerra, and E. Zio (2002). Simulation modelling of repairable multicomponent deteriorating systems for on condition maintenance optimisation. Reliability Engineering & System Safety 76(3), Billinton, R. and R.N. Allan (1992). Reliability evaluation of engineering systems: concepts and techniques. NewYork: Plenum. Bris, R., E. Châtelet, and F. Yalaoui (2003). New method to minimize the preventive maintenance cost of seriesparallel systems. Reliability Engineering and System Safety 82(3), Deb, K., S. Agrawal, A. Pratab, and T. Meyarivan (2000). A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. In Proceedings of the Parallel Problem Solving from Nature VI Conference, Paris, France, pp Dorsey, R. E. and W. J. Mayer (1995). Genetic algorithms for estimation problems with multiple optima, nondifferentiability, and other irregular features. Journal of Business and Economic Statistics 13(1), Elegbede, C. and K. Adjallah (2003). Availability allocation to repairable systems with genetic algorithms: a multiobjective formulation. Reliability Engineering and System Safety 82(3), Goldberg, D. (1989). GeneticAlgorithms in search, optimization, and machine learning. Turin Ney York: Addison- Wesley. Gopalakrishnan, M., S. Mohan, and Z. He (2001). A tabu search heuristic for preventive maintenance scheduling. Computers and Industrial Engineering 40(1 2), Lapa, C. M., C.M. Pereira, and P.F. Frutuoso e Melo (2003). Surveillance test policy optimization through genetic algorithms using non-periodic intervention frequencies and considering seasonal constraints. Reliability Engineering and System Safety 81, Okabe, T., Y. Jin, and B. Sendhoff (2003). A critical survey of performance indices for multi-objective optimization. In IEEE Congress on Evolutionary Computation, Volume 2, Canberra, Australia, pp Zitzler, E., M. Laumanns, and L. Thiele (2001). SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In EUROGEN 2001, Athens, Greece, pp
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
More informationIntroduction 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
More informationAn 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
More informationAn 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
More informationISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013
Transistor Level Fault Finding in VLSI Circuits using Genetic Algorithm Lalit A. Patel, Sarman K. Hadia CSPIT, CHARUSAT, Changa., CSPIT, CHARUSAT, Changa Abstract This paper presents, genetic based algorithm
More informationGenetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve
Genetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve Outline Selection methods Replacement methods Variation operators Selection Methods
More informationA Brief Study of the Nurse Scheduling Problem (NSP)
A Brief Study of the Nurse Scheduling Problem (NSP) Lizzy Augustine, Morgan Faer, Andreas Kavountzis, Reema Patel Submitted Tuesday December 15, 2009 0. Introduction and Background Our interest in the
More informationGenetic 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
More informationA 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),
More informationHYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE
HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE Subodha Kumar University of Washington subodha@u.washington.edu Varghese S. Jacob University of Texas at Dallas vjacob@utdallas.edu
More informationGA as a Data Optimization Tool for Predictive Analytics
GA as a Data Optimization Tool for Predictive Analytics Chandra.J 1, Dr.Nachamai.M 2,Dr.Anitha.S.Pillai 3 1Assistant Professor, Department of computer Science, Christ University, Bangalore,India, chandra.j@christunivesity.in
More informationAlpha 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
More informationModel-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
More informationMultiobjective 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
More informationCHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING
60 CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING 3.1 INTRODUCTION Optimal short-term hydrothermal scheduling of power systems aims at determining optimal hydro and thermal generations
More informationMemory Allocation Technique for Segregated Free List Based on Genetic Algorithm
Journal of Al-Nahrain University Vol.15 (2), June, 2012, pp.161-168 Science Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Manal F. Younis Computer Department, College
More informationPackage 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
More information14.10.2014. Overview. Swarms in nature. Fish, birds, ants, termites, Introduction to swarm intelligence principles Particle Swarm Optimization (PSO)
Overview Kyrre Glette kyrrehg@ifi INF3490 Swarm Intelligence Particle Swarm Optimization Introduction to swarm intelligence principles Particle Swarm Optimization (PSO) 3 Swarms in nature Fish, birds,
More informationA 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
More informationA 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,
More informationA 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,
More informationA Study of Crossover Operators for Genetic Algorithm and Proposal of a New Crossover Operator to Solve Open Shop Scheduling Problem
American Journal of Industrial and Business Management, 2016, 6, 774-789 Published Online June 2016 in SciRes. http://www.scirp.org/journal/ajibm http://dx.doi.org/10.4236/ajibm.2016.66071 A Study of Crossover
More informationA Robust Method for Solving Transcendental Equations
www.ijcsi.org 413 A Robust Method for Solving Transcendental Equations Md. Golam Moazzam, Amita Chakraborty and Md. Al-Amin Bhuiyan Department of Computer Science and Engineering, Jahangirnagar University,
More informationMulti-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,
More informationLearning in Abstract Memory Schemes for Dynamic Optimization
Fourth International Conference on Natural Computation Learning in Abstract Memory Schemes for Dynamic Optimization Hendrik Richter HTWK Leipzig, Fachbereich Elektrotechnik und Informationstechnik, Institut
More informationSpatial Interaction Model Optimisation on. Parallel Computers
To appear in "Concurrency: Practice and Experience", 1994. Spatial Interaction Model Optimisation on Parallel Computers Felicity George, Nicholas Radcliffe, Mark Smith Edinburgh Parallel Computing Centre,
More informationGrammatical Differential Evolution
Michael O Neill Natural Computing Research and Applications Group, University College Dublin Ireland Email: M.ONeill@ucd.ie Anthony Brabazon Natural Computing Research and Applications Group, University
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 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
More informationECONOMIC GENERATION AND SCHEDULING OF POWER BY GENETIC ALGORITHM
ECONOMIC GENERATION AND SCHEDULING OF POWER BY GENETIC ALGORITHM RAHUL GARG, 2 A.K.SHARMA READER, DEPARTMENT OF ELECTRICAL ENGINEERING, SBCET, JAIPUR (RAJ.) 2 ASSOCIATE PROF, DEPARTMENT OF ELECTRICAL ENGINEERING,
More informationSolving 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
More information4. 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
More informationA Fast Computational Genetic Algorithm for Economic Load Dispatch
A Fast Computational Genetic Algorithm for Economic Load Dispatch M.Sailaja Kumari 1, M.Sydulu 2 Email: 1 Sailaja_matam@Yahoo.com 1, 2 Department of Electrical Engineering National Institute of Technology,
More informationA Comparison of Genotype Representations to Acquire Stock Trading Strategy Using Genetic Algorithms
2009 International Conference on Adaptive and Intelligent Systems A Comparison of Genotype Representations to Acquire Stock Trading Strategy Using Genetic Algorithms Kazuhiro Matsui Dept. of Computer Science
More informationLeran Wang and Tom Kazmierski {lw04r,tjk}@ecs.soton.ac.uk
BMAS 2005 VHDL-AMS based genetic optimization of a fuzzy logic controller for automotive active suspension systems Leran Wang and Tom Kazmierski {lw04r,tjk}@ecs.soton.ac.uk Outline Introduction and system
More informationGenetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm
24 Genetic Algorithm Based on Darwinian Paradigm Reproduction Competition Survive Selection Intrinsically a robust search and optimization mechanism Slide -47 - Conceptual Algorithm Slide -48 - 25 Genetic
More informationInternational Journal of Software and Web Sciences (IJSWS) www.iasir.net
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
More informationElectric 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,
More informationModified Version of Roulette Selection for Evolution Algorithms - the Fan Selection
Modified Version of Roulette Selection for Evolution Algorithms - the Fan Selection Adam S lowik, Micha l Bia lko Department of Electronic, Technical University of Koszalin, ul. Śniadeckich 2, 75-453 Koszalin,
More informationManagement of Software Projects with GAs
MIC05: The Sixth Metaheuristics International Conference 1152-1 Management of Software Projects with GAs Enrique Alba J. Francisco Chicano Departamento de Lenguajes y Ciencias de la Computación, Universidad
More informationMULTI-OBJECTIVE OPTIMIZATION USING PARALLEL COMPUTATIONS
MULTI-OBJECTIVE OPTIMIZATION USING PARALLEL COMPUTATIONS Ausra Mackute-Varoneckiene, Antanas Zilinskas Institute of Mathematics and Informatics, Akademijos str. 4, LT-08663 Vilnius, Lithuania, ausra.mackute@gmail.com,
More informationMultiobjective 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
More informationLab 4: 26 th March 2012. Exercise 1: Evolutionary algorithms
Lab 4: 26 th March 2012 Exercise 1: Evolutionary algorithms 1. Found a problem where EAs would certainly perform very poorly compared to alternative approaches. Explain why. Suppose that we want to find
More informationSoftware Project Management with GAs
Software Project Management with GAs Enrique Alba, J. Francisco Chicano University of Málaga, Grupo GISUM, Departamento de Lenguajes y Ciencias de la Computación, E.T.S Ingeniería Informática, Campus de
More informationA Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN)
ISSN: 2278 1323 All Rights Reserved 2014 IJARCET 3910 A Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN) Miss: KIRTI JOSHI Abstract A Genetic Algorithm (GA) is an intelligent search
More informationNEUROEVOLUTION OF AUTO-TEACHING ARCHITECTURES
NEUROEVOLUTION OF AUTO-TEACHING ARCHITECTURES EDWARD ROBINSON & JOHN A. BULLINARIA School of Computer Science, University of Birmingham Edgbaston, Birmingham, B15 2TT, UK e.robinson@cs.bham.ac.uk This
More informationNew Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem
New Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem Radovic, Marija; and Milutinovic, Veljko Abstract One of the algorithms used for solving Traveling Salesman
More informationMulti-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
More informationComparison of Major Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments
Comparison of Maor Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments A. Sima UYAR and A. Emre HARMANCI Istanbul Technical University Computer Engineering Department Maslak
More informationA 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,
More informationResearch on a Heuristic GA-Based Decision Support System for Rice in Heilongjiang Province
Research on a Heuristic GA-Based Decision Support System for Rice in Heilongjiang Province Ran Cao 1,1, Yushu Yang 1, Wei Guo 1, 1 Engineering college of Northeast Agricultural University, Haerbin, China
More informationPredictive Knowledge Discovery by Multiobjective Genetic Fuzzy Systems for Estimating Consumer Behavior Models
Predictive Knowledge Discovery by Multiobjective Genetic Fuzzy Systems for Estimating Consumer Behavior Models Jorge Casillas, Oscar Delgado Dept. Computer Science and Artif. Intell. Univ. Granada, 18071
More informationA Service Revenue-oriented Task Scheduling Model of Cloud Computing
Journal of Information & Computational Science 10:10 (2013) 3153 3161 July 1, 2013 Available at http://www.joics.com A Service Revenue-oriented Task Scheduling Model of Cloud Computing Jianguang Deng a,b,,
More informationInteger Programming: Algorithms - 3
Week 9 Integer Programming: Algorithms - 3 OPR 992 Applied Mathematical Programming OPR 992 - Applied Mathematical Programming - p. 1/12 Dantzig-Wolfe Reformulation Example Strength of the Linear Programming
More informationAPPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION
APPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION Harald Günther 1, Stephan Frei 1, Thomas Wenzel, Wolfgang Mickisch 1 Technische Universität Dortmund,
More informationHolland s GA Schema Theorem
Holland s GA Schema Theorem v Objective provide a formal model for the effectiveness of the GA search process. v In the following we will first approach the problem through the framework formalized by
More informationOriginal Article Efficient Genetic Algorithm on Linear Programming Problem for Fittest Chromosomes
International Archive of Applied Sciences and Technology Volume 3 [2] June 2012: 47-57 ISSN: 0976-4828 Society of Education, India Website: www.soeagra.com/iaast/iaast.htm Original Article Efficient Genetic
More informationA Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical
More informationA HYBRID GENETIC ALGORITHM FOR THE MAXIMUM LIKELIHOOD ESTIMATION OF MODELS WITH MULTIPLE EQUILIBRIA: A FIRST REPORT
New Mathematics and Natural Computation Vol. 1, No. 2 (2005) 295 303 c World Scientific Publishing Company A HYBRID GENETIC ALGORITHM FOR THE MAXIMUM LIKELIHOOD ESTIMATION OF MODELS WITH MULTIPLE EQUILIBRIA:
More informationScheduling Jobs and Preventive Maintenance Activities on Parallel Machines
Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines Maher Rebai University of Technology of Troyes Department of Industrial Systems 12 rue Marie Curie, 10000 Troyes France maher.rebai@utt.fr
More informationGenetic Algorithm Performance with Different Selection Strategies in Solving TSP
Proceedings of the World Congress on Engineering Vol II WCE, July 6-8,, London, U.K. Genetic Algorithm Performance with Different Selection Strategies in Solving TSP Noraini Mohd Razali, John Geraghty
More informationSelecting Best Investment Opportunities from Stock Portfolios Optimized by a Multiobjective Evolutionary Algorithm
Selecting Best Investment Opportunities from Stock Portfolios Optimized by a Multiobjective Evolutionary Algorithm Krzysztof Michalak Department of Information Technologies, Institute of Business Informatics,
More informationUsing Ant Colony Optimization for Infrastructure Maintenance Scheduling
Using Ant Colony Optimization for Infrastructure Maintenance Scheduling K. Lukas, A. Borrmann & E. Rank Chair for Computation in Engineering, Technische Universität München ABSTRACT: For the optimal planning
More informationVolume 3, Issue 2, February 2015 International Journal of Advance Research in Computer Science and Management Studies
Volume 3, Issue 2, February 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
More informationThe Influence of Binary Representations of Integers on the Performance of Selectorecombinative Genetic Algorithms
The Influence of Binary Representations of Integers on the Performance of Selectorecombinative Genetic Algorithms Franz Rothlauf Working Paper 1/2002 February 2002 Working Papers in Information Systems
More informationA Novel Binary Particle Swarm Optimization
Proceedings of the 5th Mediterranean Conference on T33- A Novel Binary Particle Swarm Optimization Motaba Ahmadieh Khanesar, Member, IEEE, Mohammad Teshnehlab and Mahdi Aliyari Shoorehdeli K. N. Toosi
More informationA Sarsa based Autonomous Stock Trading Agent
A Sarsa based Autonomous Stock Trading Agent Achal Augustine The University of Texas at Austin Department of Computer Science Austin, TX 78712 USA achal@cs.utexas.edu Abstract This paper describes an autonomous
More informationProgramming Risk Assessment Models for Online Security Evaluation Systems
Programming Risk Assessment Models for Online Security Evaluation Systems Ajith Abraham 1, Crina Grosan 12, Vaclav Snasel 13 1 Machine Intelligence Research Labs, MIR Labs, http://www.mirlabs.org 2 Babes-Bolyai
More informationEstimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects
Journal of Computer Science 2 (2): 118-123, 2006 ISSN 1549-3636 2006 Science Publications Estimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software Projects Alaa F. Sheta Computers
More informationA 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,
More informationSimulating the Multiple Time-Period Arrival in Yield Management
Simulating the Multiple Time-Period Arrival in Yield Management P.K.Suri #1, Rakesh Kumar #2, Pardeep Kumar Mittal #3 #1 Dean(R&D), Chairman & Professor(CSE/IT/MCA), H.C.T.M., Kaithal(Haryana), India #2
More information6.2.8 Neural networks for data mining
6.2.8 Neural networks for data mining Walter Kosters 1 In many application areas neural networks are known to be valuable tools. This also holds for data mining. In this chapter we discuss the use of neural
More informationDATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
More informationD A T A M I N I N G C L A S S I F I C A T I O N
D A T A M I N I N G C L A S S I F I C A T I O N FABRICIO VOZNIKA LEO NARDO VIA NA INTRODUCTION Nowadays there is huge amount of data being collected and stored in databases everywhere across the globe.
More informationMoral Hazard. Itay Goldstein. Wharton School, University of Pennsylvania
Moral Hazard Itay Goldstein Wharton School, University of Pennsylvania 1 Principal-Agent Problem Basic problem in corporate finance: separation of ownership and control: o The owners of the firm are typically
More informationSIMULATING CANCELLATIONS AND OVERBOOKING IN YIELD MANAGEMENT
CHAPTER 8 SIMULATING CANCELLATIONS AND OVERBOOKING IN YIELD MANAGEMENT In YM, one of the major problems in maximizing revenue is the number of cancellations. In industries implementing YM this is very
More informationNew binary representation in Genetic Algorithms for solving TSP by mapping permutations to a list of ordered numbers
Proceedings of the 5th WSEAS Int Conf on COMPUTATIONAL INTELLIGENCE, MAN-MACHINE SYSTEMS AND CYBERNETICS, Venice, Italy, November 0-, 006 363 New binary representation in Genetic Algorithms for solving
More informationEffect of Using Neural Networks in GA-Based School Timetabling
Effect of Using Neural Networks in GA-Based School Timetabling JANIS ZUTERS Department of Computer Science University of Latvia Raina bulv. 19, Riga, LV-1050 LATVIA janis.zuters@lu.lv Abstract: - The school
More informationSupply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level
Supply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level Faicel Hnaien, Xavier Delorme 2, and Alexandre Dolgui 2 LIMOS,
More information6 Creating the Animation
6 Creating the Animation Now that the animation can be represented, stored, and played back, all that is left to do is understand how it is created. This is where we will use genetic algorithms, and this
More informationPLAANN as a Classification Tool for Customer Intelligence in Banking
PLAANN as a Classification Tool for Customer Intelligence in Banking EUNITE World Competition in domain of Intelligent Technologies The Research Report Ireneusz Czarnowski and Piotr Jedrzejowicz Department
More informationIndex 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
More informationEvolutionary Detection of Rules for Text Categorization. Application to Spam Filtering
Advances in Intelligent Systems and Technologies Proceedings ECIT2004 - Third European Conference on Intelligent Systems and Technologies Iasi, Romania, July 21-23, 2004 Evolutionary Detection of Rules
More informationHYBRID 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
More informationEVOLUTIONARY ALGORITHMS FOR JOB-SHOP SCHEDULING
Int. J. Appl. Math. Comput. Sci., 24, Vol. 14, No. 1, 91 13 EVOLUTIONARY ALGORITHMS FOR JOB-SHOP SCHEDULING KHALED MESGHOUNI, SLIM HAMMADI PIERRE BORNE Ecole Centrale de Lille, LAIL - UMR 821 BP 48 961
More informationMeasurement and Modelling of Internet Traffic at Access Networks
Measurement and Modelling of Internet Traffic at Access Networks Johannes Färber, Stefan Bodamer, Joachim Charzinski 2 University of Stuttgart, Institute of Communication Networks and Computer Engineering,
More informationWeb Service Selection using Particle Swarm Optimization and Genetic Algorithms
Web Service Selection using Particle Swarm Optimization and Genetic Algorithms Simone A. Ludwig Department of Computer Science North Dakota State University Fargo, ND, USA simone.ludwig@ndsu.edu Thomas
More informationA Framework for Genetic Algorithms in Games
A Framework for Genetic Algorithms in Games Vinícius Godoy de Mendonça Cesar Tadeu Pozzer Roberto Tadeu Raiitz 1 Universidade Positivo, Departamento de Informática 2 Universidade Federal de Santa Maria,
More informationA Forecasting Decision Support System
A Forecasting Decision Support System Hanaa E.Sayed a, *, Hossam A.Gabbar b, Soheir A. Fouad c, Khalil M. Ahmed c, Shigeji Miyazaki a a Department of Systems Engineering, Division of Industrial Innovation
More informationOptimization of Preventive Maintenance Scheduling in Processing Plants
18 th European Symposium on Computer Aided Process Engineering ESCAPE 18 Bertrand Braunschweig and Xavier Joulia (Editors) 2008 Elsevier B.V./Ltd. All rights reserved. Optimization of Preventive Maintenance
More informationNeural Networks and Learning Systems
Neural Networks and Learning Systems Exercise Collection, Class 9 March 2010 x 1 x 2 x N w 11 3 W 11 h 3 2 3 h N w NN h 1 W NN y Neural Networks and Learning Systems Exercise Collection c Medical Informatics,
More informationEmpirically Identifying the Best Genetic Algorithm for Covering Array Generation
Empirically Identifying the Best Genetic Algorithm for Covering Array Generation Liang Yalan 1, Changhai Nie 1, Jonathan M. Kauffman 2, Gregory M. Kapfhammer 2, Hareton Leung 3 1 Department of Computer
More informationl 8 r 3 l 9 r 1 l 3 l 7 l 1 l 6 l 5 l 10 l 2 l 4 r 2
Heuristic Algorithms for the Terminal Assignment Problem Sami Khuri Teresa Chiu Department of Mathematics and Computer Science San Jose State University One Washington Square San Jose, CA 95192-0103 khuri@jupiter.sjsu.edu
More informationProceedings 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
More informationThe Binary Genetic Algorithm
CHAPTER 2 The Binary Genetic Algorithm 2.1 GENETIC ALGORITHMS: NATURAL SELECTION ON A COMPUTER If the previous chapter whet your appetite for something better than the traditional optimization methods,
More informationEvolutionary denoising based on an estimation of Hölder exponents with oscillations.
Evolutionary denoising based on an estimation of Hölder exponents with oscillations. Pierrick Legrand,, Evelyne Lutton and Gustavo Olague CICESE, Research Center, Applied Physics Division Centro de Investigación
More informationLecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method
Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming
More informationSOFTWARE TESTING STRATEGY APPROACH ON SOURCE CODE APPLYING CONDITIONAL COVERAGE METHOD
SOFTWARE TESTING STRATEGY APPROACH ON SOURCE CODE APPLYING CONDITIONAL COVERAGE METHOD Jaya Srivastaval 1 and Twinkle Dwivedi 2 1 Department of Computer Science & Engineering, Shri Ramswaroop Memorial
More informationA Binary Model on the Basis of Imperialist Competitive Algorithm in Order to Solve the Problem of Knapsack 1-0
212 International Conference on System Engineering and Modeling (ICSEM 212) IPCSIT vol. 34 (212) (212) IACSIT Press, Singapore A Binary Model on the Basis of Imperialist Competitive Algorithm in Order
More informationArchitectural Design for Space Layout by Genetic Algorithms
Architectural Design for Space Layout by Genetic Algorithms Özer Ciftcioglu, Sanja Durmisevic and I. Sevil Sariyildiz Delft University of Technology, Faculty of Architecture Building Technology, 2628 CR
More information