In this paper we present a heuristic based upon genetic algorithms for the multidimensional
knapsack problem. A heuristic operator which utilises problem-specific knowledge is …

The multidimensional 0/1 knapsack problem is a classical problem of discrete optimization.
There are several approaches for solving the different variations of such problem, including …

Non-intrusive load monitoring (NILM) identifies used appliances in a total power load
according to their individual load characteristics. In this paper we propose an evolutionary …

We use surrogate analysis and constraint pairing in multidimensional knapsack problems to
fix some variables to zero and to separate the rest into two groups–those that tend to be zero …

A human thermoregulation model has been adapted for predicting the thermal response of
Typical Older Persons. The model known as the Older Persons Model predicts the core body …

Most of the NP-hard combinatorial optimization problems cannot be solved to optimality in
practice. Therefore heuristic techniques have to be used to obtain solutions of high quality …

Abstract The 0-1 multidimensional knapsack problem (MKP) is a well-known combinatorial
optimization problem with several real-life applications, for example, in project selection …

During the last two decades solving combinatorial optimization problems, using genetic
algorithms (GA), has attracted the attention of many researchers. In this paper a strong initial …

In light of increasing economic and international threats, military operations must be
examined with a critical eye in terms of process design, management, improvement, and …

When designing evolutionary algorithms (EAs) for the multidimensional knapsack problem, it
is important to consider that the optima lie on the boundary B of the feasible region of the …