#include "definition.h"
list ReturnListA_i(list ListItem, int a_i) {
list resuarrival == a_i) {
item.index = iter->index;
item.arrival = iter->arrival;
item.departure = iter->departure;
result.push_back(item);
}
}
return resudeparture departure;
pos = iter;
}
}
item.index = pos->index;
item.arrival = pos->arrival;
item.departure = pos->departure;
result.push_back(item);
templist.erase(pos);
}
return resuarrival;
item.departure = iter->departure;
result.push_back(item);
}
}
index = 1;
for (iter = result.begin(); iter != result.end(); iter++) {
iter->index = index;
index++;
}
return resuarrival;
item.departure = iter->departure;
result.push_back(item);
}
}
index = 1;
for (iter = result.begin(); iter != result.end(); iter++) {
iter->index = index;
index++;
}
return resuarrival;
item.departure = iter->departure;
result.push_back(item);
}
}
index = 1;
for (iter = result.begin(); iter != result.end(); iter++) {
iter->index = index;
index++;
}
return resu= (bin.y - 1) * tv)
bin.c2 = 2.0 * (L + 1 - bin.x) * th;
else bin.c2 = 2.0 * (bin.y - 1) * tv;
for (int k = 0; k c1 c1;
pos = iter;
}
}
bin.index = index;
bin.x = pos->x;
bin.y = pos->y;
bin.c1 = pos->c1;
bin.c2 = pos->c2;
for (int i = 0; i segments[i].layer;
bin.segments[i].item.index = pos->segments[i].item.index;
bin.segments[i].item.arrival = pos->segments[i].item.arrival;
bin.segments[i].item.departure = pos->segments[i].item.departure;
}
result.push_back(bin);
templist.erase(pos);
index++;
}
return resuindex;
Remains[iter->index - 1].arrival = iter->arrival;
Remains[iter->index - 1].departure = iter->departure;
IsRemained[iter->index - 1] = true;
}
for (iter = SubList.begin(); iter != SubList.end(); iter++) {
IsRemained[iter->index - 1] = false;
}
for (int i = 0; i ReturnLaterItems(list ItemList, int start) {
list resuarrival >= start) {
item.index = iter->index;
item.arrival = iter->arrival;
item.departure = iter->departure;
result.push_back(item);
}
}
return resuindex index;
pos = iter;
}
}
item.index = pos->index;
item.arrival = pos->arrival;
item.departure = pos->departure;
result.push_back(item);
templist.erase(pos);
}
return resuindex;
NS[index].arrival = iter->arrival;
NS[index].departure = iter->departure;
index++;
}
} //
while (BIN[0].index != 0) {
if (BIN[0].departure == period) {
for (int i = 0; i period) {
MayBlocking = false;
for (int i = 1; i ItemList, list BinList) {
Result resuc1;
Cost2[biter->index - 1] = biter->c2;
index++;
} //
index = 0;
for (uiter = ItemList.begin(); uiter != ItemList.end(); uiter++) {
items[index].index = uiter->index;
items[index].arrival = uiter->arrival;
items[index].departure = uiter->departure;
IsAssigned[index] = false;
index++;
} //
for (int i = 0; i = 0 selected = items[lastselected].departure items[i].arrival + items[i].departure = 0 selected = 0 selected most !IsMerged[k]) {
most = Single[k].size;
selected = k;
}
}
if (selected >= 0 selected 0) {
for (uiter = Single[selected].items.begin(); uiter != Single[selected].items.end(); uiter++) {
item.index = uiter->index;
item.arrival = uiter->arrival;
item.departure = uiter->departure;
Multiple[i].items.push_back(item);
}
}
else if (Single[selected].size == 0)
j--;
}
}
}
for (int i = 0; i 0) {
Multiple[i].items = ReSortUnitLoadList(Multiple[i].items);
Multiple[i].blocking = ReturnBlockingNumber(Multiple[i].items);
result.blocking += Multiple[i].blocking;
result.cost += 2.0 * Cost1[i] * Multiple[i].size + 2.0 * Cost2[i] * Multiple[i].blocking;
result.assignment[i] = Multiple[i].size;
}
}
//
result.cost /= NumberOfItem;
return resux;
FlowRack[index].y = Biter->y;
FlowRack[index].c1 = Biter->c1;
FlowRack[index].c2 = Biter->c2;
for (int i = 0; i segments[i].layer;
FlowRack[index].segments[i].item.index = Biter->segments[i].item.index;
FlowRack[index].segments[i].item.arrival = Biter->segments[i].item.arrival;
FlowRack[index].segments[i].item.departure = Biter->segments[i].item.departure;
}
index++;
} //
//
templist = ItemList;
while (period arrival == period) {
item.index = iter->index;
item.arrival = iter->arrival;
item.departure = iter->departure;
N_S.push_back(item);
}
}
templist = DeleteUnitLoads(templist, N_S);
// ，
for (int i = 0; i period MayBlocking) {
result.cost += FlowRack[i].c2;
N_B.push_back(FlowRack[i].segments[0].item);
for (int j = 0; j index;
item.arrival = iterB->arrival;
item.departure = iterB->departure; // item
for (int i = 0; i item.departure) {
MayBlocking = true;
for (int k = j + 1; k c1 + (blocking + 1) * Biter->c2 c1 + (blocking + 1) * Biter->c2;
Bpos = Biter;
}
}
BinID = Bpos->index;
// if (BinID >= 0 BinID index;
item.arrival = iterS->arrival;
item.departure = iterS->departure; // item
for (int i = 0; i item.departure) {
MayBlocking = true;
for (int k = j + 1; k c1 + blocking * Biter->c2 c1 + blocking * Biter->c2;
Bpos = Biter;
}
}
BinID = Bpos->index;
// if (BinID >= 0 BinID ItemList, UnitLoad item) {
int result = 0;
list::iterator iter;
for (iter = ItemList.begin(); iter != ItemList.end(); iter++) {
if (iter->arrival departure > item.arrival) {
result++;
}
}
return resuarrival;
items[index].departure = uiter->departure;
IsAssigned[index] = false;
index++;
} // items
index = 0;
for (biter = BinList.begin(); biter != BinList.end(); biter++) {
Cost1[index] = biter->c1;
Cost2[index] = biter->c2;
index++;
} //
//
count = 0;
for (int i = 0; i = 0 selected = 0 selected = items[lastselected].arrival
items[j].departure >= items[lastselected].departure
items[j].departure = 0 selected 5.0) {
return resuarrival;
item.departure = uiter->departure;
RemainingList.push_back(item);
}
FGGroups[selected].items.clear();
}
for (uiter = RemainingList.begin(); uiter != RemainingList.end(); uiter++) {
item.index = uiter->index;
item.arrival = uiter->arrival;
item.departure = uiter->departure;
if (SharedItem(FGGroups[selected].items, item) most) {
most = FGGroups[j].size;
selected = j;
}
}
if (selected >= 0 selected most) {
most = FGGroups[j].size - FGGroups[j].blocking;
selected = j;
}
}
if (selected >= 0 selected index - 1] = true;
}
}
goto FGREDO;
}
result.cost /= NoAssignment;
return resuarrival;
items[index].departure = uiter->departure;
IsAssigned[index] = false;
index++;
} // items
index = 0;
for (biter = BinList.begin(); biter != BinList.end(); biter++) {
Cost1[index] = biter->c1;
Cost2[index] = biter->c2;
index++;
} //
//
count = 0;
for (int i = 0; i = 0; j--) {
if (!IsAssigned[j] items[j].arrival + items[j].departure > latest) {
latest = items[j].arrival + items[j].departure;
selected = j;
}
}
while (selected >= 0 selected = 0; j--) {
if (!IsAssigned[j]
items[j].arrival latest
SharedItem(BGGroups[i].items, items[j]) 5.0) {
return resuarrival;
item.departure = uiter->departure;
RemainingList.push_back(item);
}
BGGroups[selected].items.clear();
}
for (uiter = RemainingList.begin(); uiter != RemainingList.end(); uiter++) {
item.index = uiter->index;
item.arrival = uiter->arrival;
item.departure = uiter->departure;
if (SharedItem(BGGroups[selected].items, item) most) {
most = BGGroups[j].size;
selected = j;
}
}
if (selected >= 0 selected most) {
most = BGGroups[j].size - BGGroups[j].blocking;
selected = j;
}
}
if (selected >= 0 selected index - 1] = true;
}
}
goto BGREDO;
}
result.cost /= NoAssignment;
return resu<
}