A probabilistic solution discovery algorithm for solving 0-1 knapsack problem. Issue 6 (2nd November 2018)

• Record Type: Journal Article
• Authors: Hu, Fangxia
• Is Part Of: International journal of parallel, emergent and distributed systems. Volume 33:Issue 6(2018)
• Page Start: 618
• Page End: 626
• Publication Date: 2018-11-02
• Subjects: Probabilistic solution discovery algorithm -- 0-1 knapsack problem -- combinational optimization -- evolutionary computation -- Monte Carlo simulation; Parallel computers -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Computer algorithms -- Periodicals; 004.35
• DOI: 10.1080/17445760.2017.1314473
• Languages: English
• ISSNs: 1744-5760

Abstract

Abstract: In this paper, a probabilistic solution discovery algorithm is developed to solve the NP-hard 0-1 knapsack problem. The proposed method consists of three steps: strategy development, strategy analysis, and solution discovery. In the first step, Monte Carlo simulation is used to generate the strategies based on a vector defining the probability that each item is included in the knapsack. In the second step, we analyse the capacity imposed by each strategy previously generated and penalise the objective value for those strategies exceeding the capacity of the knapsack. At the last step, a subset of ordered strategies is used to update the vector that defines the probability of choosing each item. Two numerical examples are used to demonstrate the efficiency and the performance of the proposed method. Graphical Abstract: Graphical representation of the probabilistic solution discovery algorithm.