Meta-Heuristic Approach for Supporting Design-for- Disassembly towards Efficient Material Utilization
|
|
- Polly Moody
- 5 years ago
- Views:
Transcription
1 Meta-Heuristic Approach for Supporting Design-for- Disassembly towards Efficient Material Utilization Yoshiaki Shimizu *, Kyohei Tsuji and Masayuki Nomura Production Systems Engineering Toyohashi University of Technology, Aichi Japan Abstract Efficient material utilization is a rational way to facilitate sustainable technology, because it can promote conservation of resource and energy while decreasing the environmental loads at the same time. Especially, recycling and remanufacturing are its important forms that involve product disassembly to retrieve the desired parts and/or subassemblies. With this point of view, in this paper, we have developed a prototype system supporting a strategic decision making on disassembly for recycling at design stage of product life cycle. Based on the information given at the design stage, it decides automatically the optimal disassembly sequence through a meta-heuristic method known as Genetic Programming (GP). Its implementation is taken place by using Java programming language, and an illustrative example is provided to show some features. Keywords: design for disassembly, genetic programming, material re-utilization, sustainable technology, recycle 1. Introduction Due to our conventional economic activities and life style such as mass-production, mass-consumption, and mass-throw-away, we have been confronting to various environmental problems today. Accordingly, many efforts have been begun with demonstrating a new idea for reflecting the environmental consciousness to manufacturing activities. Among them, LCA (Life Cycle Assessment) standardized in IS series is being applied in various industries recently. Some efforts have been also paid to provide an information infrastructure for deploying a decision-aid in quick and understandable manners (Shimizu et al., 2001, 2002). However, its resolution is becoming very complicated and complex under the global competition of economy and the egoism referring to what is known as the south-north problem. Under such circumstances, efficient material utilization through product disassembly to retrieve the desired parts and/or subassemblies becomes a rational way to be taken since it can promote the conservation of resource and energy while decreasing the environmental loads at the same time. However, because multiple parts made of different materials are to assemble products, disassembly load evaluated by time and/or cost becomes a key factor that may obstruct the recovery of the materials. * Author to whom correspondence should be adressed : shimizu@tutpse.tut.ac.jp
2 With this point of view, this paper focuses on product recycling and remanufacturing, and addresses an approach associated with the design-for-disassembly (DfD; Navinchandra, 1991), a reverse engineering considering easiness of disassembly for recycling at the design stage of product life cycle. After general statement about whole idea, we will describe a resolution procedure in detail, and finally show some features of a developed prototype system through an illustrative example. 2. Problem Statement Since the DfD task will not only increase product value at the end of life cycle but also bring about the consciousness about life cycle cost, there is a keen need to develop a user friendly evaluation tool for it. Navinchandra (1991) developed a system that assists designers in identifying recycling-friendly design. A graph search method in terms of ANA/OR graph is used to identify the optimal recycling strategy (Zussman, Kriwet, and Seliger, 1994). For the modelling of disassembly planning, a generic Petri net model is applied and analysed based on the reachability graph regarding all possible disassembly processes by Xirouchakis and Kiritsis (1997). A geometrical analysis is taken place to find out a possible disassembly sequence for the objects whose parts are made of unit cubes through an idea called face coupling (Beasley and Martin, 1993). Similarly, generating a hierarchical disassembly tree from geometrical information, branch and bound algorithm is applied to reduce a tree size, and to derive a disassembly sequence plan (Askiner and Gapta, 2001). Moreover, a multi-objective optimisation model for a disassembly to order is proposed and solved using integer goal programming by Kongar and Gupta (2002). Under mild conditions, we will present below a practical solution method to cope with this kind of problem that seems to stay still at the state of concept. GUI Input Information on product part/subassembly disassembling facility Disassembling time D B Evaluation Systtem for DfD GUI Output Disassemble sequence Score for DfD Disassembling time Disassembling cost (Environmentally benign score) Environment factor DB Disassembling cost DB On going 2.1 General idea of Fig.1 Scheme of the proposed system. system development The aim of the study is to develop a prototype system supporting strategic decision making for efficient material utilization. Through simulating the disassembly sequence based on the information given at the design stage, it decides automatically a disassembly sequence that is optimal under the prescribed objective function. Moreover, by examining the result in detail, we can reveal some issues necessary for improving the disassembly activities and reflect them to a new product design. In Fig.1, we show a scheme of such system that will realize our general idea. By giving some product specific data, in the aid of the equipped DBs, the evaluation system outputs both the optimum disassembly sequence and a few quantitative indices helpful for the reverse engineering.
3 2.2 Genetic programming as a solution method Although evaluation procedure, as the core of the above system, can refer mathematically to an optimization problem regarding disassembly sequence, its solution will become extremely difficult according to the expansion of problem size due to its combinatorial nature. Hence we apply an approximate method that is possible to obtain a near optimal solution within a reasonable computation efforts. In addition, because the disassembly sequence can be represented conveniently as a list of function (disassembly method) and terimal (part/subassembly), the algorithm possible to manage easily such structural expression (tree structure) is relevant. From all of these, we adopt a meta-heuristic method known as Genetic Programming (GP) presently. GP [Koza 1992] is a branch of genetic algorithm (GA), and works better for the particular type of problems trying to find the most efficient solution from a large list of variables. GP creates a computation scheme as the solution, i.e., compositions of the functions and terminals of the present disassembly sequence problem while GA creates a string of numbers that represent decision variables. A usual algorithm of GP is composed of the following four steps quite similar to GA: 1) Generate an initial population with random compositions of the functions and terminals. 2) Evaluate each scheme in the population and assign it a fitness value. 3) Create a new population of schemes. i) Reproduce the superior schemes. ii) Create new schemes by crossover. iii) Create new schemes by mutation. 4) The best scheme obtained after the prescribed generation is chosen as the result of GP. Preliminary statements Noticing the tree structure is composed of branches and leafs, we can represent the disassembly sequence conveniently by viewing the branch as disassembling action and the leaf as disassembled part. In addition, associated with the solution method like GP, we make each of them correspond to the function and terminal respectively. Presently, we classify * parts (terminals) into six categories, i.e., uniform material, unit part, reusable unit, part necessary for treatment before disposal, part hard to destroy, and disposable part while disassembly actions (functions) into five operations, i.e. no action, snap off, screw off, turn off, and cut off. Figure 2 shows an example of such representation. p6 d3 d4 p3 p2 p4 p5 d2 d1 d5 d i F Function (i=1,,5) p i F Terminal (i=1,,6) Fig.2 Tree representation of disassembly sequence. Components of GP and solution algorithm Based on the foregoing discussion, we code the chromosome for the tree in Fig.2 d1 d2 d3 d4 p6 p5 p3 d5 p2 p4 Fig.3 Chromosome denoting tree in Fig.2. * Since these are instances of each class, we can add easily anyone depending on the problem for further consideration.
4 as shown in Fig.3 where each gene is given according to the depth first rule by looking at the tree from the left hand side. Decoding is realized just by the reverse procedure of the coding. We apply a roulette strategy with the elitism as the reproduction rule. Regarding the crossover and mutation, they are to be taken place on the basis of subtree structure. Hence, it needs to satisfy such condition that both number and elements involved in the subtrees must be identical with each other before and after these genetic operations. Under this condition, the crossover is done as follows (See also Fig.4). 1. By taking one of the parents, cut down the sub-tree randomly. 2. Count the number of terminals involved in the chosen sub-tree. 3. Decide the sub-tree with the same number of terminals as the above for the other parents. 4. Exchange the sub-trees between thus decided ones. 5. If there happens the case where some terminals duplicate with each other, go to step 6. Otherwise stop. 6. Replace the duplicated terminal with the missing one. Apply this in order of the sequence of genotype in the case of multiple duplications. On the other hand, we adopt two kinds of mutation to bring about new changes that are stiff only by the crossover operation. One of them can generate a new p2 P2 p3 p6 p3 p4 p5 p6 structure even with different number of terminals between before and after, and the other with drastic change regarding the terminals. Moreover, based on the weighted sum of dimensionless disassembly cost and time, we define the score F by Eq.(1) where superscript and subscript of the asterisis denote an ideal and nadir values respectively. To turn it into a fitness, we degrade it like Eq.(2) by introducing a penalty against physical infeasiblility arising from the priority on the disassembly sequences. Though the priority is assumed to be given a priori, we are planning to derive it from the geometric information of the product. There v represents a binary value that takes 1 if there involves a disassembly sequence violating the given priority and 0 otherwise. Moreover, coefficient a denote a constant, and L level in the tree (L root = 0) where such violation is appeared. Hence the fitness F can stand for the situation where the more and at the shallower level the violations occur, the more seriously the infeasibility will encounter. p4 Parents p5 p5 [p2: duplicated, p5: missing] Replace p2 with p5 [p2: missing, p5: duplicated] Replace p5 with p2 Fig.4 Employed crossover operation. P2 p6 p3 p4 p5 p6 Offsprings p3 p4 p2
5 * * Time Time Cost Cost = w1 + w 100 Time * Time Cost * Cost * * F 2 (1) av (1 ) L F' = F (2) 2.3 Implementation of prototype system By using Java programming language, we design a few GUIs to input data of the product to be assessed, and one to output the results, e.g., visual display of the disassembly sequence and the evaluated score. Through such GUI, we can input name, number, material, and category of each subassembly, and prescribe the relation among the subassemblies regarding the method of connection and priority relation on the disassembly sequence. After setting such information properly and pushing ok bottum from the main menu, output display shown in the later will appear as a result of the optimization through GP. 3. Illustrative Example We examined the effectiveness of the proposed system through numerical experiments taking a few example products. In what follows, we show a case study taking a personal computer for example. Setting parameters of GP as shown in Fig.5, and giving some additional data, we carried out the numerical experiment and confirmed the effectiveness of the proposed approach. We Fitness Generation population size:100 total generation:1000 crossover rate:0.75 mutation rate:0.25 show a feature of convergence Fig.5 Convergence feature in GP. along with generation in Fig.5, and the output GUI in Fig. 6 The metric in the value column is helpful for evaluating the desireability from the DfD viewpoint among the candidate products and deciding the final design as a green product. 4. Conclusion As a key issue for the environmentally conscious manufacturing, we have focused on product recycling and remanufacturing, and developed a prototype system considering disassembly strategy for recycling. We applied GP as a resolution method, and defined the score of disassembly or an achievability to compare quantitatively the features of disassembly among candidates of DfD products. Furthermore, we designed some GUIs to input data and to review the results efficiently. Finally, we have shown the significance of the proposed system through numerical experiments.
6 Fig.6 Output GUI for computation result. References Navinchandra, D., 1991, Design Theory and Methodology, 31, 119. Beasley, D. and R. R. Martin, 1993, Disassembly sequences for objects built from unit cubes, Computer-Aided Design, 25, 751. Zussman, E. A. Kriwet and G. Seliger, 1994, Disassembly-oriented assessment methodology to support design for recycling, Annals of the CIRP, 43, 9. Xirouchakis, P. and D. Kiritsis, 1997, Petri net modelling for disassembly process planning, ASME, De-94/Med-5, 255. Gungor, A. and S. M. Gupta, 2001, Disassembly sequence plan generation using a branch-and-bound algorithm, Int. J. Prod. Res., 39, 481. Shimizu, Y., K. Kainuma, T. Kitajima, 2001, A Prototype System for Evaluating Life Cycle Engineering of Chemical Products, J. Chem Engng. Japan, 34,.676. Shimizu, Y., Y. Miyata and E. Ishihara, 2002, An Infrastructure for Integrating Element Technologies of Life Cycle Engineering, J. Chem Engng. Japan, 34, 810. Kongar, E. and S. M. Gupta, 2002, A multi-criteria decision making approach for disassembly-to-order systems, J. Electronics Manufacturing, 11, 171.
Solving Assembly Line Balancing Problem using Genetic Algorithm with Heuristics- Treated Initial Population
Solving Assembly Line Balancing Problem using Genetic Algorithm with Heuristics- Treated Initial Population 1 Kuan Eng Chong, Mohamed K. Omar, and Nooh Abu Bakar Abstract Although genetic algorithm (GA)
More informationThe Genetic Algorithm
The Genetic Algorithm The Genetic Algorithm, (GA) is finding increasing applications in electromagnetics including antenna design. In this lesson we will learn about some of these techniques so you are
More informationSolving and Analyzing Sudokus with Cultural Algorithms 5/30/2008. Timo Mantere & Janne Koljonen
with Cultural Algorithms Timo Mantere & Janne Koljonen University of Vaasa Department of Electrical Engineering and Automation P.O. Box, FIN- Vaasa, Finland timan@uwasa.fi & jako@uwasa.fi www.uwasa.fi/~timan/sudoku
More informationThe Application of Multi-Level Genetic Algorithms in Assembly Planning
Volume 17, Number 4 - August 2001 to October 2001 The Application of Multi-Level Genetic Algorithms in Assembly Planning By Dr. Shana Shiang-Fong Smith (Shiang-Fong Chen) and Mr. Yong-Jin Liu KEYWORD SEARCH
More informationAchieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters
Achieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters Scott Watson, Andrew Vardy, Wolfgang Banzhaf Department of Computer Science Memorial University of Newfoundland St John s.
More informationChapter 5 OPTIMIZATION OF BOW TIE ANTENNA USING GENETIC ALGORITHM
Chapter 5 OPTIMIZATION OF BOW TIE ANTENNA USING GENETIC ALGORITHM 5.1 Introduction This chapter focuses on the use of an optimization technique known as genetic algorithm to optimize the dimensions of
More informationDETERMINING AN OPTIMAL SOLUTION
DETERMINING AN OPTIMAL SOLUTION TO A THREE DIMENSIONAL PACKING PROBLEM USING GENETIC ALGORITHMS DONALD YING STANFORD UNIVERSITY dying@leland.stanford.edu ABSTRACT This paper determines the plausibility
More informationThe Simulated Location Accuracy of Integrated CCGA for TDOA Radio Spectrum Monitoring System in NLOS Environment
The Simulated Location Accuracy of Integrated CCGA for TDOA Radio Spectrum Monitoring System in NLOS Environment ao-tang Chang 1, Hsu-Chih Cheng 2 and Chi-Lin Wu 3 1 Department of Information Technology,
More informationEvolutionary Optimization for the Channel Assignment Problem in Wireless Mobile Network
(649 -- 917) Evolutionary Optimization for the Channel Assignment Problem in Wireless Mobile Network Y.S. Chia, Z.W. Siew, S.S. Yang, H.T. Yew, K.T.K. Teo Modelling, Simulation and Computing Laboratory
More informationMehrdad Amirghasemi a* Reza Zamani a
The roles of evolutionary computation, fitness landscape, constructive methods and local searches in the development of adaptive systems for infrastructure planning Mehrdad Amirghasemi a* Reza Zamani a
More informationGenetic Algorithms with Heuristic Knight s Tour Problem
Genetic Algorithms with Heuristic Knight s Tour Problem Jafar Al-Gharaibeh Computer Department University of Idaho Moscow, Idaho, USA Zakariya Qawagneh Computer Department Jordan University for Science
More informationA Novel Multistage Genetic Algorithm Approach for Solving Sudoku Puzzle
A Novel Multistage Genetic Algorithm Approach for Solving Sudoku Puzzle Haradhan chel, Deepak Mylavarapu 2 and Deepak Sharma 2 Central Institute of Technology Kokrajhar,Kokrajhar, BTAD, Assam, India, PIN-783370
More informationSmart Grid Reconfiguration Using Genetic Algorithm and NSGA-II
Smart Grid Reconfiguration Using Genetic Algorithm and NSGA-II 1 * Sangeeta Jagdish Gurjar, 2 Urvish Mewada, 3 * Parita Vinodbhai Desai 1 Department of Electrical Engineering, AIT, Gujarat Technical University,
More informationA Factorial Representation of Permutations and Its Application to Flow-Shop Scheduling
Systems and Computers in Japan, Vol. 38, No. 1, 2007 Translated from Denshi Joho Tsushin Gakkai Ronbunshi, Vol. J85-D-I, No. 5, May 2002, pp. 411 423 A Factorial Representation of Permutations and Its
More informationA Genetic Algorithm-Based Controller for Decentralized Multi-Agent Robotic Systems
A Genetic Algorithm-Based Controller for Decentralized Multi-Agent Robotic Systems Arvin Agah Bio-Robotics Division Mechanical Engineering Laboratory, AIST-MITI 1-2 Namiki, Tsukuba 305, JAPAN agah@melcy.mel.go.jp
More informationSubmitted November 19, 1989 to 2nd Conference Economics and Artificial Intelligence, July 2-6, 1990, Paris
1 Submitted November 19, 1989 to 2nd Conference Economics and Artificial Intelligence, July 2-6, 1990, Paris DISCOVERING AN ECONOMETRIC MODEL BY. GENETIC BREEDING OF A POPULATION OF MATHEMATICAL FUNCTIONS
More informationCS 441/541 Artificial Intelligence Fall, Homework 6: Genetic Algorithms. Due Monday Nov. 24.
CS 441/541 Artificial Intelligence Fall, 2008 Homework 6: Genetic Algorithms Due Monday Nov. 24. In this assignment you will code and experiment with a genetic algorithm as a method for evolving control
More informationCreative Commons: Attribution 3.0 Hong Kong License
Title A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong Author(s) Szeto, WY; Wu, Y Citation European Journal Of Operational Research, 2011, v. 209 n. 2, p. 141-155
More informationSECTOR SYNTHESIS OF ANTENNA ARRAY USING GENETIC ALGORITHM
2005-2008 JATIT. All rights reserved. SECTOR SYNTHESIS OF ANTENNA ARRAY USING GENETIC ALGORITHM 1 Abdelaziz A. Abdelaziz and 2 Hanan A. Kamal 1 Assoc. Prof., Department of Electrical Engineering, Faculty
More informationCOMP SCI 5401 FS2015 A Genetic Programming Approach for Ms. Pac-Man
COMP SCI 5401 FS2015 A Genetic Programming Approach for Ms. Pac-Man Daniel Tauritz, Ph.D. November 17, 2015 Synopsis The goal of this assignment set is for you to become familiarized with (I) unambiguously
More information2. Simulated Based Evolutionary Heuristic Methodology
XXVII SIM - South Symposium on Microelectronics 1 Simulation-Based Evolutionary Heuristic to Sizing Analog Integrated Circuits Lucas Compassi Severo, Alessandro Girardi {lucassevero, alessandro.girardi}@unipampa.edu.br
More informationPopulation Adaptation for Genetic Algorithm-based Cognitive Radios
Population Adaptation for Genetic Algorithm-based Cognitive Radios Timothy R. Newman, Rakesh Rajbanshi, Alexander M. Wyglinski, Joseph B. Evans, and Gary J. Minden Information Technology and Telecommunications
More informationCreating a Dominion AI Using Genetic Algorithms
Creating a Dominion AI Using Genetic Algorithms Abstract Mok Ming Foong Dominion is a deck-building card game. It allows for complex strategies, has an aspect of randomness in card drawing, and no obvious
More informationWire Layer Geometry Optimization using Stochastic Wire Sampling
Wire Layer Geometry Optimization using Stochastic Wire Sampling Raymond A. Wildman*, Joshua I. Kramer, Daniel S. Weile, and Philip Christie Department University of Delaware Introduction Is it possible
More informationGENERIC CODE DESIGN ALGORITHMS FOR REVERSIBLE VARIABLE-LENGTH CODES FROM THE HUFFMAN CODE
GENERIC CODE DESIGN ALGORITHMS FOR REVERSIBLE VARIABLE-LENGTH CODES FROM THE HUFFMAN CODE Wook-Hyun Jeong and Yo-Sung Ho Kwangju Institute of Science and Technology (K-JIST) Oryong-dong, Buk-gu, Kwangju,
More informationJoint QoS Multicast Routing and Channel Assignment in Multiradio Multichannel Wireless Mesh Networks using Intelligent Computational Methods
Joint QoS Multicast Routing and Channel Assignment in Multiradio Multichannel Wireless Mesh Networks using Intelligent Computational Methods Hui Cheng,a, Shengxiang Yang b a Department of Computer Science,
More informationAdaptive Hybrid Channel Assignment in Wireless Mobile Network via Genetic Algorithm
Adaptive Hybrid Channel Assignment in Wireless Mobile Network via Genetic Algorithm Y.S. Chia Z.W. Siew A. Kiring S.S. Yang K.T.K. Teo Modelling, Simulation and Computing Laboratory School of Engineering
More informationSolving Sudoku with Genetic Operations that Preserve Building Blocks
Solving Sudoku with Genetic Operations that Preserve Building Blocks Yuji Sato, Member, IEEE, and Hazuki Inoue Abstract Genetic operations that consider effective building blocks are proposed for using
More informationAlgorithms for Genetics: Basics of Wright Fisher Model and Coalescent Theory
Algorithms for Genetics: Basics of Wright Fisher Model and Coalescent Theory Vineet Bafna Harish Nagarajan and Nitin Udpa 1 Disclaimer Please note that a lot of the text and figures here are copied from
More informationNUMERICAL SIMULATION OF SELF-STRUCTURING ANTENNAS BASED ON A GENETIC ALGORITHM OPTIMIZATION SCHEME
NUMERICAL SIMULATION OF SELF-STRUCTURING ANTENNAS BASED ON A GENETIC ALGORITHM OPTIMIZATION SCHEME J.E. Ross * John Ross & Associates 350 W 800 N, Suite 317 Salt Lake City, UT 84103 E.J. Rothwell, C.M.
More informationReal-time Grid Computing : Monte-Carlo Methods in Parallel Tree Searching
1 Real-time Grid Computing : Monte-Carlo Methods in Parallel Tree Searching Hermann Heßling 6. 2. 2012 2 Outline 1 Real-time Computing 2 GriScha: Chess in the Grid - by Throwing the Dice 3 Parallel Tree
More informationA Hybrid Evolutionary Approach for Multi Robot Path Exploration Problem
A Hybrid Evolutionary Approach for Multi Robot Path Exploration Problem K.. enthilkumar and K. K. Bharadwaj Abstract - Robot Path Exploration problem or Robot Motion planning problem is one of the famous
More informationOPTIMIZATION ON FOOTING LAYOUT DESI RESIDENTIAL HOUSE WITH PILES FOUNDA. Author(s) BUNTARA.S. GAN; NGUYEN DINH KIEN
Title OPTIMIZATION ON FOOTING LAYOUT DESI RESIDENTIAL HOUSE WITH PILES FOUNDA Author(s) BUNTARA.S. GAN; NGUYEN DINH KIEN Citation Issue Date 2013-09-11 DOI Doc URLhttp://hdl.handle.net/2115/54229 Right
More informationGENETIC ALGORITHM BASED SOLUTION IN PWM CONVERTER SWITCHING FOR VOLTAGE SOURCE INVERTER FEEDING AN INDUCTION MOTOR DRIVE
AJSTD Vol. 26 Issue 2 pp. 45-60 (2010) GENETIC ALGORITHM BASED SOLUTION IN PWM CONVERTER SWITCHING FOR VOLTAGE SOURCE INVERTER FEEDING AN INDUCTION MOTOR DRIVE V. Jegathesan Department of EEE, Karunya
More informationEvolving Adaptive Play for the Game of Spoof. Mark Wittkamp
Evolving Adaptive Play for the Game of Spoof Mark Wittkamp This report is submitted as partial fulfilment of the requirements for the Honours Programme of the School of Computer Science and Software Engineering,
More informationLANDSCAPE SMOOTHING OF NUMERICAL PERMUTATION SPACES IN GENETIC ALGORITHMS
LANDSCAPE SMOOTHING OF NUMERICAL PERMUTATION SPACES IN GENETIC ALGORITHMS ABSTRACT The recent popularity of genetic algorithms (GA s) and their application to a wide range of problems is a result of their
More informationAutomating a Solution for Optimum PTP Deployment
Automating a Solution for Optimum PTP Deployment ITSF 2015 David O Connor Bridge Worx in Sync Sync Architect V4: Sync planning & diagnostic tool. Evaluates physical layer synchronisation distribution by
More informationA Study on the KSF Evaluations of Design Management for Korean Small and Medium Companies
Indian Journal of Science and Technology, Vol 9(46), DOI: 10.17485/ijst/2016/v9i46/107858, December 2016 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 A Study on the KSF Evaluations of Design Management
More informationOptimal Design of Modulation Parameters for Underwater Acoustic Communication
Optimal Design of Modulation Parameters for Underwater Acoustic Communication Hai-Peng Ren and Yang Zhao Abstract As the main way of underwater wireless communication, underwater acoustic communication
More informationComputers & Industrial Engineering
Computers & Industrial Engineering 58 (2010) 509 520 Contents lists available at ScienceDirect Computers & Industrial Engineering journal homepage: www.elsevier.com/locate/caie A genetic algorithm approach
More informationReactive Planning with Evolutionary Computation
Reactive Planning with Evolutionary Computation Chaiwat Jassadapakorn and Prabhas Chongstitvatana Intelligent System Laboratory, Department of Computer Engineering Chulalongkorn University, Bangkok 10330,
More informationGENETIC PROGRAMMING. In artificial intelligence, genetic programming (GP) is an evolutionary algorithmbased
GENETIC PROGRAMMING Definition In artificial intelligence, genetic programming (GP) is an evolutionary algorithmbased methodology inspired by biological evolution to find computer programs that perform
More informationEvolutionary Artificial Neural Networks For Medical Data Classification
Evolutionary Artificial Neural Networks For Medical Data Classification GRADUATE PROJECT Submitted to the Faculty of the Department of Computing Sciences Texas A&M University-Corpus Christi Corpus Christi,
More informationCHAPTER 3 HARMONIC ELIMINATION SOLUTION USING GENETIC ALGORITHM
61 CHAPTER 3 HARMONIC ELIMINATION SOLUTION USING GENETIC ALGORITHM 3.1 INTRODUCTION Recent advances in computation, and the search for better results for complex optimization problems, have stimulated
More informationGENETIC ALGORITHM BASED STUDYING OF BUNDLE LINES EFFECT ON NETWORK LOSSES IN TRANSMISSION NETWORK EXPANSION PLANNING
Journal of ELECTRICAL ENGINEERING, VOL. 60, NO. 5, 2009, 237 245 GENETIC ALGORITHM BASED STUDYING OF BUNDLE LINES EFFECT ON NETWORK LOSSES IN TRANSMISSION NETWORK EXPANSION PLANNING Hossein Shayeghi Meisam
More informationTransmission Expansion Planning Considering Network Adequacy and Investment Cost Limitation using Genetic Algorithm M. Mahdavi, E.
International Journal of Electrical and Electronics Engineering 5:4 Transmission Expansion Planning Considering Network Adequacy and Investment Cost Limitation using Genetic Algorithm M. Mahdavi, E. Mahdavi
More informationEvolutions of communication
Evolutions of communication Alex Bell, Andrew Pace, and Raul Santos May 12, 2009 Abstract In this paper a experiment is presented in which two simulated robots evolved a form of communication to allow
More informationCYCLIC GENETIC ALGORITHMS FOR EVOLVING MULTI-LOOP CONTROL PROGRAMS
CYCLIC GENETIC ALGORITHMS FOR EVOLVING MULTI-LOOP CONTROL PROGRAMS GARY B. PARKER, CONNECTICUT COLLEGE, USA, parker@conncoll.edu IVO I. PARASHKEVOV, CONNECTICUT COLLEGE, USA, iipar@conncoll.edu H. JOSEPH
More informationGlobal Asynchronous Distributed Interactive Genetic Algorithm
Global Asynchronous Distributed Interactive Genetic Algorithm Mitsunori MIKI, Yuki YAMAMOTO, Sanae WAKE and Tomoyuki HIROYASU Abstract We have already proposed Parallel Distributed Interactive Genetic
More informationA Multi-Population Parallel Genetic Algorithm for Continuous Galvanizing Line Scheduling
A Multi-Population Parallel Genetic Algorithm for Continuous Galvanizing Line Scheduling Muzaffer Kapanoglu Department of Industrial Engineering Eskişehir Osmangazi University 26030, Eskisehir, Turkey
More informationDevelopment of Practical Software for Micro Traffic Flow Petri Net Simulator
Development of Practical Software for Micro Traffic Flow Petri Net Simulator Noboru Kimata 1), Keiich Kisino 2), Yasuo Siromizu 3) [Abstract] Recently demand for microscopic traffic flow simulators is
More informationDesign Methodology. Šimon Kovář
Design Methodology Šimon Kovář no. of lecture Schedule of lectures Date Time Room Lecture topic lecturer 1 22.2.2016 7:00 KTS TRIZ Pavel Jirman 2 29.2.2016 7:00 KTS TRIZ Pavel Jirman 3 1.3.2016 8:50 LDP
More informationARRANGING WEEKLY WORK PLANS IN CONCRETE ELEMENT PREFABRICATION USING GENETIC ALGORITHMS
ARRANGING WEEKLY WORK PLANS IN CONCRETE ELEMENT PREFABRICATION USING GENETIC ALGORITHMS Chien-Ho Ko 1 and Shu-Fan Wang 2 ABSTRACT Applying lean production concepts to precast fabrication have been proven
More informationDesign Methodology. Šimon Kovář
Design Methodology Šimon Kovář Schedule of lectures Schedule of lectures General information on the methodology of designing The main task of engineers is to apply their scientific and engineering knowledge
More informationA Review on Genetic Algorithm and Its Applications
2017 IJSRST Volume 3 Issue 8 Print ISSN: 2395-6011 Online ISSN: 2395-602X Themed Section: Science and Technology A Review on Genetic Algorithm and Its Applications Anju Bala Research Scholar, Department
More informationImproving Evolutionary Algorithm Performance on Maximizing Functional Test Coverage of ASICs Using Adaptation of the Fitness Criteria
Improving Evolutionary Algorithm Performance on Maximizing Functional Test Coverage of ASICs Using Adaptation of the Fitness Criteria Burcin Aktan Intel Corporation Network Processor Division Hudson, MA
More informationCONTENTS PREFACE. Part One THE DESIGN PROCESS: PROPERTIES, PARADIGMS AND THE EVOLUTIONARY STRUCTURE
Copyrighted Material Dan Braha and Oded Maimon, A Mathematical Theory of Design: Foundations, Algorithms, and Applications, Springer, 1998, 708 p., Hardcover, ISBN: 0-7923-5079-0. PREFACE Part One THE
More informationDepartment of Mechanical Engineering, College of Engineering, National Cheng Kung University
Research Express@NCKU Volume 9 Issue 6 - July 3, 2009 [ http://research.ncku.edu.tw/re/articles/e/20090703/3.html ] A novel heterodyne polarimeter for the multiple-parameter measurements of twisted nematic
More informationLocalized Distributed Sensor Deployment via Coevolutionary Computation
Localized Distributed Sensor Deployment via Coevolutionary Computation Xingyan Jiang Department of Computer Science Memorial University of Newfoundland St. John s, Canada Email: xingyan@cs.mun.ca Yuanzhu
More informationApplying Mechanism of Crowd in Evolutionary MAS for Multiobjective Optimisation
Applying Mechanism of Crowd in Evolutionary MAS for Multiobjective Optimisation Marek Kisiel-Dorohinicki Λ Krzysztof Socha y Adam Gagatek z Abstract This work introduces a new evolutionary approach to
More informationOptimized Modeling of Transformer in Transient State with Genetic Algorithm
nternational Journal of Energy Engineering 2012, 2(3): 108-113 DO: 10.5923/j.ijee.20120203.08 Optimized Modeling of Transformer in Transient State with Genetic Algorithm Mehdi Bigdeli 1,*, Ebrahim Rahimpour
More informationGenetic Algorithm for the Resource-Constrained Project Scheduling Problem Using Encoding with Scheduling Mode
Genetic Algorithm for the Resource-Constrained Project Scheduling Problem Using Encoding with Scheduling Mode Vu Thien Can, Department of Mathematics and Computer Science, University of Ho Chi Minh City,
More informationA Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation
A Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation Christine L. Valenzuela (Mumford) School of Computer Science, Cardiff University, CF24 3AA, United
More informationPULSE-WIDTH OPTIMIZATION IN A PULSE DENSITY MODULATED HIGH FREQUENCY AC-AC CONVERTER USING GENETIC ALGORITHMS *
PULSE-WIDTH OPTIMIZATION IN A PULSE DENSITY MODULATED HIGH FREQUENCY AC-AC CONVERTER USING GENETIC ALGORITHMS BURAK OZPINECI, JOÃO O. P. PINTO, and LEON M. TOLBERT Department of Electrical and Computer
More information1 Introduction
Published in IET Electric Power Applications Received on 8th October 2008 Revised on 9th January 2009 ISSN 1751-8660 Recursive genetic algorithm-finite element method technique for the solution of transformer
More informationBIEB 143 Spring 2018 Weeks 8-10 Game Theory Lab
BIEB 143 Spring 2018 Weeks 8-10 Game Theory Lab Please read and follow this handout. Read a section or paragraph completely before proceeding to writing code. It is important that you understand exactly
More informationGA Optimization for RFID Broadband Antenna Applications. Stefanie Alki Delichatsios MAS.862 May 22, 2006
GA Optimization for RFID Broadband Antenna Applications Stefanie Alki Delichatsios MAS.862 May 22, 2006 Overview Introduction What is RFID? Brief explanation of Genetic Algorithms Antenna Theory and Design
More informationSTIMULATIVE MECHANISM FOR CREATIVE THINKING
STIMULATIVE MECHANISM FOR CREATIVE THINKING Chang, Ming-Luen¹ and Lee, Ji-Hyun 2 ¹Graduate School of Computational Design, National Yunlin University of Science and Technology, Taiwan, R.O.C., g9434703@yuntech.edu.tw
More informationLocal Search: Hill Climbing. When A* doesn t work AIMA 4.1. Review: Hill climbing on a surface of states. Review: Local search and optimization
Outline When A* doesn t work AIMA 4.1 Local Search: Hill Climbing Escaping Local Maxima: Simulated Annealing Genetic Algorithms A few slides adapted from CS 471, UBMC and Eric Eaton (in turn, adapted from
More informationGame Theory and Randomized Algorithms
Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international
More informationAn Improved Rate Matching Method for DVB Systems Through Pilot Bit Insertion
Research Journal of Applied Sciences, Engineering and Technology 4(18): 3251-3256, 2012 ISSN: 2040-7467 Maxwell Scientific Organization, 2012 Submitted: December 28, 2011 Accepted: March 02, 2012 Published:
More informationPermutation Generation Method on Evaluating Determinant of Matrices
Article International Journal of Modern Mathematical Sciences, 2013, 7(1): 12-25 International Journal of Modern Mathematical Sciences Journal homepage:www.modernscientificpress.com/journals/ijmms.aspx
More informationChapter 1 INTRODUCTION TO SOURCE CODING AND CHANNEL CODING. Whether a source is analog or digital, a digital communication
1 Chapter 1 INTRODUCTION TO SOURCE CODING AND CHANNEL CODING 1.1 SOURCE CODING Whether a source is analog or digital, a digital communication system is designed to transmit information in digital form.
More informationShuffled Complex Evolution
Shuffled Complex Evolution Shuffled Complex Evolution An Evolutionary algorithm That performs local and global search A solution evolves locally through a memetic evolution (Local search) This local search
More informationChapter 2 General Disassembly Process
Chapter 2 General Disassembly Process Abstract The economic feasibility of the disassembly process is a main issue restricting its implementation in industry practice. Much research in the planning of
More informationBiologically Inspired Embodied Evolution of Survival
Biologically Inspired Embodied Evolution of Survival Stefan Elfwing 1,2 Eiji Uchibe 2 Kenji Doya 2 Henrik I. Christensen 1 1 Centre for Autonomous Systems, Numerical Analysis and Computer Science, Royal
More informationLearning Behaviors for Environment Modeling by Genetic Algorithm
Learning Behaviors for Environment Modeling by Genetic Algorithm Seiji Yamada Department of Computational Intelligence and Systems Science Interdisciplinary Graduate School of Science and Engineering Tokyo
More informationAn Optimized Performance Amplifier
Electrical and Electronic Engineering 217, 7(3): 85-89 DOI: 1.5923/j.eee.21773.3 An Optimized Performance Amplifier Amir Ashtari Gargari *, Neginsadat Tabatabaei, Ghazal Mirzaei School of Electrical and
More informationFault Location Using Sparse Wide Area Measurements
319 Study Committee B5 Colloquium October 19-24, 2009 Jeju Island, Korea Fault Location Using Sparse Wide Area Measurements KEZUNOVIC, M., DUTTA, P. (Texas A & M University, USA) Summary Transmission line
More informationDNA Basics, Y DNA Marker Tables, Ancestral Trees and Mutation Graphs: Definitions, Concepts, Understanding
DNA Basics, Y DNA Marker Tables, Ancestral Trees and Mutation Graphs: Definitions, Concepts, Understanding by Dr. Ing. Robert L. Baber 2014 July 26 Rights reserved, see the copyright notice at http://gengen.rlbaber.de
More informationGenetic Algorithm for Routing and Spectrum Allocation in Elastic Optical Networks
2016 Third European Network Intelligence Conference Genetic Algorithm for Routing and Spectrum Allocation in Elastic Optical Networks Piotr Lechowicz, Krzysztof Walkowiak Dept. of Systems and Computer
More informationMillimeter Wave RF Front End Design using Neuro-Genetic Algorithms
Millimeter Wave RF Front End Design using Neuro-Genetic Algorithms Rana J. Pratap, J.H. Lee, S. Pinel, G.S. May *, J. Laskar and E.M. Tentzeris Georgia Electronic Design Center Georgia Institute of Technology,
More informationArtificial Intelligence
Artificial Intelligence CS482, CS682, MW 1 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis, sushil@cse.unr.edu, http://www.cse.unr.edu/~sushil Non-classical search - Path does not
More informationA Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles Seyed Mehran Kazemi, Bahare Fatemi
A Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles Seyed Mehran Kazemi, Bahare Fatemi Abstract Sudoku is a logic-based combinatorial puzzle game which is popular among people of different
More informationK.1 Structure and Function: The natural world includes living and non-living things.
Standards By Design: Kindergarten, First Grade, Second Grade, Third Grade, Fourth Grade, Fifth Grade, Sixth Grade, Seventh Grade, Eighth Grade and High School for Science Science Kindergarten Kindergarten
More informationA robust method for deblurring and decoding a barcode image
A robust method for deblurring and a barcode image In collaboration with Mohammed El Rhabi and Gilles Rochefort RealEyes3D, Saint Cloud 1 Description of the problem 2 a barcode image 1 Description of the
More informationEVOLUTIONARY ALGORITHMS IN DESIGN
INTERNATIONAL DESIGN CONFERENCE - DESIGN 2006 Dubrovnik - Croatia, May 15-18, 2006. EVOLUTIONARY ALGORITHMS IN DESIGN T. Stanković, M. Stošić and D. Marjanović Keywords: evolutionary computation, evolutionary
More informationTechniques for Generating Sudoku Instances
Chapter Techniques for Generating Sudoku Instances Overview Sudoku puzzles become worldwide popular among many players in different intellectual levels. In this chapter, we are going to discuss different
More informationA Chaotic Genetic Algorithm for Radio Spectrum Allocation
A Chaotic Genetic Algorithm for Radio Spectrum Allocation Olawale David Jegede, Ken Ferens, Witold Kinsner Dept. of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB, Canada {jegedeo@cc.umanitoba.ca,
More informationMS.LS2.A: Interdependent Relationships in Ecosystems. MS.LS2.C: Ecosystem Dynamics, Functioning, and Resilience. MS.LS4.D: Biodiversity and Humans
Disciplinary Core Idea MS.LS2.A: Interdependent Relationships in Ecosystems Similarly, predatory interactions may reduce the number of organisms or eliminate whole populations of organisms. Mutually beneficial
More informationDecision Tree Analysis in Game Informatics
Decision Tree Analysis in Game Informatics Masato Konishi, Seiya Okubo, Tetsuro Nishino and Mitsuo Wakatsuki Abstract Computer Daihinmin involves playing Daihinmin, a popular card game in Japan, by using
More informationCOMP SCI 5401 FS2018 GPac: A Genetic Programming & Coevolution Approach to the Game of Pac-Man
COMP SCI 5401 FS2018 GPac: A Genetic Programming & Coevolution Approach to the Game of Pac-Man Daniel Tauritz, Ph.D. October 16, 2018 Synopsis The goal of this assignment set is for you to become familiarized
More informationDISTRIBUTION NETWORK RECONFIGURATION FOR LOSS MINIMISATION USING DIFFERENTIAL EVOLUTION ALGORITHM
DISTRIBUTION NETWORK RECONFIGURATION FOR LOSS MINIMISATION USING DIFFERENTIAL EVOLUTION ALGORITHM K. Sureshkumar 1 and P. Vijayakumar 2 1 Department of Electrical and Electronics Engineering, Velammal
More informationA Note on General Adaptation in Populations of Painting Robots
A Note on General Adaptation in Populations of Painting Robots Dan Ashlock Mathematics Department Iowa State University, Ames, Iowa 511 danwell@iastate.edu Elizabeth Blankenship Computer Science Department
More informationMulti-Robot Coordination. Chapter 11
Multi-Robot Coordination Chapter 11 Objectives To understand some of the problems being studied with multiple robots To understand the challenges involved with coordinating robots To investigate a simple
More informationFREQUENCY ESTIMATION OF UNDAMPED EXPONENTIAL SIGNALS USING GENETIC ALGORITHMS
Wednesday, December 4, 005 FREQUENCY ESTIMATION OF UNDAMPED EXPONENTIAL SIGNALS USING GENETIC ALGORITHMS Amit Mitra, Debasis Kundu and Gunjan Agrawal Department of Mathematics & Statistics, Indian Institute
More informationA mathematical model for wavelength assignment in wavelength division multiplexing mesh networks with wavelength reuse
A mathematical model for wavelength assignment in wavelength division multiplexing mesh networks with wavelength reuse Bonar Sitorus a), Nattapong Kitsuwan, and Eiji Oki Department of Communication Engineering
More informationOptimum contribution selection conserves genetic diversity better than random selection in small populations with overlapping generations
Optimum contribution selection conserves genetic diversity better than random selection in small populations with overlapping generations K. Stachowicz 12*, A. C. Sørensen 23 and P. Berg 3 1 Department
More informationEconomic Design of Control Chart Using Differential Evolution
Economic Design of Control Chart Using Differential Evolution Rukmini V. Kasarapu 1, Vijaya Babu Vommi 2 1 Assistant Professor, Department of Mechanical Engineering, Anil Neerukonda Institute of Technology
More informationLocation-allocation models and new solution methodologies in telecommunication networks
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Location-allocation models and new solution methodologies in telecommunication networks To cite this article: S Dinu and V Ciucur
More information