In this paper, we present some initial results of several meta-heuristic optimization algorithms, namely, genetic algorithms, simulated annealing, branch and bound, dynamic programming, greedy search ...

The knapsack problem is basic in combinatorial optimization and possesses several variants and expansions. In this paper, we focus on the multi-objective stochastic quadratic knapsack problem with ...

ABSTRACT In this paper, we focus on the multi-objective stochastic multiple knapsack problem, in which the object weights are random. We propose a new approach called the multi-objective memetic ...

A hybrid intelligent algorithm integrating Q-learning is innovatively designed, using a genetic algorithm as the main framework while embedding a quay crane allocation module and dynamically selecting ...

We present an artificial intelligence-guided approach to design durable and chemically recyclable ring-opening polymerization (ROP) class polymers. This approach employs a genetic algorithm (GA) that ...

This repository contains an implementation of the Genetic Algorithm [1] to solve the 0-1 knapsack problem using different programming languages. This implementation of the Genetic Algorithm makes use ...

Knapsack problem is a typical computer algorithm of NP complete (Nondeterministic Polynomial Completeness) problem. The research of solving this problem has great significance not only in theory, but ...

Genetic Algorithm (GA) with enhance design constrains function of lateral displacements, inter-story drifts and top acceleration is then developed to perform structural optimization. A numerical ...