` Bin Packing Algorithm to find out best use of material - Links (Jim Gambon) - Icetips Article
Icetips - Templates, Tools & Utilities for Clarion Developers

Templates, Tools and Utilities
for Clarion Developers

Icetips Article

Back to article list   Search Articles     Add Comment     Printer friendly     Direct link  

Clarion 6.1: Bin Packing Algorithm to find out best use of material - Links
2005-02-02 -- Jim Gambon
 
Newsgroups: comp.lang.clarion > I'm looking for an algorithm or another solution to solve my following > problem: > > I've got a queue with requested lengths: > .... > And I've got a queue with what is in stock: >.... > Is there a known algorithm that does something similar to achieve this or > can somebody help me in the right direction. I think this is a classic "hard" problem . "Hard" means there is no good solution. It's called the "Bin Packing Problem", and I found some information about it by doing a Google for "Bin Packing algorithm". Here are some links that might help: This one describes the problem: http://wwweng.murdoch.edu.au/EngModules/m108demo/Section01/Section0102c.html This one has several algorithms: http://www.cs.gsu.edu/~cscskp/Algorithms/NP/node11.html In your case you will have to control the "Bin" count since you want to use the least number of raw stock items for the cuts. It may require several passes of "bin stacking" to get a best fit of "raw stock" usage. Sorry it's not more help. Best regards, Jim Gambon

Today is November 21, 2024, 3:47 am
This article has been viewed 35339 times.
Google search has resulted in 28 hits on this article since January 25, 2004.


Back to article list   Search Articles   Add Comment   Printer friendly

Login

User Name:

Password:


Gold Subscription
Buy Now
Silver Subscription
Buy Now
Solo Subscription
Buy Now
Multiple Copy Pricing
Renew Subscription