Algorithms

public static string placeItemInBin(Item itemToPlacing)
{
    //sortBinList(); جعبه ی پر تر اولویت دارد
    LinkedListNode<Bin> binNode;
    bool isPlaced = false;
    int allSideStates = 1;

    while (allSideStates <= 2)
    {
        binNode = listOfBins.First;
        while (isPlaced == false && binNode != null)
        {
            if (binNode.Value.RemainWidth >= itemToPlacing.Width)
                if (binNode.Value.RemainWeight >= itemToPlacing.Weight
                    && binNode.Value.Height >= itemToPlacing.Height
                    && binNode.Value.Depth >= itemToPlacing.Depth)
                {
                    LinkedListNode<Partirion> partitionNode;
                    LinkedListNode<Partirion> Best;
                    Best=null;
                    partitionNode = binNode.Value.parts.First;
                    while (partitionNode != null)
                    {
                        //Best Fit :
                        if (partitionNode.Value.num == -1
                            && partitionNode.Value.size >= itemToPlacing.Width
                            && (Best == null || partitionNode.Value.size <= Best.Value.size))
                        {
                            Best = partitionNode;
                            if (Best.Value.size == itemToPlacing.Width)
                                break;
                        }
                        partitionNode = partitionNode.Next;
                    }
                    if (Best != null)
                    {
                        //separate node:
                        Partirion newPart = new Partirion(itemToPlacing.Width, itemToPlacing.Number,
                            Best.Value.cmBegin);
                        Best.Value.cmBegin += itemToPlacing.Width;
                        Best.Value.size -= itemToPlacing.Width;
                        //Add Nodes:
                        binNode.Value.parts.AddBefore(Best, newPart);
                        //
                        itemToPlacing.BinNumber = binNode.Value.Number;
                        binNode.Value.RemainWidth -= itemToPlacing.Width;
                        binNode.Value.RemainWeight -= itemToPlacing.Weight;
                        binNode.Value.RemainVolume -= itemToPlacing.Width
                            * binNode.Value.Height * binNode.Value.Depth;
                        isPlaced = true;
                        return ("item: (" + itemToPlacing + ") ====> Bin: (" + binNode.Value + ")");
                    }

                }
            binNode = binNode.Next;
        }
        itemToPlacing.changeSideState();
        allSideStates++;
    }
    return "Not Found";
}

LinkBinsOrItems.sortItemList();//Biggeset To Smallest
LinkBinsOrItems.sortBinList();//Smallest To Biggest

private void btnBestMode_Click(object sender, EventArgs e)
{
    //Check if Lists Are Empty?
    //If the LinkedList<T> is empty, the First and Last properties contain null.
    if (LinkBinsOrItems.listOfBins == null)
    {
        if (LinkBinsOrItems.listOfItems == null)//If Both Of Lists Are Empty
        {
            MessageBox.Show("Item List And Also Bin List Are Empty!!"
                +"You Must Enter Bins And Items..."
                , "Bin List And Item list Empty Error", MessageBoxButtons.OK
                , MessageBoxIcon.Information);
            return;
        }
        //If Only Bin List Is Empty
        MessageBox.Show("Bin List Is Empty!! You Must Enter Bins...", "Bin List Empty Error"
            , MessageBoxButtons.OK, MessageBoxIcon.Information);
        return;
    }
    //If Only Item List Is Empty
    if (LinkBinsOrItems.listOfItems == null)
    {
        MessageBox.Show("Item List is Empty!! You Must Enter Items..."
            , "Item List Empty Error", MessageBoxButtons.OK, MessageBoxIcon.Information);
        return;
    }

    //Show Warning To User
    DialogResult result = MessageBox.Show("Are you sure you want to do sorting "
        +"for creat more free space?(This can change items places"
        , "Sort For Best Mode",MessageBoxButtons.YesNo,MessageBoxIcon.Question);
    if (result == DialogResult.No)
        return;

    LinkedListNode<Item> itemNode;
    LinkedListNode<Bin> binNode;

    //Clear Bins And Items Relations
    itemNode = LinkBinsOrItems.listOfItems.First;
    for (int i = 1; i <= LinkBinsOrItems.listOfItems.Count; i++)
    {
        itemNode.Value.BinNumber = -1;
    }
    binNode = LinkBinsOrItems.listOfBins.First;
    for (int i = 1; i <= LinkBinsOrItems.listOfBins.Count; i++)
    {
        binNode.Value.clearRelations();
    }

    //Sort Bin And Item List:
    LinkBinsOrItems.sortItemList();//Biggeset To Smallest
    LinkBinsOrItems.sortBinList();//Smallest To Biggest

    //Do Placing:
    listBox1.Items.Add("");
    itemNode = LinkBinsOrItems.listOfItems.First;
    for (int i = 1; i <= LinkBinsOrItems.listOfItems.Count; i++)
    {
        listBox1.Items.Add(itemNode.Value);
        listBox2.Items.Add(LinkBinsOrItems.placeItemInBin(itemNode.Value));
        itemNode = itemNode.Next;
    }

    //Inintal Rrport
    itemReportInitaling();//test
    BinReportInitaling();//Test
}

Cenator wrote:

Thanks [Rose]

Member 11849553 wrote:

who i can talk to regarding Mathematics and Algorithms

void SwapValues (ref int a, ref int b)
{
    int temp = a;
    a = b;
    b = temp;
}

if x < y then t= x; x= y; y= t; endif
if x < z then t= x; x= z; z= t; endif
if y < z then t= y; y= z; z= t; endif

Rui__Silva wrote:

Tanks ppolymorphe

Rui__Silva wrote:

After your tip i did some research and i think my solution fits more or less in Direct Acyclic Graph more than oriented graph.