[PDF] Top 20 A Study on the Genetic Algorithm for Class Combination Problem

... the class as the second digit of the chromosome; ⑤Renumber the remaining classes from 0 to M  3 , and renumber them without changing their relative order; ⑥ Randomly select a number from 0 to M  3 , which ... See full document

... salesman problem ( TSP ) has been proved a non-deterministic polynomial complete ...the problem, but can find out the optimal solution of the ...optimization algorithm has been arisen to solve the ... See full document

... salesman problem (TSP) is the most well-known optimization ...use genetic algorithm to solve TSP because of its robustness and flexibility ... See full document

... computational study conducted with different metaheu- ristic approaches including four different GA implement- ...their study falls short in the consisten- cy and coherence of the conducted experiments in ... See full document

... Neighbor algorithm was one of the first algorithms used to find a solution for the travelling salesman ...this problem, the salesman starts in a random city and repeatedly visits the nearest city until all ... See full document

... Abstract— Genetic algorithm (GA) is a design technique that synthesizes an application specific Network-on-chip (NoC) topology and routes the communication traces on the interconnection ...paper ... See full document

... some researchers study the pre-marshalling process in a yard. Lee and Chao [4] proposed a developed model for planning the moving of containers at bay. The heuristic proposed comprised a neighborhood search ... See full document

... interesting problem to be ...this study is proposed using an adaptive genetic algorithm that proved able to acquire efficient and promising result than the classical genetic ...the ... See full document

... this study, an optimization model, consisting of a multi-objective genetic algorithm, ε-NSGA-II, in combination with the Soil Water and Assessment Tool (SWAT) and the parallel computation ... See full document

... the study is to minimize different objectives such as earliness, tardiness and work in ...mathematical problem is considered as NP-Hard and the optimal solution is available for small scale ...a ... See full document

... The problem under study is NP-hard even without consideration of the learning effect, aging effect and multi-maintenance ...therefore genetic algorithm and the imperialist competitive ... See full document

... The algorithm solves each one of the instances with a maximum number of 1,000 schedules, computed as terminating ...To study the performance of the algorithm different problem set instances ... See full document

... time, class, room and the amount of memorization material that is held with the availability of existing religious ...applies genetic algorithms to solve optimization problems in scheduling the memorization ... See full document

... - Genetic algorithms and their hybrid schemes have shown a great efficacy in solving large scale combinatorial problems in which solutions are highly ...hybridised Genetic Algorithm with Tabu Search ... See full document

... this study is to propose a new representation method of chromosomes using binary matrix and new fittest criteria to be used as method for finding the optimal solution for TS ...from genetic algorithm ... See full document

... These genetic algorithms are comparatively fresh examples in the field of artificial intelligence, which work on the typical principles of natural ...of Genetic Algorithms has pushed them as one of the most ... See full document

... routing problem (VRP) is a generic name given to a whole class of problem involving the visiting of customer by ...The problem involved a fleet of vehicles tour each beginning and ending at ... See full document

... Hybrid genetic algorithms that can incorporate local search techniques in conjunction with the genetic algo- rithms were created in order to improve the performance of genetic ...the problem ... See full document

... GA class of probabilistic optimization algorithm. A genetic algorithm (GA) is a search techniques used in computing to find true or approximate solution to optimization and search ... See full document

... Routing Problem (VRP) is a classic combinatorial optimization problem of great scientific interest in the field of Operations Research due to its high economic impact and its difficulty to be ...the ... See full document