A modified flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making
- 572 Downloads
In this paper, a new modified version of the flower pollination algorithm based on the crossover for solving the multidimensional knapsack problems called (MFPA) is proposed. MFPA uses the sigmoid function as a discretization method to deal with the discrete search space. The penalty function is added to the evaluation function to recognize the infeasible solutions and assess them. A two-stage procedure is called FRIO is used to treat the infeasible solutions. MFPA uses an elimination procedure to decrease any duplication in the population in order to increase the diversity. The proposed algorithm is verified on a set of benchmark instances, and a comparison with other algorithms available in literature is shown. Several statistical and descriptive analysis was done such as recoding the results of the best, mean, worst, standard deviation, success rate, and time to prove the effectiveness and robustness of MFPA. The empirical results show that the proposed algorithm can be an effective algorithm as human-centric decision-making model for solving the multidimensional knapsack problems.
KeywordsFlower pollination Sigmoid function Crossover Multidimensional knapsack Penalty function
Compliance with ethical standards
Conflict of interest
All authors declare that they have no conflict of interest.
Human participants or animals
This article does not contain any studies with human participants or animals performed by any of the authors.
Informed consent was obtained from all individual participants included in the study.
- Beasley JE (2005) ORLib—operations research library. http://people.brunel.ac.uk/_mastjjb/jeb/orlib/mknapinfo.html
- Carlos BP et al (2010) A solution to multidimensional knapsack problem using a parallel genetic algorithm. Int J Intell Inf Process 1(2):47–54Google Scholar
- Güler A, Berberler ME, Nuriyev U (2016) A new genetic algorithm for the 0–1 knapsack problem. Acad Platf J Eng Sci 4(3):9–14Google Scholar
- Hembecker F, Lopes HS, Godoy W Jr (2007) Particle swarm optimization for the multidimensional knapsack problem. In: International conference on adaptive and natural computing algorithms. Springer, BerlinGoogle Scholar
- Kong M, Tian P (2006) Apply the particle swarm optimization to the multidimensional knapsack problem. In: International conference on artificial intelligence and soft computing. Springer, BerlinGoogle Scholar
- Labed S, Gherboudj A, Chikhi S (2011) A modified hybrid particle swarm optimization algorithm for multidimensional knapsack problem. Int J Comput Appl 34(2):1Google Scholar
- Layeb A, Boussalia SR (2012) A novel quantum inspired cuckoo search algorithm for bin packing problem. Int J Inf Technol Comput Sci (IJITCS) 4(5):58Google Scholar
- Ratanavilisagul C, Kruatrachue AB (2014) A modified particle swarm optimization with mutation and reposition. Int J Innov Comput Inform Control 10(6):2127–2142Google Scholar
- Yang, X-S (2012) Flower pollination algorithm for global optimization. In: International conference on unconventional computing and natural computation. Springer, BerlinGoogle Scholar
- Zan D, Jaros J (2014) Solving the multidimensional knapsack problem using a CUDA accelerated PSO. In: 2014 IEEE congress on evolutionary computation (CEC). IEEEGoogle Scholar