Method for setting a measurement sequence for at least one coordinate measuring machine, including the following steps which are carried out by a computer device: a) obtaining a plurality of surface regions of an object that should be measured by at least one measurement sensor in respect of at least one predetermined property, wherein the measurement sensor should be arranged by the coordinate measuring machine at at least one specific position and/or with at least one specific alignment for the purposes of measuring a respective surface region; and characterized by: b) changing a measurement sequence, in which the surface regions should be measured, multiple times using a first algorithm and using a second algorithm, wherein the algorithms each ascertain a changed measurement sequence and an assessment variable for this particular measurement sequence within the scope of each change; c) selecting one of the measurement sequences on the basis of the ascertained assessment variables, and also characterized in that I) the algorithms are each based on approaches for solving the travelling salesman problem, wherein the first algorithm ascertains an initial measurement sequence as a source sequence for the second algorithm and has a higher computational speed than the second algorithm; or in that II) the algorithms are each based on approaches for solving the travelling salesman problem, wherein the first and the second algorithm are carried out at least partially in parallel, i) wherein the algorithms are different from one another, or ii) the first and the second algorithm are similar but proceed from different initial measurement sequences. a) obtaining a plurality of surface regions of an object that should be measured by at least one measurement sensor in respect of at least one predetermined property, wherein the measurement sensor should be arranged by the coordinate measuring machine at at least one specific position and/or with at least one specific alignment for the purposes of measuring a respective surface region; b) changing a measurement sequence, in which the surface regions should be measured, multiple times using a first algorithm and using a second algorithm, wherein the algorithms each ascertain a changed measurement sequence and an assessment variable for this particular measurement sequence within the scope of each change; c) selecting one of the measurement sequences on the basis of the ascertained assessment variables, I) the algorithms are each based on approaches for solving the travelling salesman problem, wherein the first algorithm ascertains an initial measurement sequence as a source sequence for the second algorithm and has a higher computational speed than the second algorithm; or in that II) the algorithms are each based on approaches for solving the travelling salesman problem, wherein the first and the second algorithm are carried out at least partially in parallel, i) wherein the algorithms are different from one another, or ii) the first and the second algorithm are similar but proceed from different initial measurement sequences. i) wherein the algorithms are different from one another, or ii) the first and the second algorithm are similar but proceed from different initial measurement sequences.