Fitness-Based Acceleration Coefficients Binary Particle Swarm Optimization (FACBPSO) to Solve the Discounted Knapsack Problem
نویسندگان
چکیده
The discounted {0-1} knapsack problem (D{0-1}KP) is a multi-constrained optimization and an extended form of the 0-1 problem. DKP composed set item batches where each batch has three items objective to maximize profit by selecting at most one from batch. Therefore, D{0-1}KP complex found many applications in real economic problems other areas concept promotional discounts exists. As belongs binary class problem, so novel particle swarm variant with modifications proposed this paper. acceleration coefficients are important parameters algorithm that keep balance between exploration exploitation. In conventional (BPSO), remain same iteration, whereas variant, fitness-based coefficient (FACBPSO), values based on fitness particle. This modification enforces least fit particles move fast best accordingly, which accelerates convergence speed reduces computing time. Experiments were conducted four instances having 10 datasets instance results FACBPSO compared BPSO new exact using greedy repair strategy. demonstrate outperforms PSO-GRDKP solving D{0-1}KP, improved feasible solution
منابع مشابه
Particle Swarm Optimization for the Multidimensional Knapsack Problem
The multidimensional knapsack problem (MKP) is a combinatorial optimization problem belonging to the class of NP-hard problems. This study proposes a novel self-adaptive check and repair operator (SACRO) combined with particle swarm optimization (PSO) to solve the MKP. The traditional check and repair operator (CRO) uses a unique pseudo-utility ratio, whereas SACRO dynamically and automatically...
متن کاملExperimental Parameter Investigations on Particle Swarm Optimization Acceleration Coefficients
Particle swarm optimization (PSO) is one of the most successful optimization techniques of swarm intelligence and has been fast developed in recent years. However, the performance of PSO is significantly depended on the acceleration coefficients c1 and c2 which control the exploration and convergence abilities. Parameters c1 and c2 are the “self-cognitive” coefficient and “social-influence” coe...
متن کاملA Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کاملFitness-distance-ratio based particle swarm optimization
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. The proposed new algorithm moves particles towards nearby particles of higher fitness, instead of attracting each particle towards just the best position discovered so far by any particle. This is accomplished by usin...
متن کاملSolve Traveling Salesman Problem Using Particle Swarm Optimization Algorithm
The traveling salesman problem (TSP) is one of the most widely studied NP-hard combinatorial optimization problems and traditional genetic algorithm trapped into the local minimum easily for solving this problem. Particle Swarm Optimization (PSO) algorithm was developed under the inspiration of behavior laws of bird flocks, fish schools and human communities. Compared with the genetic algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2022
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym14061208