Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
Using Optimal Dependency-Trees for Combinational Optimization
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Design and Analysis of Experiments
Design and Analysis of Experiments
A new ant colony optimization algorithm for the multidimensional Knapsack problem
Computers and Operations Research
An ant colony optimization approach for the multidimensional knapsack problem
Journal of Heuristics
Solving system-level synthesis problem by a multi-objective estimation of distribution algorithm
Expert Systems with Applications: An International Journal
Hi-index | 12.06 |
In this paper, an effective hybrid algorithm based on estimation of distribution algorithm (EDA) is proposed to solve the multidimensional knapsack problem (MKP). With the framework of EDA, the probability model is built with the superior population and the new individuals are generated based on probability model. In addition, an updating mechanism of the probability model is proposed and a mechanism for initializing the probability model based on the specific knowledge of the MKP is also proposed to improve the convergence speed. Meanwhile, an adaptive local search is proposed to enhance the exploitation ability. Furthermore, the influences of parameters are investigated based on Taguchi method of design of experiment and the importance of repair operator is also studied via simulation testing and comparisons. Finally, numerical simulation is carried out based on the benchmark instances, and the comparisons with some existing algorithms demonstrate the effectiveness of the proposed algorithm.