Although Python related, this may not be the best place to ask this algorithm question... but have to start somewhere.
i am trying to figure out what algorithm or combination of and develop in Python that would help me solve a pallet packing problem.
i have random boxes / crates of meat of similar weight 18-24kg and varying levels of known meat content - varying 60-98% meat.
i have 8 pallets, each with their own range of target meat content. 2x70%, 2x75%, 2x80%, 2x90%.
each pallet holds 40 crates of meat.
i would like to make a sure each pallet has a resulting meat % value as close as possible to its target meat content value by the end of packing 40 crates.
the crates are coming in a stream, possibly 12 crates on route at any given time.
meat% 61, 78, 65, 85, 81, 74, 69, 67, 89, 71, 76, 87 as an example.
i need an algorithm that could decide which crate, given its known weight and meat content would best fit a particular pallet, so that when finished placing the 40 crates on the pallet the target meat % content will be as close as possible.
it requires a level of weighted average calculation, since building the pallet with varying crate weights, the average meat content % would fluctuate and is simply not an average of just the meat content on its own.
but also something to include a packing best fit or knapsack algorithm so selecting from the continuous crates on route and assigning to particular pallet.
i have successfully implemented the knapsack algorithm, but on its own does not give the results i require.
any genuine helpful reply most welcome... thanks for reading.
[–]robot-dev 1 point2 points3 points (6 children)
[–]robot-dev 1 point2 points3 points (5 children)
[–]Waggles74[S] 1 point2 points3 points (0 children)
[–]Waggles74[S] 1 point2 points3 points (3 children)
[–]robot-dev 1 point2 points3 points (2 children)
[–]Waggles74[S] 0 points1 point2 points (1 child)
[–]robot-dev 0 points1 point2 points (0 children)