Complexity, 2023 In this paper, a binary variant of a novel nature-inspired metaheuristic algorithm called the nutcracker optimization algorithm (NOA) is presented for binary optimization problems.
Mohamed Abdel-Basset +3 more
doaj +1 more source
Enhanced Group Theory-Based Optimization Algorithm for Solving Discounted {0-1} Knapsack Problem [PDF]
Jisuanji kexue yu tansuoThe group theory-based optimization algorithm (GTOA) is a discrete evolutionary algorithm designed by group theory methods, which is very suitable for solving combinatorial optimization problems with integer vectors as feasible solutions.
ZHANG Hansong, HE Yichao, WANG Jinghong, SUN Fei, LI Mingliang
doaj +1 more source
A Comparison of GAs Penalizing Infeasible Solutions and Repairing Infeasible Solutions on the 0-1 Knapsack Problem [PDF]
, 2008 Constraints exist in almost every optimization problem. Different constraint handling techniques have been incorporated with genetic algorithms (GAs), however most of current studies are based on computer experiments.
He, Jun, Yao, Xin, Zhou, Yuren
core +1 more source
An exact approach for the 0–1 knapsack problem with setups [PDF]
Computers & Operations Research, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DELLA CROCE DI DOJOLA, Federico +2 more
openaire +1 more source
Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division
IEEE Access, 2019 Membrane computing is a kind of distributed and parallel computing model inspired by a biological cell mechanism. The maximum parallelism of membrane computing improves the computational efficiency of its computational model.
Lian Ye +3 more
doaj +1 more source
A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem [PDF]
, 2014 The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time.
Dong, Hongbin, He, Feidun, He, Jun
core
An Adaptive Quantum-inspired Differential Evolution Algorithm for 0-1 Knapsack Problem
, 2010 Differential evolution (DE) is a population based evolutionary algorithm widely used for solving multidimensional global optimization problems over continuous spaces. However, the design of its operators makes it unsuitable for many real-life constrained
Hota, Ashish Ranjan, Pat, Ankit
core +1 more source
Shaping Decision Models for Stochastic Dynamic Optimization Problems via Reinforcement Learning
Networks, EarlyView.ABSTRACT With rising customer expectations and increasing computational potential, many transport, manufacturing, and production operations face real‐time decision making in stochastic dynamic environments. Decision makers must find and adapt complex plans that are effective now but also flexible with respect to future developments.
Florentin D. Hildebrandt +3 more
wiley +1 more source
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
, 2016 Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of covering type.
Bazzi, Abbas +3 more
core +1 more source
Approximation Schemes for 0-1 Knapsack [PDF]
, 2018 We revisit the standard 0-1 knapsack problem. The latest polynomial-time approximation scheme by Rhee (2015) with approximation factor 1+eps has running time near O(n+(1/eps)^{5/2}) (ignoring polylogarithmic factors), and is randomized.
Chan, Timothy M.
core +1 more source