Abstract. Genetic Programming and Evolvable Machines January 2015 Date: 21 Jan 2015
|
|
|
- Oscar Hubbard
- 5 years ago
- Views:
Transcription
1 Look Find out Inside how Get to Access access preview-only content Genetic Programming and Evolvable Machines January 2015 Date: 21 Jan 2015 Abstract Combing a genetic algorithm (GA) with a local search method produces a type of evolutionary algorithm known as a memetic algorithm (MA). Combining a GA with a learning automaton (LA) produces an MA named GALA, where the LA provides the local search function. GALA represents chromosomes as object migration automata (OMAs), whose states represent the history of the local search process. Each state in an OMA has two attributes: the value of the gene (allele), and the degree of association with those values. The local search changes the degree of association between genes and their values. In GALA a chromosome s fitness is computed using only the value of the genes. GALA is a Lamarckian learning model as it passes on the learned traits acquired by its local search method to offspring by a modification of the genotype. Herein we introduce a modified GALA (MGALA) that behaves according to a Baldwinian learning model. In MGALA the fitness function is computed using a chromosome s fitness and the history of the local search recorded by the OMA states. In addition, in MGALA the learned traits are not passed to the offspring. Unlike GALA, MGALA uses all the information recorded in an OMA representation of the chromosome, i.e., the degree of association between genes and their alleles, and the value of a gene, to compute the fitness of genes. We used MGALA to solve two problems: object partitioning and graph isomorphism. MGALA outperformed GALA, a canonical MA, and an OMA-based method using computer simulations, in terms of solution quality and rate of convergence.
2 Article Metrics Citations
3 1. M. Weber, F. Neri, V. Tirronen, Distributed differential evolution with explorative exploitative population families. Genet. Progr. Evolvable Mach. 10, (2009) CrossRef 2. K.W. Ku, M.-W. Mak, Empirical analysis of the factors that affect the Baldwin effect, in Parallel Problem Solving from Nature PPSN V (1998), pp G.M. Morris, D.S. Goodsell, R.S. Halliday, R. Huey, W.E. Hart, R.K. Belew, A.J. Olson, Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function. J. Comput. Chem. 19, (1998) CrossRef 4. C. Xianshun, O. Yew-Soon, L. Meng-Hiot, T. Kay Chen, A multi-facet aurvey on memetic computation. IEEE Trans. Evol. Comput. 15, (2011) CrossRef 5. N. Krasnogor, J. Smith, A tutorial for competent memetic algorithms: model, taxonomy, and design issues. Evol. Comput. IEEE Trans. 9, (2005) CrossRef 6. K. Downing, Reinforced genetic programming. Genet. Progr. Evolvable Mach. 2, (2001) CrossRef 7. K.S. Narendra, M.A.L. Thathachar, Learning automata: an introduction (Prentice-Hall, Inc, Upper Saddle River, 1989) 8. M.A.L. Thathachar, P.S. Sastry, Varieties of learning automata: an overview. IEEE Trans. Syst. Man Cybern. B Cybern. 32, (2002) CrossRef 9. M. Rezapoor, M.R. Meybodi, A hybrid algorithm for solving graph isomorphism problem, in Proceedings of the Second International Conference on Information and Knowledge Technology (IKT2005), Tehran, Iran (2005) 10. B.J. Oommen, D.C.Y. Ma, Deterministic learning automata solutions to the equipartitioning problem. IEEE Trans. Comput. 37, 2 13 (1988) CrossRef 11. M. Rezapoor, M.R. Meybodi, Improving GA+ LA algorithm for solving graph isomorphic problem, in Proceedings of the 11th Annual CSI Computer Conference of Iran, Tehran, Iran (2006), pp
4 12. K. Asghari, A. Safari Mamaghani, F. Mahmoudi, M.R. Meybodi, A relational databases query optimization using hybrid evolutionary algorithm. J. Comput. Robot. 1, (2008) 13. K. Asghari, A. Safari Mamaghani, M.R. Meybodi, An evolutionary approach for query optimization problem in database, in Procceding of Internatinal Joint Conferance on Computers, Information and System Sciences, and Engineering (CISSE2007) (University of Bridgeport, England, 2007) 14. A. Safari Mamaghani, K. Asghari, M.R. Meybodi, F. Mahmoodi, A new method based on genetic algorithm for minimizing join operations cost in data base, in Proceedings of 13th Annual CSI Computer Conference of Iran, Kish Island, Iran (2008) 15. A. Safari Mamaghani, K. Asghari, F. Mahmoudi, and M. R. Meybodi, A novel hybrid algorithm for joint ordering problem in database queries, in Proceedings of 6th WSEAS international Conference on Computational Intelligence, Man-Machine Systems and Cybernetics, Tenerife, Spain (2007), pp B. Zaree, M. R. Meybodi, An evolutionary method for solving symmetric TSP, in Proceedings of the Third International Conference on Information and Knowledge Technology (IKT2007), Mashhad, Iran (2007) 17. B. Zaree, M.R. Meybodi, M. Abbaszadeh, A hybrid method for solving traveling salesman problem. IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007, (2007) 18. B. Zaree, K. Asghari, M.R. Meybodi, A hybrid method based on clustering for solving large traveling salesman problem, in Proceedings of 13th Annual CSI Computer Conference of Iran, Kish Island, Iran (2008) 19. K. Asghari, M.R. Meybodi, Searching for Hamiltonian cycles in graphs using evolutionary methods, in Proceedings of the second Joint Congress on Fuzzy and Intelligent Systems, Tehran, Iran (2008) 20. B. Zaree, M.R. Meybodi, A hybrid method for sorting problem, in Proceedings of the Third International Conference on Information and Knowledge Technology (IKT2007), Mashhad, Iran (2007) 21. A. Safari Mamaghani, M.R. Meybodi, Hybrid algorithms (learning automata + genetic algorithm) for solving graph bandwidth minimization problem, in Proceedings of the second Joint Congress on Fuzzy and Intelligent Systems, Tehran, Iran (2008) 22. A.S. Mamaghani, M.R. Meybodi, A learning automaton based approach to solve the graph bandwidth minimization problem, in International Conference on Application of Information and Communication Technologies (AICT) (2011), pp. 1 5
5 23. A. Isazadeh, H. Izadkhah, A. Mokarram, A learning based evolutionary approach for minimization of matrix bandwidth problem. Appl. Math. 6, (2012) 24. A.S. Mamaghani, M.R. Meybodi, Clustering of software systems using new hybrid algorithms, in Ninth IEEE International Conference on Computer and Information Technology (2009), pp A. Safari Mamaghani, M.R. Meybodi, Hybrid evolutionary algorithms for solving software clustering problem, in Proceedings of the second Joint Congress on Fuzzy and Intelligent Systems, Tehran, Iran (2008) 26. K. Asghari, M.R. Meybodi, Solving single machine total weighted tardiness scheduling problem using learning automata and genetic algorithm, in Proceedings of the 3rd Iran Data Mining Conference(IDMC 09), Tehran Iran (2009) 27. A.S. Mamaghani, M. Mahi, M.R. Meybodi, A learning automaton based approach for data fragments allocation in distributed database systems, in IEEE 10th International Conference on Computer and Information Technology (CIT) (2010), pp A.S. Mamaghani, M. Mahi, M.R. Meybodi, M.H. Moghaddam, A novel evolutionary algorithm for solving static data allocation problem in distributed database systems, in Second International Conference on Network Applications Protocols and Services (NETAPPS) (2010), pp V. Majid Nezhad, H. Motee Gader, E. Efimov, A novel hybrid algorithm for task graph scheduling. Int. J. Comput. Sci. Issues 8, (2011) 30. A. Bansal, R. Kaur, Task graph scheduling on multiprocessor system using genetic algorithm. Int. J. Eng. Res. Technol. 1, 1 5 (2012) 31. W. Yuan-Kai, F. Kuo-Chin, H. Jorng-Tzong, Genetic-based search for error-correcting graph isomorphism. IEEE Trans. Syst. Man Cybern. B Cybern. 27, (1997) CrossRef 32. P. Foggia, C. Sansone, M. Vento, A database of graphs for isomorphism and sub-graph isomorphism benchmarking, in Proceedings of the 3rd IAPR TC-15 International Workshop on Graph-based Representations (2001), pp J.R. Ullmann, An algorithm for subgraph isomorphism. J. ACM 23, (1976) CrossRef 34. L.P. Cordella, P. Foggia, C. Sansone, M. Vento, A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26, (2004) CrossRef
6 Title A learning automata-based memetic algorithm Journal Genetic Programming and Evolvable Machines DOI /s Print ISSN Online ISSN Publisher Springer US Additional Links Topics Register for Journal Updates Editorial Board About This Journal Manuscript Submission Artificial Intelligence (incl. Robotics) Software Engineering/Programming and Operating Systems Electrical Engineering Programming Techniques Programming Languages, Compilers, Interpreters
7 Keywords Biomedical Engineering Learning automata (LA) Local search Memetic algorithm (MA) Object migration automata (OMA) Authors M. Rezapoor Mirsaleh (1) M. R. Meybodi Author Affiliations (1) (2) 1. Soft Computing Laboratory, Computer Engineering and Information Technology Department, Amirkabir University of Technology, Tehran, Iran 2. Institute for Research and Fundamental Sciences, School of Computer Science, Tehran, Iran Continue reading... To view the rest of this content please follow the download PDF link above. Over 8.5 million scientific documents at your fingertips Springer International Publishing AG, Part of Springer Science+Business Media
A Learning Automata-based Memetic Algorithm
A Learning Automata-based Memetic Algorithm M. Rezapoor Mirsaleh and M. R. Meybodi 2,3 Soft Computing Laboratory, Computer Engineering and Information Technology Department, Amirkabir University of Technology,
Grid resource discovery based on distributed learning automata
Page 1 of 7 Look Find out Inside how Get to Access access preview-only content Computing September 2014, Volume 96, Issue 9, pp 909-922 Date: 15 Jun 2013 Grid resource discovery based on distributed learning
Task Graph Scheduling on Multiprocessor System using Genetic Algorithm
Task Graph Scheduling on Multiprocessor System using Genetic Algorithm Amit Bansal M.Tech student DCSE, G.N.D.U. Amritsar, India Ravreet Kaur Asst. Professor DCSE, G.N.D.U. Amritsar, India Abstract Task
Balancing exploration and exploitation in memetic algorithms: A learning automata approach
Received: 26 April 2015 Revised: 27 August 2017 Accepted: 1 September 2017 DOI: 10.1111/coin.12148 ORIGINAL ARTICLE Balancing exploration and exploitation in memetic algorithms: A learning automata approach
Hybridization EVOLUTIONARY COMPUTING. Reasons for Hybridization - 1. Naming. Reasons for Hybridization - 3. Reasons for Hybridization - 2
Hybridization EVOLUTIONARY COMPUTING Hybrid Evolutionary Algorithms hybridization of an EA with local search techniques (commonly called memetic algorithms) EA+LS=MA constructive heuristics exact methods
AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING
International Journal of Latest Research in Science and Technology Volume 3, Issue 3: Page No. 201-205, May-June 2014 http://www.mnkjournals.com/ijlrst.htm ISSN (Online):2278-5299 AN EVOLUTIONARY APPROACH
THE OPTIMIZATION OF RUNNING QUERIES IN RELATIONAL DATABASES USING ANT-COLONY ALGORITHM
THE OPTIMIZATION OF RUNNING QUERIES IN RELATIONAL DATABASES USING ANT-COLONY ALGORITHM Adel Alinezhad Kolaei and Marzieh Ahmadzadeh Department of Computer Engineering & IT Shiraz University of Technology
A Novel Hybrid Algorithm for Join Ordering Problem in Database Queries
6th WSEAS Int. Conference on Computational Intelligence, Man-Machine Systems and Cybernetics, Tenerife, Spain, December 4-6, 7 4 A Novel Hybrid Algorithm for Join Ordering Problem in Database Queries Ali
CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN
97 CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN 5.1 INTRODUCTION Fuzzy systems have been applied to the area of routing in ad hoc networks, aiming to obtain more adaptive and flexible
Cellular Learning Automata-Based Color Image Segmentation using Adaptive Chains
Cellular Learning Automata-Based Color Image Segmentation using Adaptive Chains Ahmad Ali Abin, Mehran Fotouhi, Shohreh Kasaei, Senior Member, IEEE Sharif University of Technology, Tehran, Iran abin@ce.sharif.edu,
A Genetic Algorithm Approach for Clustering
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 3 Issue 6 June, 2014 Page No. 6442-6447 A Genetic Algorithm Approach for Clustering Mamta Mor 1, Poonam Gupta
GA is the most popular population based heuristic algorithm since it was developed by Holland in 1975 [1]. This algorithm runs faster and requires les
![GA is the most popular population based heuristic algorithm since it was developed by Holland in 1975 [1]. This algorithm runs faster and requires les](/thumbs/74/70695105.jpg "GA is the most popular population based heuristic algorithm since it was developed by Holland in 1975 [1]. This algorithm runs faster and requires les")
Chaotic Crossover Operator on Genetic Algorithm Hüseyin Demirci Computer Engineering, Sakarya University, Sakarya, 54187, Turkey Ahmet Turan Özcerit Computer Engineering, Sakarya University, Sakarya, 54187,
A New Approach for Optimal Clustering of Distributed Program's Call Flow Graph
ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 37 A New Approach for Optimal Clustering of Distributed Program's Call Flow Graph Yousef Abofathy 1, Bager Zarei 2 1 Department of Computer Engineering,
A Performance Comparison of Five Algorithms for Graph Isomorphism
A Performance Comparison of Five Algorithms for Graph Isomorphism P. Foggia, C.Sansone, M. Vento Dipartimento di Informatica e Sistemistica Via Claudio, 21 - I 80125 - Napoli, Italy {foggiapa, carlosan,
Solving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques
Solving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques N.N.Poddar 1, D. Kaur 2 1 Electrical Engineering and Computer Science, University of Toledo, Toledo, OH, USA 2
Using Simple Ancestry to Deter Inbreeding for Persistent Genetic Algorithm Search
Using Simple Ancestry to Deter Inbreeding for Persistent Genetic Algorithm Search Aditya Wibowo and Peter Jamieson Dept. of Electrical and Computer Engineering Miami University Abstract In this work, we
Performance of general graph isomorphism algorithms Sara Voss Coe College, Cedar Rapids, IA
Performance of general graph isomorphism algorithms Sara Voss Coe College, Cedar Rapids, IA I. Problem and Motivation Graphs are commonly used to provide structural and/or relational descriptions. A node
CLA-DE: a hybrid model based on cellular learning automata for numerical optimization
Appl Intell (2012) 36:735 748 DOI 10.1007/s10489-011-0292-1 ORIGINAL PAPER CLA-DE: a hybrid model based on cellular learning automata for numerical optimization R. Vafashoar M.R. Meybodi A.H. Momeni Azandaryani
The Design of Pole Placement With Integral Controllers for Gryphon Robot Using Three Evolutionary Algorithms
The Design of Pole Placement With Integral Controllers for Gryphon Robot Using Three Evolutionary Algorithms Somayyeh Nalan-Ahmadabad and Sehraneh Ghaemi Abstract In this paper, pole placement with integral
Definition 2.3: [5] Let, and, be two simple graphs. Then the composition of graphs. and is denoted by,
![Definition 2.3: [5] Let, and, be two simple graphs. Then the composition of graphs. and is denoted by,](/thumbs/86/94752089.jpg "Definition 2.3: [5] Let, and, be two simple graphs. Then the composition of graphs. and is denoted by,")
International Journal of Pure Applied Mathematics Volume 119 No. 14 2018, 891-898 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu ON M-POLAR INTUITIONISTIC FUZZY GRAPHS K. Sankar 1,
Using Genetic Algorithms to optimize ACS-TSP
Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca
Genetic Tuning for Improving Wang and Mendel s Fuzzy Database
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Genetic Tuning for Improving Wang and Mendel s Fuzzy Database E. R. R. Kato, O.
A Genetic Algorithm-Based Approach for Energy- Efficient Clustering of Wireless Sensor Networks
A Genetic Algorithm-Based Approach for Energy- Efficient Clustering of Wireless Sensor Networks A. Zahmatkesh and M. H. Yaghmaee Abstract In this paper, we propose a Genetic Algorithm (GA) to optimize
New method for edge detection and de noising via fuzzy cellular automata
International Journal of Physical Sciences Vol. 6(13), pp. 3175-3180, 4 July, 2011 Available online at http://www.academicjournals.org/ijps DOI: 10.5897/IJPS11.047 ISSN 1992-1950 2011 Academic Journals
An Improved Algorithm for Matching Large Graphs
An Improved Algorithm for Matching Large Graphs L. P. Cordella, P. Foggia, C. Sansone, M. Vento Dipartimento di Informatica e Sistemistica Università degli Studi di Napoli Federico II Via Claudio, 2 8025
A Memetic Heuristic for the Co-clustering Problem
A Memetic Heuristic for the Co-clustering Problem Mohammad Khoshneshin 1, Mahtab Ghazizadeh 2, W. Nick Street 1, and Jeffrey W. Ohlmann 1 1 The University of Iowa, Iowa City IA 52242, USA {mohammad-khoshneshin,nick-street,jeffrey-ohlmann}@uiowa.edu
Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding
e Scientific World Journal, Article ID 746260, 8 pages http://dx.doi.org/10.1155/2014/746260 Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding Ming-Yi
A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery
A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery Monika Sharma 1, Deepak Sharma 2 1 Research Scholar Department of Computer Science and Engineering, NNSS SGI Samalkha,
A Novel Hybrid Self Organizing Migrating Algorithm with Mutation for Global Optimization
International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-3, Issue-6, January 2014 A Novel Hybrid Self Organizing Migrating Algorithm with Mutation for Global Optimization
Dejong Function Optimization by means of a Parallel Approach to Fuzzified Genetic Algorithm
Dejong Function Optimization by means of a Parallel Approach to Fuzzified Genetic Algorithm Ebrahim Bagheri, Hossein Deldari Department of Computer Science, University of New Bruswick Department of Computer
Genetic Algorithm for Job Shop Scheduling
Genetic Algorithm for Job Shop Scheduling Mr.P.P.Bhosale Department Of Computer Science and Engineering, SVERI s College Of Engineering Pandharpur, Solapur University Solapur Mr.Y.R.Kalshetty Department
Adaptive edge detection via image statistic features and hybrid model of fuzzy cellular automata and cellular learning automata
2009 International Conference on Information and Multimedia Technology Adaptive edge detection via image statistic features and hybrid model of fuzzy cellular automata and cellular learning automata R.Enayatifar
Mobile Robots Path Planning using Genetic Algorithms
Mobile Robots Path Planning using Genetic Algorithms Nouara Achour LRPE Laboratory, Department of Automation University of USTHB Algiers, Algeria nachour@usthb.dz Mohamed Chaalal LRPE Laboratory, Department
ACCELERATING THE ANT COLONY OPTIMIZATION
ACCELERATING THE ANT COLONY OPTIMIZATION BY SMART ANTS, USING GENETIC OPERATOR Hassan Ismkhan Department of Computer Engineering, University of Bonab, Bonab, East Azerbaijan, Iran H.Ismkhan@bonabu.ac.ir
Genetic-PSO Fuzzy Data Mining With Divide and Conquer Strategy
Genetic-PSO Fuzzy Data Mining With Divide and Conquer Strategy Amin Jourabloo Department of Computer Engineering, Sharif University of Technology, Tehran, Iran E-mail: jourabloo@ce.sharif.edu Abstract
A New Discrete Binary Particle Swarm Optimization based on Learning Automata
A New Discrete Binary Particle Swarm Optimization based on Learning Automata R. Rastegar M. R. Meybodi K. Badie Soft Computing Lab Soft Computing Lab Information Technology Computer Eng. Department Computer
IMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE
IMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE Fang Wang, and Yuhui Qiu Intelligent Software and Software Engineering Laboratory, Southwest-China Normal University,
A GENETIC ALGORITHM FOR CLUSTERING ON VERY LARGE DATA SETS
A GENETIC ALGORITHM FOR CLUSTERING ON VERY LARGE DATA SETS Jim Gasvoda and Qin Ding Department of Computer Science, Pennsylvania State University at Harrisburg, Middletown, PA 17057, USA {jmg289, qding}@psu.edu
A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP
A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP Wael Raef Alkhayri Fahed Al duwairi High School Aljabereyah, Kuwait Suhail Sami Owais Applied Science Private University Amman,
Keywords benchmark functions, hybrid genetic algorithms, hill climbing, memetic algorithms.
Volume 4, Issue 5, May 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Memetic Algorithm:
Solving Traveling Salesman Problem Using Combinational Evolutionary Algorithm
Solving Traveling Salesman Problem Using Combinational Evolutionary Algorithm Mohammad Reza Bonyadi\ S.Mostafa Rahimi Azghadi^ and Hamed Shah Hosseini^ 1 Department of Electrical & Computer Engineering,
Learning Fuzzy Cognitive Maps by a Hybrid Method Using Nonlinear Hebbian Learning and Extended Great Deluge Algorithm
Learning Fuzzy Cognitive Maps by a Hybrid Method Using Nonlinear Hebbian Learning and Extended Great Deluge Algorithm Zhaowei Ren School of Electronic and Computing Systems University of Cincinnati 600
A New Algorithm for Solving the Operation Assignment Problem in 3-Machine Robotic Cell Scheduling
Australian Journal of Basic and Applied Sciences, 5(12): 1578-1585, 211 ISSN 1991-8178 A New Algorithm for Solving the Operation Assignment Problem in 3-Machine Robotic Cell Scheduling 1 Mohammad Fathian,
A Hybrid Method for Solving Traveling Salesman Problem
A Hybrid Method for Solving Traveling Salesman Problem Bager Zarei Dept. of Computer Engineering, Islamic Azad University Branch of Shabestar, Iran Zarei_Bager@yahoo.com M.R. Meybodi Dept. of Computer
INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & MANAGEMENT
INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & MANAGEMENT MOBILITY MANAGEMENT IN CELLULAR NETWORK Prakhar Agrawal 1, Ravi Kateeyare 2, Achal Sharma 3 1 Research Scholar, 2,3 Asst. Professor 1,2,3 Department
International Journal of Modern Trends in Engineering and Research e-issn: p-issn:
International Journal of Modern Trends in Engineering and Research www.ijmter.com Fragmentation as a Part of Security in Distributed Database: A Survey Vaidik Ochurinda 1 1 External Student, MCA, IGNOU.
IEEE Journal Titles and Reference Abbreviations Reference Abbreviation
IEEE Journal Titles and Reference Abbreviations Title Access, IEEE Aerospace and Electronic Systems, IEEE Transactions on Affective Computing, IEEE Transactions on Antennas and Propagation, IEEE Transactions
Target Assignment in Robotics and its Distance Optimality Using DDA Optimization in Image Processing
Human Journals Research Article September 2017 Vol.:7, Issue:3 All rights are reserved by Rama Kanta Choudhury et al. Target Assignment in Robotics and its Distance Optimality Using DDA Optimization in
ENHANCED BEE COLONY ALGORITHM FOR SOLVING TRAVELLING SALESPERSON PROBLEM
ENHANCED BEE COLONY ALGORITHM FOR SOLVING TRAVELLING SALESPERSON PROBLEM Prateek Agrawal 1, Harjeet Kaur 2, and Deepa Bhardwaj 3 123 Department of Computer Engineering, Lovely Professional University (
Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
A Modified Genetic Algorithm for Process Scheduling in Distributed System
A Modified Genetic Algorithm for Process Scheduling in Distributed System Vinay Harsora B.V.M. Engineering College Charatar Vidya Mandal Vallabh Vidyanagar, India Dr.Apurva Shah G.H.Patel College of Engineering
A Performance Comparison of Five Algorithms for Graph Isomorphism
A Performance Comparison of Five Algorithms for Graph Isomorphism P. Foggia, C.Sansone, M. Vento Dipartimento di Informatica e Sistemistica Via Claudio, 21 - I 80125 - Napoli, Italy {foggiapa, carlosan,
A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking
A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking P. Foggia, C. Sansone, M. Vento Dipartimento di Informatica e Sistemistica - Università di Napoli "Federico II" Via Claudio 21,
Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design
City University of New York (CUNY) CUNY Academic Works International Conference on Hydroinformatics 8-1-2014 Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design Matthew
Genetic algorithm based on number of children and height task for multiprocessor task Scheduling
Genetic algorithm based on number of children and height task for multiprocessor task Scheduling Marjan Abdeyazdan 1,Vahid Arjmand 2,Amir masoud Rahmani 3, Hamid Raeis ghanavati 4 1 Department of Computer
CELLULAR automata (CA) are mathematical models for
1 Cellular Learning Automata with Multiple Learning Automata in Each Cell and its Applications Hamid Beigy and M R Meybodi Abstract The cellular learning automata, which is a combination of cellular automata
Optimizing the Sailing Route for Fixed Groundfish Survey Stations
International Council for the Exploration of the Sea CM 1996/D:17 Optimizing the Sailing Route for Fixed Groundfish Survey Stations Magnus Thor Jonsson Thomas Philip Runarsson Björn Ævar Steinarsson Presented
A Genetic Algorithm Approach to the Group Technology Problem
IMECS 008, 9- March, 008, Hong Kong A Genetic Algorithm Approach to the Group Technology Problem Hatim H. Sharif, Khaled S. El-Kilany, and Mostafa A. Helaly Abstract In recent years, the process of cellular
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem Bindu Student, JMIT Radaur binduaahuja@gmail.com Mrs. Pinki Tanwar Asstt. Prof, CSE, JMIT Radaur pinki.tanwar@gmail.com Abstract
Automatic Selection of GCC Optimization Options Using A Gene Weighted Genetic Algorithm
Automatic Selection of GCC Optimization Options Using A Gene Weighted Genetic Algorithm San-Chih Lin, Chi-Kuang Chang, Nai-Wei Lin National Chung Cheng University Chiayi, Taiwan 621, R.O.C. {lsch94,changck,naiwei}@cs.ccu.edu.tw
A COMPARATIVE STUDY OF FIVE PARALLEL GENETIC ALGORITHMS USING THE TRAVELING SALESMAN PROBLEM
A COMPARATIVE STUDY OF FIVE PARALLEL GENETIC ALGORITHMS USING THE TRAVELING SALESMAN PROBLEM Lee Wang, Anthony A. Maciejewski, Howard Jay Siegel, and Vwani P. Roychowdhury * Microsoft Corporation Parallel
A HYBRID APPROACH IN GENETIC ALGORITHM: COEVOLUTION OF THREE VECTOR SOLUTION ENCODING. A CASE-STUDY
A HYBRID APPROACH IN GENETIC ALGORITHM: COEVOLUTION OF THREE VECTOR SOLUTION ENCODING. A CASE-STUDY Dmitriy BORODIN, Victor GORELIK, Wim DE BRUYN and Bert VAN VRECKEM University College Ghent, Ghent, Belgium
Cloud Computing Resource Planning Based on Imperialist Competitive Algorithm
Cumhuriyet Üniversitesi Fen Fakültesi Fen Bilimleri Dergisi (CFD), Cilt:36, No: 4 Özel Sayı (205) ISSN: 300-949 Cumhuriyet University Faculty of Science Science Journal (CSJ), Vol. 36, No: 4 Special Issue
NSGA-II for Biological Graph Compression
Advanced Studies in Biology, Vol. 9, 2017, no. 1, 1-7 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/asb.2017.61143 NSGA-II for Biological Graph Compression A. N. Zakirov and J. A. Brown Innopolis
Combining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem
Combining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem Weichen Liu, Thomas Weise, Yuezhong Wu and Qi Qi University of Science and Technology of Chine
Research Article A Novel Solution based on NAT Traversal for High-speed Accessing the Campus Network from the Public Network
Research Journal of Applied Sciences, Engineering and Technology 7(2): 221-226, 2014 DOI:10.19026/rjaset.7.244 ISSN: 2040-7459; e-issn: 2040-7467 2014 Maxwell Scientific Publication Corp. Submitted: March
ISSN: [Keswani* et al., 7(1): January, 2018] Impact Factor: 4.116
![ISSN: [Keswani* et al., 7(1): January, 2018] Impact Factor: 4.116](/thumbs/83/88606712.jpg "ISSN: [Keswani* et al., 7(1): January, 2018] Impact Factor: 4.116")
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY AUTOMATIC TEST CASE GENERATION FOR PERFORMANCE ENHANCEMENT OF SOFTWARE THROUGH GENETIC ALGORITHM AND RANDOM TESTING Bright Keswani,
A Method of View Materialization Using Genetic Algorithm
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 18, Issue 2, Ver. III (Mar-Apr. 2016), PP 125-133 www.iosrjournals.org A Method of View Materialization Using
Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
28 Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree 1 Tanu Gupta, 2 Anil Kumar 1 Research Scholar, IFTM, University, Moradabad, India. 2 Sr. Lecturer, KIMT, Moradabad, India. Abstract Many
A Structural Optimization Method of Genetic Network Programming. for Enhancing Generalization Ability
International Journal of Engineering Innovation and Management Vol.6, No.2, 2016 A Structural Optimization Method of Genetic Network Programming for Enhancing Generalization Ability Shingo Mabu, Yamaguchi
A New Crossover Technique for Cartesian Genetic Programming
A New Crossover Technique for Cartesian Genetic Programming Genetic Programming Track Janet Clegg Intelligent Systems Group, Department of Electronics University of York, Heslington York, YO DD, UK jc@ohm.york.ac.uk
Hybrid Bionic Algorithms for Solving Problems of Parametric Optimization
World Applied Sciences Journal 23 (8): 1032-1036, 2013 ISSN 1818-952 IDOSI Publications, 2013 DOI: 10.5829/idosi.wasj.2013.23.08.13127 Hybrid Bionic Algorithms for Solving Problems of Parametric Optimization
A GENETIC ALGORITHM BASED APPROACH TO SOLVE VLSI FLOORPLANNING PROBLEM
International Journal of Computer Engineering & Technology (IJCET) Volume 9, Issue 6, November-December2018, pp. 46 54, Article ID: IJCET_09_06_006 Available online at http://www.iaeme.com/ijcet/issues.asp?jtype=ijcet&vtype=9&itype=6
The k-means Algorithm and Genetic Algorithm
The k-means Algorithm and Genetic Algorithm k-means algorithm Genetic algorithm Rough set approach Fuzzy set approaches Chapter 8 2 The K-Means Algorithm The K-Means algorithm is a simple yet effective
Optimizing Flow Shop Sequencing Through Simulation Optimization Using Evolutionary Methods
Optimizing Flow Shop Sequencing Through Simulation Optimization Using Evolutionary Methods Sucharith Vanguri 1, Travis W. Hill 2, Allen G. Greenwood 1 1 Department of Industrial Engineering 260 McCain
The Genetic Algorithm for finding the maxima of single-variable functions
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding
A Study on Optimization Algorithms for Clustering Gene Expression Data
A Study on Optimization Algorithms for Clustering Gene Expression Data Athul Jose 1, Chandrasekar P 2 PG scholor Dept of CSE, Bannari Amman Institute of technology, Sathyamangalam, Tamilnadu, India 1,
An Improved Genetic Algorithm for the Traveling Salesman Problem with Multi-Relations
Journal of Computer Science 7 (1): 70-74, 2011 ISSN 1549-3636 2011 Science Publications An Improved Genetic Algorithm for the Traveling Salesman Problem with Multi-Relations Supat Patvichaichod Department
A THREAD BUILDING BLOCKS BASED PARALLEL GENETIC ALGORITHM
www.arpapress.com/volumes/vol31issue1/ijrras_31_1_01.pdf A THREAD BUILDING BLOCKS BASED PARALLEL GENETIC ALGORITHM Erkan Bostanci *, Yilmaz Ar & Sevgi Yigit-Sert SAAT Laboratory, Computer Engineering Department,
A Framework on Ontology Based Classification and Clustering for Grouping Research Proposals
A Framework on Ontology Based Classification and Clustering for Grouping Research Proposals KODAM ANUSHA* 1 PG Scholar, Dept of CSE, Kakatiya Institute of Technology and Science, Warangal. Abstract- The
Hybrid of Genetic Algorithm and Continuous Ant Colony Optimization for Optimum Solution
International Journal of Computer Networs and Communications Security VOL.2, NO.1, JANUARY 2014, 1 6 Available online at: www.cncs.org ISSN 2308-9830 C N C S Hybrid of Genetic Algorithm and Continuous
Comparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-661, p- ISSN: 2278-8727Volume 13, Issue 3 (Jul. - Aug. 213), PP 17-22 Comparison Study of Multiple Traveling Salesmen Problem using Genetic
Test Case Generation for Classes in Objects-Oriented Programming Using Grammatical Evolution
Test Case Generation for Classes in Objects-Oriented Programming Using Grammatical Evolution Jirawat Chaiareerat, Peraphon Sophatsathit and Chidchanok Lursinsap Abstract This paper proposes a dynamic test
RESOLVING AMBIGUITIES IN PREPOSITION PHRASE USING GENETIC ALGORITHM
International Journal of Computer Engineering and Applications, Volume VIII, Issue III, December 14 RESOLVING AMBIGUITIES IN PREPOSITION PHRASE USING GENETIC ALGORITHM Department of Computer Engineering,
BI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR FLEXIBLE JOB-SHOP SCHEDULING PROBLEM. Minimizing Make Span and the Total Workload of Machines
International Journal of Mathematics and Computer Applications Research (IJMCAR) ISSN 2249-6955 Vol. 2 Issue 4 Dec - 2012 25-32 TJPRC Pvt. Ltd., BI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR FLEXIBLE JOB-SHOP
Optimal Knots Allocation in Smoothing Splines using intelligent system. Application in bio-medical signal processing.
Optimal Knots Allocation in Smoothing Splines using intelligent system. Application in bio-medical signal processing. O.Valenzuela, M.Pasadas, F. Ortuño, I.Rojas University of Granada, Spain Abstract.
Investigation of Simulated Annealing, Ant-Colony and Genetic Algorithms for Distribution Network Expansion Planning with Distributed Generation
Investigation of Simulated Annealing, Ant-Colony and Genetic Algorithms for Distribution Network Expansion Planning with Distributed Generation Majid Gandomkar, Hajar Bagheri Tolabi Department of Electrical
Evolving SQL Queries for Data Mining
Evolving SQL Queries for Data Mining Majid Salim and Xin Yao School of Computer Science, The University of Birmingham Edgbaston, Birmingham B15 2TT, UK {msc30mms,x.yao}@cs.bham.ac.uk Abstract. This paper
HEURISTIC BASED TASK SCHEDULING IN MULTIPROCESSOR SYSTEMS WITH GENETIC ALGORITHM BY CHOOSING THE ELIGIBLE PROCESSOR
HEURISTIC BASED TASK SCHEDULING IN MULTIPROCESSOR SYSTEMS WITH GENETIC ALGORITHM BY CHOOSING THE ELIGIBLE PROCESSOR Probir Roy 1, Md. Mejbah Ul Alam 1 and Nishita Das 2 1 Bangladesh University of Engineering
A Genetic Based Algorithm to Generate Random Simple Polygons Using a New Polygon Merge Algorithm
A Genetic Based Algorithm to Generate Random Simple Polygons Using a New Polygon Merge Algorithm Ali Nourollah, Mohsen Movahedinejad Abstract In this paper a new algorithm to generate random simple polygons
Performance Assessment of DMOEA-DD with CEC 2009 MOEA Competition Test Instances
Performance Assessment of DMOEA-DD with CEC 2009 MOEA Competition Test Instances Minzhong Liu, Xiufen Zou, Yu Chen, Zhijian Wu Abstract In this paper, the DMOEA-DD, which is an improvement of DMOEA[1,
Solving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster
Solving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster Plamenka Borovska Abstract: The paper investigates the efficiency of the parallel computation of the travelling
A new fine-grained evolutionary algorithm based on cellular learning automata
International Journal of Hybrid Intelligent Systems 3 (2006) 83 98 83 IOS Press A new fine-grained evolutionary algorithm based on cellular learning automata Reza Rastegar a,, Mohammad Reza Meybodi b and
A Parallel Architecture for the Generalized Traveling Salesman Problem
A Parallel Architecture for the Generalized Traveling Salesman Problem Max Scharrenbroich AMSC 663 Project Proposal Advisor: Dr. Bruce L. Golden R. H. Smith School of Business 1 Background and Introduction
Genetic Algorithms with Mapreduce Runtimes
Genetic Algorithms with Mapreduce Runtimes Fei Teng 1, Doga Tuncay 2 Indiana University Bloomington School of Informatics and Computing Department CS PhD Candidate 1, Masters of CS Student 2 {feiteng,dtuncay}@indiana.edu
An Efficient Technique to Test Suite Minimization using Hierarchical Clustering Approach
An Efficient Technique to Test Suite Minimization using Hierarchical Clustering Approach Fayaz Ahmad Khan, Anil Kumar Gupta, Dibya Jyoti Bora Abstract:- Software testing is a pervasive activity in software
Solving Travelling Salesman Problem and Mapping to Solve Robot Motion Planning through Genetic Algorithm Principle
Indian Journal of Science and Technology, Vol 8(35), DOI: 10.17485/ijst/2015/v8i35/86809, December 2015 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Solving Travelling Salesman Problem and Mapping
ABSTRACT I. INTRODUCTION. J Kanimozhi *, R Subramanian Department of Computer Science, Pondicherry University, Puducherry, Tamil Nadu, India
ABSTRACT 2018 IJSRSET Volume 4 Issue 4 Print ISSN: 2395-1990 Online ISSN : 2394-4099 Themed Section : Engineering and Technology Travelling Salesman Problem Solved using Genetic Algorithm Combined Data
A Case Study on Grammatical-based Representation for Regular Expression Evolution
A Case Study on Grammatical-based Representation for Regular Expression Evolution Antonio González 1, David F. Barrero 2, David Camacho 1, María D. R-Moreno 2 Abstract Regular expressions, or simply regex,
Reduce Total Distance and Time Using Genetic Algorithm in Traveling Salesman Problem
Reduce Total Distance and Time Using Genetic Algorithm in Traveling Salesman Problem A.Aranganayaki(Research Scholar) School of Computer Science and Engineering Bharathidasan University Tamil Nadu, India