Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

99 articles for “genetic algorithm method”
Set a search alert
Also matching:1 special issue
Research ArticleOpen accessIn the abstractOptimization of Clustering Time by a Group of Autonomous Robots Making Use of an Exclusive Multi-MarkingMohamed Rida Abdessemed, Kamel Khoualdi, Azeddine BilamiProblem statement: For solving complex issues, the current tendency goes towards the swarms behaviors, realized on a basis of collective interactions, which results from a cooperative work favoring exchanges between individuals of a same group at microscopic level and allowing the emergence of complex collective behaviors at macroscopic level. Many models were inspired by these attitudes to find simple rules, … …Journal of Computer Science, Vol. 6, Issue 12 · 9 Nov 2010 · 6,892 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Design Framework for End-of-Life Vehicles Recovery: Optimization of Disassembly Sequence Using Genetic AlgorithmsT. F. Go, D. A. Wahab, M.N. Ab. Rahman, R. RamliProblem statement: It is expected that over the next few years type approval legislation and public awareness will force vehicle manufacturers to identify recovery methods during the design process in order to achieve reuse and recycling targets. Current vehicle design in Malaysia does not sufficiently aid the economic recovery of parts and materials to reach these targets. Approach: This study … …American Journal of Environmental Sciences, Vol. 6, Issue 4 · 31 Aug 2010 · 7,325 accessesView PDFCite
Research ArticleOpen accessIn the abstractSummarizing Relational Data Using Semi-Supervised Genetic Algorithm-Based Clustering TechniquesRayner AlfredProblem statement: In solving a classification problem in relational data mining, traditional methods, for example, the C4.5 and its variants, usually require data transformations from datasets stored in multiple tables into a single table. Unfortunately, we may loss some information when we join tables with a high degree of one-to-many association. Therefore, data transformation becomes a tedious trial-and-error work and … …Journal of Computer Science, Vol. 6, Issue 7 · 31 Jul 2010 · 7,588 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Modified Partially Mapped MultiCrossover Genetic Algorithm for Two-Dimensional Bin Packing ProblemM. Sarabian, L.S. LeeProblem statement: Non-oriented case of Two-Dimensional Rectangular Bin Packing Problem (2DRBPP) was studied in this study. The objective of this problem was to pack a given set of small rectangles, which may be rotated by 90°, without overlaps into a minimum numbers of identical large rectangles. Our aim was to improve the performance of the MultiCrossover Genetic Algorithm (MXGA) proposed … …Journal of Mathematics and Statistics, Vol. 6, Issue 2 · 30 Jun 2010 · 8,591 accessesView PDFCite
Research ArticleOpen accessIn the abstractFractal Images Compressing by Estimating the Closest Neighborhood with Using of Schema TheoryMahdi Jampour, Mahdi Yaghoobi, Maryam AshourzadehProblem statement: One of the methods used for compressing images and especially natural images is by benefiting from fractal features of images. Natural images have properties like Self-Similarity that can be used in image compressing. The basic approach in compressing methods is based on the fractal features and searching the best replacement block for the original image. Approach: In this … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 6,902 accessesView PDFCite
Research ArticleOpen accessIn the abstractCalculation of Total Cost, Tolerance Based on Taguchi's, Asymmetric Quality Loss Function ApproachR. Sampath Kumar, N. Alagumurthi, R. RameshProblem statement: Current world market force the manufacturing sectors to develop high quality product and process design with minimum possible cost. About 80% of problems in production units may be attributed to 20% of design tolerance causes. While design typically represents the smallest actual cost elements in products (around 5%), it leverages the largest cost influence (around 70%). So design … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 8,052 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimizing Feature Construction Process for Dynamic Aggregation of Relational AttributesRayner AlfredProblem statement: The importance of input representation has been recognized already in machine learning. Feature construction is one of the methods used to generate relevant features for learning data. This study addressed the question whether or not the descriptive accuracy of the DARA algorithm benefits from the feature construction process. In other words, this paper discusses the application of genetic … …Journal of Computer Science, Vol. 5, Issue 11 · 30 Nov 2009 · 6,935 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Genetic Algorithm for the Segmentation of Known Touching ObjectsEdgar Scavino, Dzuraidah Abdul Wahab, Hassan Basri et al.Problem statement: Segmentation is the first and fundamental step in the process of computer vision and object classification. However, complicate or similar colour pattern add complexity to the segmentation of touching objects. The objective of this study was to develop a robust technique for the automatic segmentation and classification of touching plastic bottles, whose features were previously stored in a … …Journal of Computer Science, Vol. 5, Issue 10 · 31 Oct 2009 · 7,128 accessesView PDFCite
Research ArticleOpen accessIn the abstractSolving the Traveling Salesman Problem Using New Operators in Genetic AlgorithmsNaef Taher Al Rahedi, Jalal AtoumProblem statement: Genetic Algorithms (GAs) have been used as search algorithms to find near-optimal solutions for many NP problems. GAs require effective chromosome representations as well as carefully designed crossover and mutation operators to achieve an efficient search. The Traveling Salesman Problem (TSP), as an NP search problem, involves finding the shortest Hamiltonian Path or Cycle in a graph of … …American Journal of Applied Sciences, Vol. 6, Issue 8 · 31 Aug 2009 · 7,589 accessesView PDFCite
Research ArticleOpen accessIn the abstractA GA Based Transmission Network Expansion Planning Considering Voltage Level, Network Losses and Number of Bundle LinesS. Jalilzadeh, H. Shayeghi, M. Mahdavi, H. HadadianTransmission Network Expansion Planning (TNEP) was studied considering voltage level, network losses and number of bundle lines using decimal codification based genetic algorithm (DCGA). TNEP determines the characteristic and performance of the future electric power network and directly influences the operation of power system. Up till now, various methods have been presented for the solution of the Static Transmission Network … …American Journal of Applied Sciences, Vol. 6, Issue 5 · 31 May 2009 · 7,588 accessesView PDFCite