An industrially validated CMM inspection process with sequence constraints
Paper in proceedings, 2016

An efficient CMM inspection process implemented in industry gives significant productivity improvements. A key part of this improvement is the optimization of the inspection sequences. To ensure quality of the inspection the sequences are often constrained with respect to the order of the measurements. This gives rise to so called precedence constraints when modelling the inspection sequence as a variation of the travelling salesperson problem (TSP). Two heuristic solution approaches and a generic optimizing algorithm are considered. A generation based stochastic algorithm is found to reduce cycle time by as much as 12% in comparison to the currently used algorithm.

task sequences

CMM

generalized travelling salesman problem

inspection

sequential ordering problem

precedence constraints

automation

Author

R. Salman

Fraunhofer-Chalmers Centre

Johan Carlson

Fraunhofer-Chalmers Centre

F. Ekstedt

Fraunhofer-Chalmers Centre

D. Spensieri

Fraunhofer-Chalmers Centre

J. Torstensson

Fraunhofer-Chalmers Centre

Rikard Söderberg

Chalmers, Product and Production Development, Product Development

Procedia CIRP

22128271 (ISSN)

Vol. 44 138-143

Subject Categories

Mathematics

DOI

10.1016/j.procir.2016.02.136

More information

Latest update

3/20/2018