Many problems in business and engineering can be modeled as 0-1 knapsack problems. However, the 0-1 knapsack problem is one of the classical NP-hard problems. Therefore, it is valuable to develop effective and efficient algorithms for solving 0-1 kna...
The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1. the exact algorithms for the optimal solutions (i.e., branch-and-bou...
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...
China’s railway network is one of the largest railway networks in the world. By the end of 2016, the total length of railway in operation reached 124,000 km and the annual freight volume exceeded 3.3 billion tons. However, the structure of network do...
The harmony search (HS) algorithm is a novel metaheuristic which has been widely used to solve both continuous and discrete optimization problems. In order to improve the performance and simplify the implementation of the HS algorithm for solving the...
The list-based threshold accepting (LBTA) algorithm is a sophisticated local search method that utilizes a threshold list to streamline the parameter tuning process in the traditional threshold accepting (TA) algorithm. This paper proposes an enhance...
The Planet Optimization Algorithm (POA) is a meta-heuristic inspired by celestial mechanics, drawing on Newtonian gravitational principles to simulate planetary dynamics in optimization search spaces. While the POA demonstrates a strong performance i...
The Knapsack Problem belongs to the best-studied classical problems in combinatorial optimization. The Multiple-choice Knapsack Problem (MCKP) represents a generalization of the problem, with various application fields such as industry, transportatio...
Benchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range R, and these instances can be referred to as the unbounded knapsack problem with bounded coefficients (UKPB)....
A variant of the well-known Knapsack Problem is studied in this paper. In the classic problem, a set of items is given, with each item characterized by a weight and a profit. A knapsack of a given capacity is provided, and the problem consists of sel...
A knapsack problem is to select a set of items that maximizes the total profit of selected items while keeping the total weight of the selected items no less than the capacity of the knapsack. As a generalized form with multiple knapsacks, the multi-...
In this paper, we study the knapsack problem with conflict pair constraints. After a thorough literature survey on the topic, our study focuses on the special case of bipartite conflict graphs. For complete bipartite (multipartite) conflict graphs, t...
The knapsack problem is a typical bi-objective combinatorial optimization issue, wherein maximizing the value of the packed items is achieved concurrently with minimizing the weight of the load. Due to the conflicting objectives of the knapsack probl...
In this paper, The Multidimensional Knapsack Problem (MKP) which occurs in many different applications is studied and a genetic algorithm to solve the MKP is proposed. Unlike the technique of the classical genetic algorithm, initial population is not...
The quadratic multidimensional knapsack problem (QMdKP) is a combinatorial optimization problem that involves selecting a subset of items to maximize both linear and quadratic profits without exceeding the capacity constraints across multiple dimensi...
This paper presents a process that is based on sets of parts, where elements are fixed and removed to form different binary branch-and-bound (BB) trees, which in turn are used to build a parallel algorithm called “multi-BB”. These sequent...
In 2024, four papers that presented four different solution approaches for the knapsack problem with forfeits (KPF) appeared in the OR literature. However, none of these four solution approaches compared their performance to the other three on a stan...
Recent years have witnessed a growing interest in automatic learning mechanisms and applications. The concept of hyper-heuristics, algorithms that either select among existing algorithms or generate new ones, holds high relevance in this matter. Curr...
We propose a hybrid framework that integrates instance clustering with Automatic Generation of Algorithms (AGA) to produce specialized algorithms for classes of Multidimensional Knapsack Problem (MKP) instances. This approach is highly relevant given...
In this study, the Binary Puma Optimizer (BPO) is introduced as a novel binary metaheuristic. The BPO employs eight Transfer Functions (TFs), consisting of four S-shaped and four V-shaped mappings, to convert the continuous search space of the origin...
The dragonfly algorithm (DA) is a new intelligent algorithm based on the theory of dragonfly foraging and evading predators. DA exhibits excellent performance in solving multimodal continuous functions and engineering problems. To make this algorithm...
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. A...
One of the main components of most modern Multi-Objective Evolutionary Algorithms (MOEAs) is to maintain a proper diversity within a population in order to avoid the premature convergence problem. Due to this implicit feature that most MOEAs share, t...
In order to minimize execution times, improve the quality of solutions, and address more extensive target situations, optimization techniques, particularly metaheuristics, are continually improved. Hybridizing procedures are one of these noteworthy s...
We propose a memetic algorithm for the multiple-choice multidimensional knapsack problem (MMKP). In this study, we focus on finding good solutions for the MMKP instances, for which feasible solutions rarely exist. To find good feasible solutions, we...
The discounted {0-1} knapsack problem (D{0-1}KP) is a multi-constrained optimization and an extended form of the 0-1 knapsack problem. The DKP is composed of a set of item batches where each batch has three items and the objective is to maximize prof...
Combinatorial optimization problems (COPs), including the Knapsack Problem (KP), the Traveling Salesman Problem (TSP), and regional variants such as the Close-Enough Traveling Salesman Problem (CETSP), constitute fundamental models for addressing com...
This study introduces a novel heuristic approach to optimize mineral processing in metallurgical plants, framed as a variant of the fractional knapsack problem. The optimization framework integrates plant operational modes, blending requirements, and...
The moth search algorithm (MS) is a relatively new metaheuristic optimization algorithm which mimics the phototaxis and Lévy flights of moths. Being an NP-hard problem, the 0–1 multidimensional knapsack problem (MKP) is a classical multi...
The subject of this paper is the comparison of two algorithms belonging to the class of evolutionary algorithms. The first one is the well-known Population-Based Incremental Learning (PBIL) algorithm, while the second one, proposed by us, is a modifi...
In recent years, metaheuristic methods have shown remarkable efficacy in resolving complex combinatorial challenges across a broad spectrum of fields. Nevertheless, the escalating complexity of these problems necessitates the continuous development o...
Moth search (MS) algorithm, originally proposed to solve continuous optimization problems, is a novel bio-inspired metaheuristic algorithm. At present, there seems to be little concern about using MS to solve discrete optimization problems. One of th...
As a significant subset of the family of discrete optimization problems, the 0-1 knapsack problem (0-1 KP) has received considerable attention among the relevant researchers. The monarch butterfly optimization (MBO) is a recent metaheuristic algorith...
The Multi-demand Multidimensional Knapsack Problem (MDMKP) is a challenging combinatorial task due to its capacity and demand constraints. Local search operators play a key role in metaheuristics when navigating such complex solution spaces, yet thei...
For the classic 0–1 knapsack problem, there can be pairs of items that are in conflict. In other words, either at most one item can be inserted into the knapsack (hard conflict constraint) from the conflict pair or there may be a penalty (soft...
The Multi-Demand Multidimensional Knapsack Problem (MDMKP) combines upper-bound capacities and lower-bound demands, producing a restrictive feasible region. We study three swap-based repair-intensification policies in a common hybrid framework: light...
In this paper, we address the aspect of knapsack balancing in the classic knapsack problem. Recognizing that excessive dispersion in the objective function or constraint coefficients of the optimal solution can be undesirable, we propose, when approp...
By introducing an easy knapsack-type problem, a probabilistic knapsack-type public key cryptosystem (PKCHD) is proposed. It uses a Chinese remainder theorem to disguise the easy knapsack sequence. Thence, to recover the trapdoor information, the impl...
Hyper-heuristics are widely used for solving numerous complex computational search problems because of their intrinsic capability to generalize across problem domains. The fair-share iterated local search is one of the most successful hyper-heuristic...
Quantum annealers are suited to solve several logistic optimization problems expressed in the QUBO formulation. However, the solutions proposed by the quantum annealers are generally not optimal, as thermal noise and other disturbing effects arise wh...
This article addresses the problem of converting a single-objective combinatorial problem into a multi-objective one using the Pareto front approach. Although existing algorithms can identify the optimal solution in a multi-objective space, they fail...
In this paper, we generalize to the multivariate setting the current state-of-the-art methods in the literature for the inference of bivariate polynomials constructed recursively, by means of repeated additions and multiplications. We present two mai...
Inspired by the advancements in (fully) homomorphic encryption in recent decades and its practical applications, we conducted a preliminary study on the underlying mathematical structure of the corresponding schemes. Hence, this paper focuses on inve...
The Arctic Puffin Optimization (APO) Algorithm is a recently proposed metaheuristic algorithm that has been widely applied to solve optimization problems in continuous spaces. However, it cannot be directly used to solve combinatorial optimization pr...
Chaotic maps are sources of randomness formed by a set of rules and chaotic variables. They have been incorporated into metaheuristics because they improve the balance of exploration and exploitation, and with this, they allow one to obtain better re...
Ant colony optimization is a metaheuristic that is mainly used for solving hard combinatorial optimization problems. The distinctive feature of ant colony optimization is a learning mechanism that is based on learning from positive examples. This is...
Convolutional neural networks (CNNs) have powerful representation learning capabilities by automatically learning and extracting features directly from inputs. In classification applications, CNN models are typically composed of: convolutional layers...
Many service robots have to operate in a variety of different Service Event Areas (SEAs). In the case of the waste collection robot MARBLE (Mobile Autonomous Robot for Litter Emptying) every SEA has characteristics like varying area and number of lit...
The microgrid system is an answer to the necessity of increasing renewable energy penetration and also works as a bridge for the future smart grid. Considering the microgrid system applied to commercial building equipped with photovoltaic sources, th...
The Internet of Things (IoT) is a vision of the upcoming society. It can provide pervasive communication between two or more entities using 4G-LTE (Long Term Evolution) communication technology. In 4G-LTE networks, there are two important problems: h...
of 3