worstfit.cpp

自己编写的装箱问题的各种求解策略

void CBinpackDlg::OnButtonWfd() 
{
	// TODO: Add your control notification handler code here
	float b[20];
	float s[8];            // 存储每个物品的重量
	int num[8];            // 存储每个物品存入的箱子号
	memset(b,0.0,sizeof(b)); // 赋初值
	s[0] = m_weigh1;
	s[1] = m_weigh2;
	s[2] = m_weigh3;
	s[3] = m_weigh4;
	s[4] = m_weigh5;
	s[5] = m_weigh6;
	s[6] = m_weigh7;
	s[7] = m_weigh8;
	sort(s,s+8,compare);
	int i,j,k,flag; 
	float min,temp;
	for(i = 0; i < 8; i++){
		min = 10000;
		flag = 0;             // flag为0代表需要重新开一个箱子
		for(j = 1; ; j++){
			temp = b[j] + s[i];
			if (temp < min && temp <= 1.0){
				min = temp;
				k = j;
				flag = k;
			}
			if (b[j+1] == 0 && temp > 1.0 && (flag==0)){
				num[i] = j + 1;
				b[j+1] += s[i];
				break;
			}
			if (b[j+1] == 0 && min <= 1.0){
				num[i] = k;
				b[k] += s[i];
				break;
			}
		}
	}
	j = 1;
	while(b[j] != 0)
		j = j + 1;
	m_count_wfd = j - 1;
	UpdateData(false);
	CString str;
	str.Format("各个物品存放的箱子编号为：%d%d%d%d%d%d%d%d",num[0],num[1],num[2],
		num[3],num[4],num[5],num[6],num[7],num[8]);

	AfxMessageBox(str);
}