An industrially validated CMM inspection process with sequence constraints
Paper i proceeding, 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

Författare

R. Salman

Stiftelsen Fraunhofer-Chalmers Centrum för Industrimatematik

Johan Carlson

Stiftelsen Fraunhofer-Chalmers Centrum för Industrimatematik

F. Ekstedt

Stiftelsen Fraunhofer-Chalmers Centrum för Industrimatematik

D. Spensieri

Stiftelsen Fraunhofer-Chalmers Centrum för Industrimatematik

J. Torstensson

Stiftelsen Fraunhofer-Chalmers Centrum för Industrimatematik

Rikard Söderberg

Chalmers, Produkt- och produktionsutveckling, Produktutveckling

Procedia CIRP

22128271 (ISSN)

Vol. 44 138-143

Ämneskategorier

Matematik

DOI

10.1016/j.procir.2016.02.136