An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems
The 0-1 knapsack problem is a typical NP-hard combinatorial optimization problem that is
difficult to solve efficiently based on traditional optimization approaches. Binary quantum …
difficult to solve efficiently based on traditional optimization approaches. Binary quantum …
An improved future search algorithm based on the sine cosine algorithm for function optimization problems
Y Fan, S Zhang, H Yang, D Xu, Y Wang - IEEE Access, 2023 - ieeexplore.ieee.org
Future search algorithm imitates the person living life. If one person finds that his life is not
good, he will try to change his living life, and he will imitate a more successful person. To …
good, he will try to change his living life, and he will imitate a more successful person. To …
TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problems
Abstract The discounted {0-1} knapsack problem (DKP) is an NP-hard problem that is more
challenging than the classical knapsack problem. In this paper, an enhanced version of the …
challenging than the classical knapsack problem. In this paper, an enhanced version of the …
Joint Task Offloading and Resource Allocation in Vehicular Edge Computing Networks for Emergency Logistics
R Li, D Ling, Y Wang, S Zhao… - Mathematical Problems in …, 2023 - Wiley Online Library
As a special form of multiaccess edge computing (MEC), vehicular edge computing (VEC)
plays an important role in emergency logistics by providing real‐time and low‐latency …
plays an important role in emergency logistics by providing real‐time and low‐latency …
Operation-based Greedy Algorithm for Discounted Knapsack Problem
The discounted knapsack problem (DKP) is an NP-hard combinatorial optimization problem
that has gained much attention recently. Due to its high complexity, the usual solution …
that has gained much attention recently. Due to its high complexity, the usual solution …