Click here to Skip to main content
15,901,205 members
Please Sign up or sign in to vote.
1.00/5 (3 votes)
See more:
Provide a heuristic solution to the following packing problem:
We have a strip with a width of one meter and an infinite length
We want to place the given shapes in the form of circle, square and rectangle on it so that they do not overlap and use the least length of tape.
Provide a heuristic solution for it and implement your solution and test it on the attached dataset.

Explanation that in the attached data set, C means circle, B means square and R means rectangle, and the numbers in front of them specify their size in centimeters.

What I have tried:

Excuse me I'm Anvar_v and i want you help me.


Provide a heuristic solution to the following packing problem:
We have a strip with a width of one meter and an infinite length
We want to place the given shapes in the form of circle, square and rectangle on it so that they do not overlap and use the least length of tape.
Provide a heuristic solution for it and implement your solution and test it on the attached dataset.

Explanation that in the attached data set, C means circle, B means square and R means rectangle, and the numbers in front of them specify their size in centimeters.
Posted
Updated 27-Jan-23 1:53am
v2
Comments
PIEBALDconsult 27-Jan-23 7:54am    
Stand them on edge.

1 solution

Sorry, this site is not here to do your work for you. Especially since this is definitely an assignment designed to test your understanding of the subject, not anyone else's.
 
Share this answer
 

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



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900