>>I have a very complex prob..
>>
>>Our co. being a export firm is having a requirement, the details of which are as follows :-
>>
>>we are shipping goods in various carton sizes which goes into containers of 40ft, 20 ft etc.
>>
>>We try to fill as much goods as possible in a container..(saving each inch of space)
>>
>>Our goods carton size varies from order to order.. what we want is the user should give input of carton sizes i.e.
>>
>>Length X Breadth X Width & in which container (i.e. 40 or 20) wants to put those goods..
>>
>>Program should show a graphical presentation, how goods will be loaded, i.e. how can rows, in which direction horizontal or vertical....so that we can utilize maximum space...
>>
>>This Prob. is so complex that I don't know from where to start it...
>>
>>Any Help/ideas/suggestions are welcome...
>
>Vinod- sounds like quite a challenge. My first suggestion for you is to find a usenet newsgroup where threads like this run rampant. I have browsed through a few where problems like this get asked and answered and even generate week long threads with debate as to how to go about it best. Aside from that here's a seed or two...
>Writing an algorithm that would logically and strategically guess the best place for the cargo items to lay would take a mathematical genius. Since few of us are methematical geniuses, nor do we want to hire them to write an algorithm, you migh want to consider an aproach like this- Place each of the items and their dimensions into an array, and establish variables for the characteristics of the container. Rather than logically laying the cargo in in ways that a human might try them, take advantage of the speed of a computer and 'throw' the packages in the container time after time, measuring the leftover volume and storing the value. You could establish simple rules for arranging the packages, like the first package must alway rest in the corner of the container, and each subsequent package must rest against the packages previously laid down. Force the computer to try a set number of combinations, each comparing its leftover space with the lowest result space yet and if lower, store
>the value and package positions and at the end, have it suggest the combination with the least wasted space. You would have to set up another array to store the position and orientation of each package in the current and best 'tries'.
>However you decide to approach this let us know. I am terribly curious as to how this would best be done, and although I may be no more qualified to answer your question than you yourself, I love to brainstorm on topics like this and would be happy offer more input.
>Good Luck
>
>Erik Moore


Thanks for the Info...

I want to ask few things..
Actually I have never used any newsgroups so I don't know much abt them can you give me some names of any such groups + how to use it...

I planned somewhat what you have suggested that I will store the dimension either in a array or cursor...

you have written establish varialbes for the characteristics of the container..... Can you pls explain this a little more ??

See, theoritically its easy to say to set no. of combinations and run the loop but when I start coding it... I will have to really sit on it and gather as much info. as possible before starting..

I will definately post the final outcome of this here only...

Thanking you again for your reply...