DXF export in Cutting Optimization pro

August 3rd, 2012

Starting with version we can export diagrams to dxf format. Just run an optimization and then press the “DXF” button found in the main toolbar.

Currently we save everything (the sheet, the pieces and their sizes) in a single layout … but soon we will introduce more options so that the user can customize to output.

Moving demand pieces between multiple sheets

July 26th, 2012

Starting with version 5601 of Cutting Optimization pro we have introduced the ability to move parts from one sheet to another.

There is a temporary panel (placed in the right side of the image) which is used for this purpose.

Here are the steps:

– Run the optimization.

– Drag any piece (from a sheet) to the right panel (in is a grayed area at the right of the sheet). A label with size of the piece (i.e. 100×200) should be created there. Drop the piece on the panel.

– Switch to another sheet where you want to place the piece.

– Drag the piece from the temporary panel to the new sheet. Drop it in the waste where you want to have it.

that is all!

here is a short movie with this operation:

Working with products in Cutting Optimization pro

July 9th, 2012

I have just created a short movie showing how to work with products. You may watch it here:

Products in Cutting Optimization pro is a feature that will reduce the time spent to enter repetitive data in Cutting Optimization pro.

Imagine that you created a chair, or any other furniture. You know its components. You know that it has a part of 1000×500 size and 2 parts of 500×500.

If your customers want that chair, you have to introduce its sizes multiple times (once for each customer).

If you use products, you could introduce the sizes only once … and then you may added it to demand each time you need it.

Here are the steps for creating and using a product.

1. Go to menu Products | Show products.

2. Create a new product by pressing button “+”. Give a name to product.

3. Add the components of product in the table below. This has a similar structure with the Demand table from the main window of the Cutting Optimization pro.

4. Press ok. The product has been created and we can use it.

5. Now, assume that a customer wants 2 chairs (your product). Go to menu Products | Add product to demand.

6. From the list of the products select the one that you want to add it.

7. You may specify the quantity (how many copies of that product you want).

8. You may also re-assign the materials that are used to create that product.

9. Press Ok, and the product will be added to the current demand. You will see the sizes of the product’s parts added to demand list.

10. Start the optimization…

Fractional input in Cutting Optimization pro

July 9th, 2012

In version 5 of the Cutting Optimization pro we have introduced fractional input (i.e. you may introduce 100 1/2 instead of 100.5). The rules are the same as those outlined for our Simple Cutting Software. Please check this post for more details:


Migrating to Real Cut 1D version 9

May 19th, 2012

In version 9 of the Real Cut 1D we have changed the order of columns for Demand parts. We did that in order to improve data exchange with Excel.

If you previously saved your data in native files (with extension 1d) you dont have to do anything. Real Cut 1D knows how to load its own files.

However, if you did saved your data in csv or excel files, you will have to modify them by reordering the columns.
Here is what you have to do:

– open the csv or xls file in Excel.
– move the angle1 and angle 2 columns at the right of the existing columns.
– delete the empty columns 3 and 4 which have resulted as effect of moving columns with angles.
– exchange the height column with quantity column.

Here is an example:

– csv file from version 8 or less:



in version 9 this becomes:



Pay a special attention to list separator. In some regions the separator is “,”. In some others is “;”. If the separator is incorrectly set you will get an error.
You may change the separator from menu Start | Control panels | Region and language | Additional settings| List separator of the Windows 7.

Fractional input in Real Cut 2D too

May 19th, 2012

now we have fractional inputs in Real Cut 2D starting with version 8 which can be downloaded from here:


Please read this post in order to see the details related to fractional inputs:


Fractional input in Simple Cutting Software

May 11th, 2012

Starting with version 2 of our Simple Cutting Software we have introduced an important feature: the ability to handle fractional values.

For instance, instead of typing 100.5, you may do this more elegantly with 100 1/2 (please note that blank space between 100 and 1/2).

Width, Height of parts and stock can be typed in as fractional values. Also, the parameters of the optimization can be fractional.

Here is a movie showing the new feature:

You cannot specify any value as fractional. For instance you cannot specify 100 1/3, because this means 100.33333333333… and in real-world you cannot cut with this precision.

So, all fractions will be rounded to some value. The rounding parameter is specified in Settings | Round all fractions to.

Rounding happens as follow:

– parts are rounded up (ex: 1/3 is rounded up to 1/2 – the actual value depends on the rounding parameter).

– stock pieces are rounded down (2/3 is rounded to 1/2).

– cutter thickness is rounded up.

– break size is rounded up.

– maximal cut length is rounded down.

One more thing: You cannot mix fractional values with real values (containing the decimal symbol “.”). For instance you cannot specify both 100 1/2 and 510.34 ! Choose one option only and stick with it!

Delphi 64 bit example for Cut 2D X

May 11th, 2012

XE2 version of Delphi can finally generate 64bit applications.

We have succeeded in creating a Delphi 64bit example-application for our 64bit version of the Cut2DX. Previously we have integrated our component in 64bit applications created with Visual Studio (C#, C++ and VB).

Delphi XE2 IDE is a 32 bit application. Because of that you cannot install a 64bit component in the Component Palette.  So, this time, you cannot drag the component as you did in the previous editions of Delphi. Instead, you have to manually create an instance of the component at the runtime.

So, here the are steps:

1. Make sure that 64bit edition was previously registered with regsvr32.exe (the one located in system32 folder!).

2. Create a VCL based application.

3. From Project Manager (located in the right side of the screen),  right click the Target Platforms, choose Add Platform | 64 bit Windows.

4. From menu Component select Import Component | Type library.

5. From the list of registered type libraries, select optimal2dx_64Lib, then next.

6. No need to specify a Palette page, because anyway the component will not appear there.

7. Add unit to the current project. Finish.

8. Add optimal2dx_64Lib_TLB to the list of units used the current project.

9. Declare a variable: cut2d64: TCut2DX.

10.  Create an instance of TCut2DX during the FormCreate event:
cut2d64 := TCut2DX.Create(Form1);

11. Create 2 event handlers for OnFinish and OnProgress events. Add the declarations in the interface:

procedure OnFinish(Sender: TObject);
procedure OnProgress(Sender: TObject);

12. Implement them as you need:

procedure TForm1.OnFinish(Sender: TObject);


13. Assign the handlers to the current instance. You may do this just after you have created the instance:

cut2d64.OnFinish := OnFinish;
cut2d64.OnProgress := OnProgress;

14. Destroy the instance of TCut2DX during the OnClose event of the form:


Speed test for 1d optimization

April 29th, 2012

We have reduced the running time of 1d optimization for large data. Here is a test with RealCut1D which has to cut 174000 demand parts from 200000 inventory bars.

The optimization took only 0.33 seconds, however in the end-user software (Real Cut 1D) few more seconds are needed to compute all statistics and to display the results.

About the cutting and nesting optimization problem

October 17th, 2010

The cutting optimization problem belongs to the class of Nondeterminist Polynomial Complete (NP-Complete) problems [1]. Other problems in this class are the Hamiltonian pathTravelling SalesmanSubset sumCliqueIndependent setGraph colouring etc. All these problems have been deeply analyzed by a huge number of researchers, but no polynomial-time algorithm was discovered for them. This has a direct consequence over the running time and the quality of the optimization.

A polynomial-time algorithm is that one whose running time is bounded by a polynomial function of its input size. For instance, if we have n = 1000 pieces to cut and the cutting algorithm would have the complexity O(n2), then the running time would have been directly and linear proportional to 10002 which is (106) units of time. Assuming that our computers can perform 109 operations per second, the cutting optimization algorithm would run in less than a fraction of a second. Sadly, this is not the case for the cutting optimization problem. There is no such fast algorithm for solving it.

The only perfect algorithm for solving the cutting optimization problem is an exponential one. An exponential algorithm will run in an exponential amount of time (2n, 3nn! – where n is the number of pieces to be optimized). Thus, even for small instances (lets say 1000 pieces) an exponential algorithm will run as follows:

  • if the complexity is 2n , then the total number of operations is 21000 which can be approximated by 10300. Knowing that our computers can perform 109 operations / second we need 10291 second to run the algorithm. One year has about 108 seconds. This means that our algorithm would run in 10283 years. This is a huge value compared to the age of the universe which is only 109 years.
  • if the complexity is 3n , then the total number of operations is 31000 which can be approximated by 10477.
  • if the complexity is n! , then the total number of operations is 1000! which can be approximated by 102567.

These algorithms run in an impressive number of years. Even if we put all computers in the world to solve the problem in parallel we still don’t get a significant improvement in speed.

This is why another possibility (which is employed by our software too) is to use heuristics or approximation algorithms. A heuristic is an algorithm which is fast and returns a good solution (often the best one) of the problem. However,there is no guarantee that the obtained solution is the optimal one.

An important parameter of the software is the OptimizationLevel. This will basically tell how many configurations are explored before the best found solutions is outputted. If you set the OptimizationLevel to very low value you will obtain a solution very fast. But the quality of the solution might be not so good. If you set the OptimizationLevel to very high value you will obtain a good solution but not so fast. Thus, one must employ a trade-off between the quality of the solutions and the running time.


[1].      Garey, M.R., Johnson D.S., Computers and Intractability: A Guide to NP-completeness, Freeman & Co, San Francisco, USA, 1979.