scholarly journals Quantum-Inspired Differential Evolution with Grey Wolf Optimizer for 0-1 Knapsack Problem

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1233
Author(s):  
Yule Wang ◽  
Wanliang Wang
Keyword(s):  
Differential Evolution ◽  
Knapsack Problem ◽  
Optimization Problems ◽  
Differential Evolution Algorithm ◽  
Knapsack Problems ◽  
High Dimensional ◽  
Adaptive Mutation ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Combinatorial Optimization Problems

The knapsack problem is one of the most widely researched NP-complete combinatorial optimization problems and has numerous practical applications. This paper proposes a quantum-inspired differential evolution algorithm with grey wolf optimizer (QDGWO) to enhance the diversity and convergence performance and improve the performance in high-dimensional cases for 0-1 knapsack problems. The proposed algorithm adopts quantum computing principles such as quantum superposition states and quantum gates. It also uses adaptive mutation operations of differential evolution, crossover operations of differential evolution, and quantum observation to generate new solutions as trial individuals. Selection operations are used to determine the better solutions between the stored individuals and the trial individuals created by mutation and crossover operations. In the event that the trial individuals are worse than the current individuals, the adaptive grey wolf optimizer and quantum rotation gate are used to preserve the diversity of the population as well as speed up the search for the global optimal solution. The experimental results for 0-1 knapsack problems confirm the advantages of QDGWO with the effectiveness and global search capability for knapsack problems, especially for high-dimensional situations.

scholarly journals Differential Evolution with Novel Mutation and Adaptive Crossover Strategies for Solving Large Scale Global Optimization Problems

2017 ◽  
Vol 2017 ◽  
pp. 1-18 ◽  
Author(s):  
Ali Wagdy Mohamed ◽  
Abdulaziz S. Almazyad
Keyword(s):  
Global Optimization ◽  
Differential Evolution ◽  
Large Scale ◽  
Optimization Problems ◽  
Differential Evolution Algorithm ◽  
High Dimensional ◽  
Gradual Change ◽  
Comparison Results ◽  
Mutation Strategy ◽  
Common Trade

This paper presents Differential Evolution algorithm for solving high-dimensional optimization problems over continuous space. The proposed algorithm, namely, ANDE, introduces a new triangular mutation rule based on the convex combination vector of the triplet defined by the three randomly chosen vectors and the difference vectors between the best, better, and the worst individuals among the three randomly selected vectors. The mutation rule is combined with the basic mutation strategy DE/rand/1/bin, where the new triangular mutation rule is applied with the probability of 2/3 since it has both exploration ability and exploitation tendency. Furthermore, we propose a novel self-adaptive scheme for gradual change of the values of the crossover rate that can excellently benefit from the past experience of the individuals in the search space during evolution process which in turn can considerably balance the common trade-off between the population diversity and convergence speed. The proposed algorithm has been evaluated on the 20 standard high-dimensional benchmark numerical optimization problems for the IEEE CEC-2010 Special Session and Competition on Large Scale Global Optimization. The comparison results between ANDE and its versions and the other seven state-of-the-art evolutionary algorithms that were all tested on this test suite indicate that the proposed algorithm and its two versions are highly competitive algorithms for solving large scale global optimization problems.

scholarly journals On the Binarization of Grey Wolf Optimizer‎: ‎A Novel Binary Optimizer Algorithm

2021 ◽  
Author(s):  
Mehdy Roayaei
Keyword(s):  
Combinatorial Optimization ◽  
Real World ◽  
Optimization Problems ◽  
Population Based ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Combinatorial Optimization Problems ◽  
Hunting Behaviour ◽  
Set Operations

Abstract ‎Grey Wolf Optimizer (GWO) is a population-based evolutionary algorithm inspired by the hunting behaviour of grey wolves‎. ‎GWO‎, ‎in its basic form‎, ‎is a real coded algorithm‎, ‎therefore‎, ‎it needs modifications to deal with binary optimization problems‎. ‎In this paper‎, ‎we review previous works on binarization of GWO‎, ‎and classify them with respect to their encoding scheme‎, ‎updating strategy‎, ‎and transfer function‎. ‎Then‎, ‎we propose a novel binary GWO algorithm (named SetGWO)‎, ‎which is based on set encoding and uses set operations in its updating strategy‎. ‎Experimental results on different real-world combinatorial optimization problems and different datasets‎, ‎show that SetGWO outperforms other existing binary GWO algorithms in terms of quality of solutions‎, ‎running time‎, ‎and scalability‎.

scholarly journals Dichotomous Binary Differential Evolution for Knapsack Problems

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Hu Peng ◽  
Zhijian Wu ◽  
Peng Shao ◽  
Changshou Deng
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
State Of The Art ◽  
Experimental Studies ◽  
Continuous Optimization ◽  
Knapsack Problems ◽  
Binary Particle Swarm Optimization ◽  
Combinatorial Optimization Problems ◽  
Multidimensional Knapsack ◽  
Binary Differential Evolution

Differential evolution (DE) is one of the most popular and powerful evolutionary algorithms for the real-parameter global continuous optimization problems. However, how to adapt into combinatorial optimization problems without sacrificing the original evolution mechanism of DE is harder work to the researchers to design an efficient binary differential evolution (BDE). To tackle this problem, this paper presents a novel BDE based on dichotomous mechanism for knapsack problems, called DBDE, in which two new proposed methods (i.e., dichotomous mutation and dichotomous crossover) are employed. DBDE almost has any difference with original DE and no additional module or computation has been introduced. The experimental studies have been conducted on a suite of 0-1 knapsack problems and multidimensional knapsack problems. Experimental results have verified the quality and effectiveness of DBDE. Comparison with three state-of-the-art BDE variants and other two state-of-the-art binary particle swarm optimization (PSO) algorithms has proved that DBDE is a new competitive algorithm.

scholarly journals ACO with Intuitionistic Fuzzy Pheromone Updating Applied on Multiple-Constraint Knapsack Problem

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1456
Author(s):  
Stefka Fidanova ◽  
Krassimir Todorov Atanassov
Keyword(s):  
Decision Making ◽  
Knapsack Problem ◽  
Propositional Logic ◽  
Optimization Problems ◽  
Real Life ◽  
Combinatorial Optimization Problems ◽  
Intuitionistic Fuzzy ◽  
Life Problems ◽  
Multiple Constraint

Some of industrial and real life problems are difficult to be solved by traditional methods, because they need exponential number of calculations. As an example, we can mention decision-making problems. They can be defined as optimization problems. Ant Colony Optimization (ACO) is between the best methods, that solves combinatorial optimization problems. The method mimics behavior of the ants in the nature, when they look for a food. One of the algorithm parameters is called pheromone, and it is updated every iteration according quality of the achieved solutions. The intuitionistic fuzzy (propositional) logic was introduced as an extension of Zadeh’s fuzzy logic. In it, each proposition is estimated by two values: degree of validity and degree of non-validity. In this paper, we propose two variants of intuitionistic fuzzy pheromone updating. We apply our ideas on Multiple-Constraint Knapsack Problem (MKP) and compare achieved results with traditional ACO.

scholarly journals Research on the inverse kinematics of manipulator using an improved self-adaptive mutation differential evolution algorithm

2021 ◽  
Vol 18 (3) ◽  
pp. 172988142110144
Author(s):  
Qianqian Zhang ◽  
Daqing Wang ◽  
Lifu Gao
Keyword(s):  
Differential Evolution ◽  
Objective Function ◽  
Inverse Kinematics ◽  
Differential Evolution Algorithm ◽  
Weight Coefficient ◽  
Adaptive Mutation ◽  
Feasible Region ◽  
Serial Manipulators ◽  
De Algorithm ◽  
Self Adaptive

To assess the inverse kinematics (IK) of multiple degree-of-freedom (DOF) serial manipulators, this article proposes a method for solving the IK of manipulators using an improved self-adaptive mutation differential evolution (DE) algorithm. First, based on the self-adaptive DE algorithm, a new adaptive mutation operator and adaptive scaling factor are proposed to change the control parameters and differential strategy of the DE algorithm. Then, an error-related weight coefficient of the objective function is proposed to balance the weight of the position error and orientation error in the objective function. Finally, the proposed method is verified by the benchmark function, the 6-DOF and 7-DOF serial manipulator model. Experimental results show that the improvement of the algorithm and improved objective function can significantly improve the accuracy of the IK. For the specified points and random points in the feasible region, the proportion of accuracy meeting the specified requirements is increased by 22.5% and 28.7%, respectively.

Sign in / Sign up

Export Citation Format

Share Document