best fit algorithm

[kamsmartx]

I'm new to programming and need some help figuring out an algorithm.

I need to design some kind of algorithm which will help us define capacity for one of our portfolios....h ere's the problem explained (also see attached example):

1. The graph defines total capacity, y-axis being $, x-axis being date/time. the bars on the graph represent individual items.

2. What I need to do is place the items on the graph in an optimized manner, minimizing wastage of space. I can break the items vertically but can't break them up horizontally. The goal is to leave as much free space as possible for bigger horizonal items.

3. Items can't overlap each other.

4. See example, I'm currently doing in Access....my procedure takes too long to run and results in overlapped data.

I was wondering there has to be some standard algorithm to do this kind of thing....any ideas would be appreciated.... Thanks!

http://forums.devshed.com/attachment...achmentid=7328

take some hints:

iam creat the file by this code

    import java.awt.*;
 
   import javax.swing.*;
 
   import java.lang.SecurityException;
 
   import java.util.*;       
   import java.util.Formatter;               
   import java.util.FormatterClosedException;
   import java.util.NoSuchElementException;  
   import java.util.Scanner;  
 
   import java.io.*;
   import java.io.FileNotFoundException;     
   import java.io.InputStream;
   import java.io.OutputStream;
   import java.io.FileInputStream;
   import java.io.FileOutputStream;
   import java.io.FileReader;
   import java.io.FileNotFoundException;               
 
  public class FittingAllgorithm
 {
      int memory,dummycount;
     int process;
     int[] bestfit,worstfit,nextfit,firstfit;
 
 
 
     private Formatter output1; // object used to output text to file
 
     // enable user to open file
     public void openFile()
     {
        try
        {
           output1 = new Formatter( "memory.txt" );
        } // end try
        catch ( SecurityException securityException )
       {
          System.err.println(
              "You do not have write access to this file." );
           System.exit( 1 );
        } // end catch
        catch ( FileNotFoundException filesNotFoundException )
        {
           System.err.println( "Error creating file." );
           System.exit( 1 );
        } // end catch
     } // end method openFile
 
     // add records to file
     public void addRecords()
     {
        // object to be written to file
        Job record = new Job();
 
        Scanner input = new Scanner( System.in );
 
       System.out.printf( 
       "%s\n%s\n%s\n%s\n%s\n","********************\n\nFitting Algorithem\n\n********************\n\nThis Create By\n",
       "Khalid Ahmed Almallahy\n20032348\n\n********************\n",
       "Supervesor by",
       "\nMoamar Elyazgi.\n\n********************\n\n",
       "Hint :- \n When You Wont to Exit Press <CTRL>+z\n\n========================================================\n\n" );
 
        System.out.printf( "%s\n%s\n",
           "Enter First Jop 'Process' number must be greater than 0\n  Second Job 'Process'\n  Third Job 'Process'\n  last Job 'Process'",
           "?" );
 
       while ( input.hasNext() ) // loop until end-of-file indicator
        {
           try // output values to file
           {
              // retrieve data to be output
              record.setAccount ( input.nextInt() ); 
              record.setaccount1( input.nextInt() );    
              record.setaccount2( input.nextInt() );       
              record.setaccount3( input.nextInt() );     
 
              if ( record.getAccount() > 0 )
              {
                 // write new record
                 output1.format( "%d %d %d %d \n", 
                    record.getAccount(),
                    record.getaccount1(),
                    record.getaccount2(),       
                    record.getaccount3() );                             
              } // end if
              else
              {
                 System.out.println(
                    "Job number must be greater than 0." );
              } // end else
           } // end try
           catch ( FormatterClosedException formatterClosedException )
           {
              System.err.println( "Error writing to file." );
              return;
           } // end catch
           catch ( NoSuchElementException elementException )
           {
              System.err.println( "Invalid input. Please try again." );
              input.nextLine(); // discard input so user can try again
           } // end catch
 
          System.out.printf( "%s %s\n%s", "\nEnter First Job'Process' number greater than 0,",
              "\nSecond Job 'Process', \nTherd  Job 'Process' \nand So on..", "?\n" );
 
        } // end while
     } // end method addRecords
     // close file
    public void closeFile()
     {
        if ( output1 != null )
           output1.close();
     } // end method closeFile
 
     public void firstfit()
     {
 
      Job record = new Job();
      Scanner input = new Scanner( System.in );
 
     }
 
 
    public static void main( String args[] ) throws FileNotFoundException
     {
         FittingAllgorithm application = new FittingAllgorithm();
 
        application.openFile();
        application.addRecords();
        application.firstfit();
        //application.worstfit();
        //application.bestfit();
        application.closeFile();
     } // end main
  } // end class CreateTextFile
 
 
  /////////////////
 
  and this one
 
 
  public class Job
  {
      private int account;
      private int account1;
      private int account2;
      private int account3;
 
     public Job()
     {
        // constructor
     } 
 
 
     public Job( int acct, int account11, int  account22, int account33 )
     {
        setAccount( acct );
        setaccount1( account11 );
        setaccount2( account22 );
        setaccount3( account33 );
     }
 
 
     public void setAccount( int acct )
     {
        account = acct;
     } 
 
 
     public int getAccount()
    {
        return account;
     }
 
 
     public void setaccount1( int account11 )
     {
        account1 = account11;
     }
 
 
     public int getaccount1()
     {
        return account1;
     } 
 
     public void setaccount2( int account22 )
     {
        account2 = account22;
     } 
 
 
     public int  getaccount2()
     {
        return account2;
     }
 
 
     public void setaccount3( int account33 )
     {
        account3 = account33;
     } 
 
 
     public int getaccount3()
     {
        return account3;
    } 
  } 
 
 
/////////////////////
 

but the problem is how can i division the memory text, the memory text i created but i cannot division it
i wont to division it in to 7 parts each part have 20kb
how can i write this code
if there any one helpe me or any one can write code to division this problem
///////////////////

so i wont to enter number to saved it on the memory text
the memory text have 140kb division into 7 parts each part have 20kb
this is my proble

place help me by wite a code ...
////////////////////////////

i wont to division the memory into 7 parts each part have 20kb so the memory have 140kb , then i wont to enter the nuber into the memory text we must search the hole on the memory that is
empty to enter the number and put it in this hole
there r many algorithem to insert and search the hole but i wont to use the first , best, worst fit algorithems
how can i use this fitting by using this code

hint :::

Satisfy request of size n from list of free holes – four basic methods:
First-fit: Allocate the first hole that is big enough.
Best-fit: Allocate the smallest hole that is big enough; must search entire list, unless ordered by size. Produces the smallest leftover hole.
Worst-fit: Allocate the largest hole; must also search entire list. Produces the largest leftover hole.

help me

[JosAH]

I was wondering there has to be some standard algorithm to do this kind of thing....any ideas would be appreciated.... Thanks!

Hi, nice to see you back; your problem is a difficult problem to solve; here are
some thoughts about it:

A 'job' has a start time, a time length and a memory requirement. We can describe
it as J(s, t, m). If we do know all parameters s, t and m in advance the problem is
a two dimensional bin packing problem (loosely put: try to fit all those blocks in
the two dimensional TxM rectangle where T is time and M is memory requirement.

This problem is nasty as it is and needs sophisticated (integer) linear solvers
such as iLog's CPlex simplex and interior point plus branch and bound solvers.
Don't take this lightly; it's not stuff for a beginner (no insult intended).

If we *don't* know parameter 's' in advance we're dealing with JIT planning (JIT ==
Just In Time) and there's not much more we can do than indeed apply a simple
first- next- best- or worst fit w.r.t. the memory requirement 'm'; parameter 't' is
fixed so we can't fiddle with that.

I do hope that you're dealing with the second variant because the first variant
takes a lot of processing power and nifty heuristics when if comes to cost factors
if all the requirements are *not* met.

kind regards,

Jos

[JosAH]

ps. when it comes to those 'fit'algorithms : Donald Knuth already showed in the
'70s that it doesn't matter much: simply takes the simplest algorithm.

kind regards,

Jos

[r035198x]

ps. when it comes to those 'fit'algorithms : Donald Knuth already showed in the
'70s that it doesn't matter much: simply takes the simplest algorithm.

kind regards,

Jos

@OP: Revised Simplex algorithm program is not too difficult to make so there is some hope.

@Jos How far would the Nelder Mead method go here? Could it better here than the simplex

P.S Copied to challenges forum

[JosAH]

@OP: Revised Simplex algorithm program is not too difficult to make so there is some hope.

<slashing down all hope/> The simple method or an interior point method can just
give an answer on the 'integer relaxation'. After that you have to apply an nasty
'branch and bound' method that are real show stoppers when the number of
integer variables is large; and in this problem this number can be quite large.

@Jos How far would the Nelder Mead method go here? Could it better here than the simplex

P.S Copied to challenges forum

Nope sorry; it won't be of much use as far as I can tell for now ;-)

kind regards,

Jos

ps. I bet this thing will stay unanswered for a long time in the 'Challenges' forum ;-)

[kamsmartx]

oh
thank
for non solve my problem

[JosAH]

oh
thank
for non solve my problem

?

kind regards,

Jos