Adaptive genetic algorithm and quasi-parallel genetic algorithm: application to knapsack problem

Authors:
Kwok Yip Szeto;Jian Zhang
Affiliations:
Department of Physics, Hong Kong University of Science and Technology, Hong Kong SAR, China;Department of Physics, Hong Kong University of Science and Technology, Hong Kong SAR, China
Venue:
LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
Year:
2005

Citing 5
Cited 6

A note on the performance of genetic algorithms on zero-one knapsack problems

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Quasi-Parallel Realization of the Investment Frontier in Computer Resource Allocation Using Simple Genetic Algorithm on a Single Computer

PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
How Adaptive Agents in Stock Market Perform in the Presence of Random News: A Genetic Algorithm Approach

IDEAL '00 Proceedings of the Second International Conference on Intelligent Data Engineering and Automated Learning, Data Mining, Financial Engineering, and Intelligent Agents
An application of adaptive genetic algorithm in financial knapsack problem

IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence

Self-adaptive Mutation Only Genetic Algorithm: An Application on the Optimization of Airport Capacity Utilization

IDEAL '08 Proceedings of the 9th International Conference on Intelligent Data Engineering and Automated Learning
Adaptive genetic algorithm with mutation and crossover matrices

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Efficient search of winning strategies in multi-agent systems on random network: importance of local solidarity

IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Sales potential optimization on directed social networks: a quasi-parallel genetic algorithm approach

EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
Spatial and temporal resource allocation for adaptive parallel genetic algorithm

UC'07 Proceedings of the 6th international conference on Unconventional Computation
Topological effects on the performance of island model of parallel genetic algorithm

IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new adaptive genetic algorithm using mutation matrix is introduced and implemented in a single computer using the quasi-parallel time sharing algorithm for the solution of the zero/one knapsack problem. The mutation matrix M(t) is constructed using the locus statistics and the fitness distribution in a population A(t) with N rows and L columns, where N is the size of the population and L is the length of the encoded chromosomes. The mutation matrix is parameter free and adaptive as it is time dependent and captures the accumulated information in the past generation. Two strategies of evolution, mutation by row (chromosome), and mutation by column (locus) are discussed. Time sharing experiment on these two strategies is performed on a single computer for solving the knapsack problem. Based on the investment frontier of time allocation, the optimal configuration for solving the knapsack problem is found.