Category : knapsack-problem

Following the guidance by Nicholas Renotte I would like to implement DQN-Agent with OpenAI Gym implementation of Knapsack environment with 5 items. The observation space is basically a tuple of shape (2,6), which defines also the input layer of the Keras model behind the DQN agent. Now I get a struggle with the dimensions of ..

Read more

I am looking for the formulation of a constraint for a slight variation of the classical multiple-knapsack problem. As in the classical problem, there are items with values and weights to pack into n knapsacks having a maximum capacity. Additionally to the classical problem, I want to enforce the constraint that a specific item can ..

Read more

I stumbled on this question, and while it is close, it’s missing some elements that I would need. Binpacking — multiple constraints: weight+volume The question above bases the optimization on weight and volume only. I unfortunately have a bit more complex of an issue. I have a list of materials, their count, their dimensions (length, ..

Read more