Genetic algorithm based on the orthogonal design for multidimensional knapsack problems

Authors:
Hong Li;Yong-Chang Jiao;Li Zhang;Ze-Wei Gu
Affiliations:
National Laboratory of Antennas and Microwave Technology, Xidian University, Xi'an, Shaanxi, China;National Laboratory of Antennas and Microwave Technology, Xidian University, Xi'an, Shaanxi, China;School of Science, Xidian University, Xi'an, Shaanxi, China;School of Science, Xidian University, Xi'an, Shaanxi, China
Venue:
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
Year:
2006

Citing 4
Cited 4

An orthogonal genetic algorithm for multimedia multicast routing

IEEE Transactions on Evolutionary Computation
An orthogonal genetic algorithm with quantization for globalnumerical optimization

IEEE Transactions on Evolutionary Computation
Hybrid Taguchi-genetic algorithm for global numerical optimization

IEEE Transactions on Evolutionary Computation
Intelligent evolutionary algorithms for large parameter optimization problems

IEEE Transactions on Evolutionary Computation

A Chaotic Neural Network Combined Heuristic Strategy for Multidimensional Knapsack Problem

ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Solving multidimensional 0---1 knapsack problem with an artificial fish swarm algorithm

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems

Journal of Global Optimization
Essential Particle Swarm Optimization queen with Tabu Search for MKP resolution

Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a genetic algorithm based on the orthogonal design for solving the multidimensional knapsack problems is proposed. The orthogonal design with the factor analysis, an experimental design method, is applied to the genetic algorithm, to make the algorithm be more robust, statistically sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a small, but representative sample of points as offspring. After all of the better genes of these offspring are selected, an optimal offspring better than its parents is then generated in the end. Moreover, a check-and-repair operator is adopted to make the infeasible chromosomes generated by the crossover and mutation operators feasible, and make the feasible chromosomes better. The simulation results show that the proposed algorithm can find optimal or close-to-optimal solutions with less computation burden.