Solving the set-union knapsack problem by a novel hybrid Jaya algorithm

The set-union knapsack problem (SUKP) is a variation of the 0–1 knapsack problem (KP) in which each item is a set of elements, each item has a nonnegative value, and each element has a nonnegative weight. The weight of one item is given by the total weight of the elements in the union of the items’ sets. The SUKP accommodates a number of real-life applications and is more complicated and computationally difficult than the 0–1 KP. In this paper, we propose a novel hybrid Jaya algorithm with double coding (DHJaya) to solve the SUKP. In the DHJaya, double coding is used to represent the individual, which includes the solutions for solving the SUKP by adopting a mapping function. The Jaya algorithm and differential evolution algorithm are combined to improve the exploration ability. To enhance the exploitation ability, the Cauchy mutation is performed on some individuals. Meanwhile, an improved repairing and optimization algorithm (MS-GROA) is proposed to repair the infeasible solutions and optimize the feasible solutions. We test the DHJaya using three sets of SUKP instances to demonstrate its efficiency, and the obtained results are compared with those in the previous study. Extensive experiments show a remarkable performance of the proposed approach.

[1]  R. Rao.  Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems , 2016 .

[2]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[3]  Xizhao Wang,et al.  A novel binary artificial bee colony algorithm for the set-union knapsack problem , 2018, Future Gener. Comput. Syst..

[4]  Nan Zhang,et al.  Select N agents with better fitness values from X all to replace the current population X Evaluate and sort the fitness of X all End of iteration ? Return best solution End Mass weighting Cauchy mutation , 2016 .

[5]  Graham Kendall,et al.  An experimental study of hyper-heuristic selection and acceptance mechanism for combinatorial t-way test suite generation , 2017, Inf. Sci..

[6]  Norman Mariun,et al.  Optimal Power Flow Using the Jaya Algorithm , 2016 .

[7]  Shamkant B. Navathe,et al.  Vertical partitioning algorithms for database design , 1984, TODS.

[8]  O. Goldschmidt,et al.  Note: On the set-union knapsack problem , 1994 .

[9]  Rob Law,et al.  Cauchy mutation based on objective variable of Gaussian particle swarm optimization for parameters selection of SVM , 2011, Expert Syst. Appl..

[10]  P. Sriyanyong,et al.  Solving economic dispatch using Particle Swarm Optimization combined with Gaussian mutation , 2008, 2008 5th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology.

[11]  Thomas Bäck,et al.  Theory of Genetic Algorithms , 2001, Current Trends in Theoretical Computer Science.

[12]  Adil Baykasoglu,et al.  A swarm intelligence-based algorithm for the set-union knapsack problem , 2019, Future Gener. Comput. Syst..

[13]  X. Yao,et al.  How to control search step size in fast evolutionary programming , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[14]  Andries Petrus Engelbrecht,et al.  Binary differential evolution strategies , 2007, 2007 IEEE Congress on Evolutionary Computation.

[15]  Yves Crama,et al.  Combinatorial optimization models for production scheduling in automated manufacturing systems , 1997 .

[16]  R. Venkata Rao,et al.  Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems , 2011, Comput. Aided Des..

[17]  Michal Tzur,et al.  Minimization of tool switches for a flexible manufacturing machine with slot assignment of different tool sizes , 2004 .

[18]  Chun-Hsiung Lan,et al.  Notes on the Distinction of Gaussian and Cauchy Mutations , 2008, 2008 Eighth International Conference on Intelligent Systems Design and Applications.

[19]  Ashwin Arulselvan,et al.  A note on the set union knapsack problem , 2014, Discret. Appl. Math..

[20]  Wenbin Li,et al.  Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem , 2017, Neural Computing and Applications.

[21]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[22]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[23]  William Feller,et al.  An Introduction to Probability Theory and Its Applications, Vol. 2 , 1967 .

[24]  Millie Pant,et al.  Improving the performance of differential evolution algorithm using Cauchy mutation , 2011, Soft Comput..

[25]  N. Balakrishnan,et al.  A Primer on Statistical Distributions , 2003 .

[26]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[27]  Mohammad Hassan Moradi,et al.  Power flow analysis in islanded Micro-Grids via modeling different operational modes of DGs: A review and a new approach , 2017 .

[28]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[29]  Ryuichi Hirabayashi,et al.  OPTIMAL TOOL MODULE DESIGN PROBLEM FOR NC MACHINE TOOLS , 1984 .

[30]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[31]  Yudong Zhang,et al.  Tea Category Identification Using a Novel Fractional Fourier Entropy and Jaya Algorithm , 2016, Entropy.

[32]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[33]  Nan Zhang,et al.  Design of a fractional-order PID controller for a pumped storage unit using a gravitational search algorithm based on the Cauchy and Gaussian mutation , 2017, Inf. Sci..

[34]  Lothar M. Schmitt,et al.  Theory of genetic algorithms , 2001, Theor. Comput. Sci..

[35]  Hui Wang,et al.  Opposition-based particle swarm algorithm with cauchy mutation , 2007, 2007 IEEE Congress on Evolutionary Computation.