Automatic trueshape nesting software

The new nesting engine is the result of our extensive experience in nesting over many years and our absolut belief that we can make the best nesting software in the world. When developing this module we have carefully looked at the latest research in the field. This has enabled us to develop what we think is one of the best nesting engines in the world.
In order to compare different nesting software there are a set of literature benchmark problems that can be used. See this page for all the academic problems. Academic problems.

Literature benchmark sample Albano 90 deg incremental rotation. Nested height 9980.0

In addition to the standard literature benchmark problems our engine can handle geometry that most other CAM/Nesting software can hardly load into their system.

Try to do this with any other nesting software!

75 parts nested
Part to part distance is 4.0 mm
The parts consists of 9476 segments each! 
Sheet size 1000x1000 mm
DXF file for this part Part.dxf

Sample movie

FEATURES

• Trueshape nesting
  Can nest any type of geometry with holes.
• Rest sheets
  Can nest on any sheet geometry with holes. Can also define clamps and other areas not allowed for nesting.
• Continued nesting
  Can continue to nest on an allready nested sheet.
• Multiple sheets
  Nests on any number of different sheets.
• Nest inside holes
  Can nest inside holes of other parts.
• Multiple cutting heads
  Advanced multiple cutting head nesting. Supports automatic variable head distance and quantity.
• Simple interface
  Despite it’s power the user interface is very easy to understand and use.
• Single parts
  Special single part pattern layout algorithms.
• Fast!
  Extremly fast.
  Outperforms most other software. For example, we are more than 5 times faster than NestLib®.
  Nestlib® is the nesting engine we used before, and they claim to be one of the fastest nesting libraries available.
  Technical note:
  Since our new nesting engine is an optimizer based engine, speed is important. This means that we nest the same parts over and over again changing some parameters between each trial. This method of finding the best solution is the most common among the top nesting engines today. Depending on how this so called "meta heuristic" search is done it will have different names such as Simulated Annealing, Hillclimbing, Tabu search and Genetic algorithms etc. We use a modified Hillclimbing approach that we have found works well in a variety of cases. The goal is to automatically perform a very good result without the user needing to change alot of parameters guiding the search. So our extreem speed enables us to investigate many more possible solutions than our competitors giving us a better chance of finding a good result faster.

See also our manual- and gridbased nesting commands. More nesting 

References

Click to enlarge!