The following project was done to provide an optimal way of solving the 0/1 Knapsack Problem. The implementation uses dynamic programming and parallel computations in the form of multiprocessing. The ...

This report details the implementation of a genetic algorithm designed to solve the 0/1 Knapsack problem. The objective is to maximize the total profit of selected items while ensuring that the total ...

Abstract: List-based simulated annealing (LBSA) algorithm, which uses list-based cooling scheme to control the change of parameter temperature, was first proposed for traveling salesman problem. This ...

Abstract: Ant colony algorithms analogize the social behaviour of ant colonies, they are a class of meta-heuristics which are inspired from the behavior of real ants. It was applied successfully to ...

2College of Information Science and Engineering, Northeastern University, Shenyang 110819, China In order to optimize the knapsack problem further, this paper proposes an innovative model based on ...

College of Information Science and Engineering, Northeastern University, Shenyang 110819, China. School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China. In order ...