[PDF] Top 20 On Some Basic Concepts of Genetic Algorithms as a Meta Heuristic Method for Solving of Optimization Problems

... The tournament selection is another form of selection. In tournament selection on randomly generated subsets of the N units (N is the predetermined number), then in each subset, the principle of the tournament, selects ... See full document

... in solving the optimization ...the meta-heuristic methods, with the more famous on being the use of genetic ...combination algorithms in the web-based ALB ...the ... See full document

... size problems proposed for genetic algorithm, satisfactory responses were reached compared with the optimal solution showing a slight error ...the solving time, while the computational time in the ... See full document

... FJSSP, meta-heuristic approaches have been widely utilized to solve ...difficult optimization problems like scheduling and routing ...applying some operators in the solution depending ... See full document

... combinatorial optimization problems that, in many firms have done various researches in order to devote some facilities to some ...of optimization problems observed in many ... See full document

... All optimization algorithms so far developed can be classified into either deterministic or ...Deterministic algorithms tend to use gradient technique and find greater use in solving unimodal ... See full document

... constraint method by GAMS softwareand two meta heuristic algorithms, then the answers were all compared with each ...regard some studies in this field are as follow; Naso et ...proposed ... See full document

... routing problems have to be solved to achieve high throughput communication in a wide variety of network problems such as K shortest- paths [12], constrained shortest-path [13], multi-objective shortest ... See full document

... and basic variants of VRP are Capacitated Vehicle Routing Problem (CVRP), VRP with time windows (VRPTW), Open VRP (OVRP), Multi Depot Vehicle Routing Problem (MDVRP) and VRP with pickup and delivery ...using ... See full document

... SIs algorithms, there are some other meta-heuristics algorithms that are inspired natural processes and events such as simulated annealing (SA) algorithm and Tabu search ...chain ... See full document

... ICA method to explore the solution space in order to find the optimal schedule, the obtained solutions of this approach is more meticulous and better than other ... See full document

... networks. Some major advantages of integrated DGs include reducing power losses, improving voltage profiles, reducing emission impacts and improving power ... See full document

... multiplier method deals with two separate variables at the same time, and ADMM alternates the variables, which is the origin of the algorithm ...for solving the problem of having separate variables because ... See full document

... IEEE 30 bus system contains 6 generator buses (bus numbers: 1,2,5,8,11 13), 24 load buses (bus numbers:3, 4, 6, 7, 9,10,12,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30) and 41 transmission lines including 4 ... See full document

... TSP Solving using Heuristic Method Many important studies have discussed about heuristic algorithms applicable in TSP, which are able to produce TSP solutions nearer to optimal in ... See full document

... based meta-heurstics ...These algorithms either make recombination of multiple solutions or change each through the strategy assumed to enforce exploration and exploitation of the search area [7] ...These ... See full document

... descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings,” in Inherently Parallel Algorithms in Feasibility and Optimization and Their ... See full document

... The machine allocation problems have been extensively researched over the years, and many findings and contributions have been reported. Nevertheless hitherto, all the studies on machine allocation problem are ... See full document

... scheduling problems for different 'm' machine and 'n' job ...on solving the scheduling problems discusses the upper bound and lower bound of the objective function when applied by any of the ...are ... See full document

... The optimization process involves finding a single or a series of optimal solutions from among a very large number of ...of optimization problems (Dhar & Stein, ... See full document