|
|
Posted by Jerry Stuckle on 10/31/06 21:13
fraz wrote:
>>Seriously - I haven't seen anything like that in PHP. But I wouldn't
>>think it would be too hard to convert. Do you have some examples of the
>>C code?
>
>
> <a
> href="http://www.diku.dk/~pisinger/3dbpp.c">http://www.diku.dk/~pisinger/3dbpp.c</a>
>
> I have been checking out this code for the last day when I have time.
> It apparently restricts objects to not be rotatable, and the bins to
> fill are all of the same size. So, in those two respects it is not
> applicable, but I have hopes to modify it to my needs as a last resort.
> It's just a bit dense, but I didn't necessarily expect anything less
> out of the problem.
>
> One constraint though that I could throw into the mix is that I don't
> expect n (no. of items to pack) to exceed, say, 25 in all but the most
> unusual scenarios. Hence, I could get by with a hacky brute force
> heuristic that errs on the side of simpler code rather than an elegant
> algorithm that approaches a "log n" efficiency. Ultimately, I just want
> to be able to abstract the items that are to be packed so that the
> addition of new types of items doesn't throw the whole procedure and
> require a rewrite.
>
>
>>--
>>==================
>>Remove the "x" from my email address
>>Jerry Stuckle
>>JDS Computer Training Corp.
>>jstucklex@attglobal.net
>>==================
>
>
I thought about it some more. And really, your problem isn't much
different than the historic traveling salesman (a salesman has to visit
X cities - what's the shortest distance he has to travel to visit all
cities). It's a great puzzle - and one which has never been solved
except by brute force, AFAIK.
And I think that's what you're going to have to do here, unfortunately.
--
==================
Remove the "x" from my email address
Jerry Stuckle
JDS Computer Training Corp.
jstucklex@attglobal.net
==================
Navigation:
[Reply to this message]
|