Nesting lengths Algorithm

Question

0.00/5 (No votes)

See more: (untagged)

Hi All,

I have a problem with nesting of lengths please suggest me the best way of solving this. my problem is as follows.

I have some standard length lets say Total length (This is the total length which we need to fill with some specific length blocks)

input is list of length blocks eg: 5000, 4000, 3000 .....

and gap between each block is a range eg: 200 to 500 (this gap can be adjusted with in the range)

Now we have to fill the Total length with the above available length blocks with gap between each block and that gap should be with in the gap range given above.

Please suggest me some way of solving this problem.

Thank in advance...

Regards,
Anil

Posted 30-May-12 0:24am

Member 4399771

Add a Solution

Comments

Andreas Gieriet 4-Jun-12 11:41am

You give too little information about constraints.
Is this an optimum calculation? What is a "good enough" solution?
Cheers
Andi

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Andreas Gieriet · Answer 1 · 2012-06-04T06:07:00

Assuming you have
- a total length L_total
- a list of n varying length segments S_i
- possible gaps in the range of [G_min...G_max]

If you have no further constraints (e.g. not all segments need to be placed, and any size of gap can remain at the end), then start to fill randomly (or from begin to end) and leave a G_min between each segement. Stop when there is no segment left or when the next segment can not be placed any more.

This is an obvious solution, but maybe not good enough.

If you have to check for the possible solution where all segments must be places and no trailing gap is allowed, then you calculate the best versus worst case:
1) Sum of all segments: S_total = ∑ S_i
2) Room for all gaps: G_total = L_total - S_total
3) Minimal gaps: G_total(min) = (n-1) x G_min
4) Maximal gaps: G_total(max) = (n-1) x G_max

5) ok if G_total(min) ≤ G_total ≤ G_total(max)

6a) if ok, average gap G_av = G_total / (n-1)
7a) if ok, place one segment S_i after the other and place gap G_av in between.

6b) if not ok, error.

Cheers
Andi