A data processing apparatus for route optimization in logistics, comprising a memory including a computer program code, and at least two processors (110, 116), which are configured to execute the computer program code, said computer program code comprising: a component program (112, 118) run in parallel on the at least two processors (110, 116) to form respective solution components comprising a plurality of points, and to store the formed solution components in the memory, wherein the solution components comprise a plurality of individual routes (106; 950, 952, 954, 956) comprising the plurality of points; characterized by: a solution program (114, 120) runs in parallel on the at least two processors (110, 116), wherein each of the at least two processors (110, 116) is assigned a different starting point, to generate a solution by adding a plurality of solution components sequentially read from the memory, the solution components determined by: determining a key point, the key point provided in a solution component and defining a point which provides a lowest cost of providing said logistics route if incorporated into a further solution component, selecting a first solution and determining a key point for the first solution; determining a second solution component comprising the key point and further not comprising a common point with a first solution component such that the first solution component has no overlapping points with the second solution component; determining a further key point for the first solution and determining an unused solution component (954,956) that comprises the further key point and as few as possible overlapping points with the solution components (950, 952); selecting solution components until all points have been selected or no more components including a key point can be found in the library of solution components; and wherein the solution program (114, 120) additionally places, after the removal of overlaps, individual solution points (938, 940) still unselected by that time, in the solution components (956, 962) of the solution, which have already been selected. a component program (112, 118) run in parallel on the at least two processors (110, 116) to form respective solution components comprising a plurality of points, and to store the formed solution components in the memory, wherein the solution components comprise a plurality of individual routes (106; 950, 952, 954, 956) comprising the plurality of points; characterized by: a solution program (114, 120) runs in parallel on the at least two processors (110, 116), wherein each of the at least two processors (110, 116) is assigned a different starting point, to generate a solution by adding a plurality of solution components sequentially read from the memory, the solution components determined by: determining a key point, the key point provided in a solution component and defining a point which provides a lowest cost of providing said logistics route if incorporated into a further solution component, selecting a first solution and determining a key point for the first solution; determining a second solution component comprising the key point and further not comprising a common point with a first solution component such that the first solution component has no overlapping points with the second solution component; determining a further key point for the first solution and determining an unused solution component (954,956) that comprises the further key point and as few as possible overlapping points with the solution components (950, 952); selecting solution components until all points have been selected or no more components including a key point can be found in the library of solution components; and wherein the solution program (114, 120) additionally places, after the removal of overlaps, individual solution points (938, 940) still unselected by that time, in the solution components (956, 962) of the solution, which have already been selected. determining a key point, the key point provided in a solution component and defining a point which provides a lowest cost of providing said logistics route if incorporated into a further solution component, selecting a first solution and determining a key point for the first solution; determining a second solution component comprising the key point and further not comprising a common point with a first solution component such that the first solution component has no overlapping points with the second solution component; determining a further key point for the first solution and determining an unused solution component (954,956) that comprises the further key point and as few as possible overlapping points with the solution components (950, 952); selecting solution components until all points have been selected or no more components including a key point can be found in the library of solution components; and wherein the solution program (114, 120) additionally places, after the removal of overlaps, individual solution points (938, 940) still unselected by that time, in the solution components (956, 962) of the solution, which have already been selected.