抄録
Genetic Algorithms (GA) includes generally three genetic operators, selection, crossover and mutation. The lack of dependence on function gradients makes it more suitable to such problems, like as discrete optimization design problems and optimization design problems with nonconvexities or disjointness in design space. The method is tried to apply to the Airline-Networks Scheduling in this paper. The results suggest that GA is more effective for large size networks.
