cutting stock problem java library Code
Java library to solve cutting stock problem using greedy approach
Brought to you by:
gaurav2493
Menu
▾
▴
Tree [b20e8e] master / History
| File | Date | Author | Commit |
|---|---|---|---|
| bin | 2013-11-18 |
gaurav
|
[fa1feb] Exception classes added |
| src | 2013-11-18 |
gaurav
|
[fa1feb] Exception classes added |
| .classpath | 2013-11-18 |
gaurav
|
[3e7a95] first commit |
| .project | 2013-11-18 |
gaurav
|
[3e7a95] first commit |
| README.md | 2013-11-18 |
gaurav
|
[b20e8e] Readme edited |
Read Me
This java library solves cutting stock problem using greedy approach.
Greedy approach may not give the optimal solution but gives an acceptable solution quickly.
Using this library is simple. Here is a simple example
public static void main(String[] args) {
int blocks[]={700,500,250,380};
int quantities[]={4,3,6,5};
int i=0,max_size=2000;
Map<Integer, Integer> map;
CuttingStock cuttingStock= new CuttingStock(max_size,blocks,quantities);
while(cuttingStock.hasMoreCombinations())
{
System.out.println("\nCombination no "+(++i));
map=cuttingStock.nextCombination();
for (Entry<Integer, Integer> entry : map.entrySet())
{
Integer key = entry.getKey();
Integer value = entry.getValue();
System.out.println(key+" * "+value);
}
}
}
Output will be
Combination no 1
250 * 6
500 * 1
Combination no 2
700 * 1
500 * 1
380 * 2
Combination no 3
700 * 1
500 * 1
380 * 2
Combination no 4
700 * 2
380 * 1
