A steady-state \(\mu\)GA-based generative hyper-heuristic approach for producing selection hyper-heuristics that outperform those generated by other evolutionary methods in the literature for the ...

An algorithm is present in everything in your life! No, it's not spying on you, nor is it a monster in the closet! But don't panic, everything is under control! An algorithm is a series (a ...

The 3D bin packing problem is a challenging combinatorial optimization problem with numerous real-world applications. In this paper, we present a novel approach for solving this problem by integrating ...

Abstract: This is a research project on using Genetic Algorithm to solve 0-1 Knapsack Problem. Knapsack problem is a combinational optimization problem. Given a set of items, each with a weight & ...

Two-dimensional (2D) irregular packing problems are widespread in manufacturing industries such as shipbuilding, metalworking, automotive production, aerospace, clothing and furniture manufacturing.

You have to pass the token, and the name of the solver("Advantage-sys", "hybrid_solver" or any other solver provided by Dwave.) then you have to pass the items in the ...

A comparison between Backtracking solver and Genetic algorithm performances. A few months ago, I got familiar with genetic algorithms. I started to read about it and I was pretty amazed by it. One of ...

[Ahuja00] “A greedy genetic algorithm for the quadratic assignment problem”, R. Ahuja, J. Orlin, A. Tiwari, Computers and Operations Research, vol. 27, issue 10 (Sept. 2000), 917--934, ACM (2000) ...

ABSTRACT: The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard combinatorial optimization problem that can model a number of challenging applications in logistics, finance, ...

ABSTRACT: A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in ...