.png){kind=icon}
.png){kind=icon}
Return
Guided genetic algorithm for the multidimensional knapsack problem
.png){kind=icon}
OA
AI
DOI：10.1007/s12293-017-0232-7.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Genetic Algorithm (GA) has emerged as a powerful method for solving a wide range of combinatorial optimisation problems in many fields. This paper presents a hybrid heuristic approach named Guided Genetic Algorithm (GGA) for solving the Multidimensional Knapsack Problem (MKP). GGA is a two-step memetic algorithm composed of a data pre-analysis and a modified GA. The pre-analysis of the problem data is performed using an efficiency-based method to extract useful information. This prior knowledge is integrated as a guide in a GA at two stages: to generate the initial population and to evaluate the produced offspring by the fitness function. Extensive experimentation was carried out to examine GGA on the MKP. The main GGA parameters were tuned and a comparative study with other methods was conducted on well-known MKP data. The real impact of GGA was checked by a statistical analysis using ANOVA, t-test and Welch's t-test. The obtained results showed that the proposed approach largely improved standard GA and was highly competitive with other optimisation methods.
Keywords:
Genetic algorithm
Hybrid heuristic
Memetic algorithm
Multidimensional knapsack problem
Core concept
Guided genetic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.3
Papers:
453
Citations:
718