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.

sequential ordering problem

automation

generalized travelling salesman problem

inspection

task sequences

precedence constraints

CMM

Författare

R. Salman

Fraunhofer-Chalmers centrum for industrimatematik - FCC

Johan Carlson

Fraunhofer-Chalmers centrum for industrimatematik - FCC

F. Ekstedt

Fraunhofer-Chalmers centrum for industrimatematik - FCC

D. Spensieri

Fraunhofer-Chalmers centrum for industrimatematik - FCC

J. Torstensson

Fraunhofer-Chalmers centrum for industrimatematik - FCC

Rikard Söderberg

Chalmers, Produkt- och produktionsutveckling, Produktutveckling

Proceedings of SPIE - The International Society for Optical Engineering

0277786X (ISSN) 1996756X (eISSN)

Vol. 44 138-143

Ämneskategorier (SSIF 2011)

Matematik

DOI

10.1016/j.procir.2016.02.136

Mer information

Skapat

2017-10-07