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

9 results for “crossover operator”
Set a search alert
Research ArticleOpen accessIn the keywordsSolving 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,584 accessesView PDFCite
Research ArticleOpen accessIn the keywordsPerformance Analysis of Multi Clustered Parallel Genetic Algorithm with Gray ValueP. Vishnu Raja, V. Murali BhaskaranProblem statement: Encoding is one of the major factors in genetic algorithms, for a complex problem the optimality for the problem is determined. The encoding mechanism is the initial step which forms the chromosome to form the best fit individuals in the entire population. The proposed method tries to encode the initial population by the binary encoding and by gray … …American Journal of Applied Sciences, Vol. 9, Issue 8 · 28 Jun 2012 · 7,163 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Improved Clustering Based Genetic Algorithm for Solving Complex NP ProblemsR. Sivaraj, T. RavichandranProblem statement: The selection process is a major factor in genetic algorithm which determines the optimality of solution for a complex problem. The selection pressure is the critical step which finds out the best individuals in the entire population for further genetic operators. The proposed algorithm tries to find out the best individuals with reduced selection pressure than standard genetic … …Journal of Computer Science, Vol. 7, Issue 7 · 28 Jun 2011 · 6,928 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,586 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Optimization of Design for S4-Duty Induction Motor Using Constraints Normalization Based Violation TechniqueR. Subramanian, S. N. Sivanandam, C. VimalaraniProblem statement: Design of Induction motors is an engineering art and needs an extensive experience for obtaining an optimal design solution for a given design problem. An optimized GD2 value for the development of S4 Duty, cage induction motor to meet the specifications of a particular designated application (the location of application is kept as trade secret due to IP … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,057 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time WindowsH. Nazif, L.S. LeeProblem statement: In this study, we considered the application of a genetic algorithm to vehicle routing problem with time windows where a set of vehicles with limits on capacity and travel time are available to service a set of customers with demands and earliest and latest time for serving. The objective is to find routes for the vehicles to service … …American Journal of Applied Sciences, Vol. 7, Issue 1 · 31 Jan 2010 · 8,975 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Improved Genetic Algorithm Based on Adaptive Repair Operator for Solving the Knapsack ProblemSunanda Gupta, M. L. GargProblem statement: Knapsack problem is a typical NP complete problem. During last few decades, Knapsack problem has been studied through different approaches, according to the theoretical development of combinatorial optimization. Approach: In this study, modified evolutionary algorithm was presented for 0/1 knapsack problem. Results: A new objective_func_evaluation operator was proposed which employed adaptive repair function named as repair and elitism … …Journal of Computer Science, Vol. 5, Issue 8 · 31 Aug 2009 · 7,713 accessesView PDFCite
Research ArticleOpen accessIn the abstractExperimental Comparison Between Evolutionary Algorithm and Barycenter Heuristic for the Bipartite Drawing ProblemZoheir EzzianeThis research investigates the use of intelligent techniques for the bipartite drawing problem (BDP). Due to the combinatorial nature of the solution space, the use of traditional search methods lead to exponential time. Hence, the aim of this paper is to speed up the search time when solving the BDP through the use of Evolutionary Algorithms (EAs) and Barycenter Heuristic … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,716 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordFeature Selection in Data-Mining for Genetics Using Genetic AlgorithmV. N. Rajavarman, S. P. RajagopalanWe discovered genetic features and environmental factors which were involved in multifactorial diseases. To exploit the massive data obtained from the experiments conducted at the General Hospital, Chennai, data mining tools were required and we proposed a 2-Phase approach using a specific genetic algorithm. This heuristic approach had been chosen as the number of features to consider was large (upto … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,627 accessesView PDFCite