24 articles for “Crossover”

Set a search alert

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 PDF Cite

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,064 accessesView PDF Cite

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,719 accessesView PDF Cite

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,723 accessesView PDF Cite