Meta-heuristics have been deployed to solve many hard combinatorial and optimization problems. Parameterization of meta-heuristics is an important challenging aspect of meta-heuristic use since many of the features of these algorithms can not be explained theoretically. Experiences with Genetic Algorithms (GA) applied to Multidimensional Knapsack Problems (MKP) have shown that this class of algorithm is very sensitive to parameterization. Many studies use standard test problems, which provide a firm basis for study comparisons but ignore the effect of problem correlation structure. This thesis applies GA to MKP. A new random repair operator, which projects infeasible solutions into feasible region, is proposed. This GA application is tested with synthetic test problems, which map possible correlation structures as well as possible slackness settings. Effect of correlation structure on solution quality found both statistically and practically significant. Depending on the Response Surface Methodology design, proposed is a GA parameter setting which is robust in both solution quality and computation time.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 84. Codice articolo 18393274304
Quantità: 4 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. Print on Demand pp. 84. Codice articolo 26393274314
Quantità: 4 disponibili
Da: Mispah books, Redhill, SURRE, Regno Unito
Paperback. Condizione: Like New. Like New. book. Codice articolo ERICA79612495937786
Quantità: 1 disponibili