CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

An industrially validated CMM inspection process with sequence constraints

R. Salman ; J. S. Carlson ; F. Ekstedt ; D. Spensieri ; J. Torstensson ; Rikard Söderberg (Institutionen för produkt- och produktionsutveckling)
Procedia CIRP - 6th Cirp Conference on Assembly Technologies and Systems (2212-8271). Vol. 44 (2016), p. 138-143.
[Konferensbidrag, refereegranskat]

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.

Nyckelord: CMM, inspection, automation, task sequences, precedence constraints, generalized travelling salesman problem, sequential ordering problem



Denna post skapades 2016-07-04. Senast ändrad 2016-07-04.
CPL Pubid: 238890

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för produkt- och produktionsutveckling

Ämnesområden

Matematik

Chalmers infrastruktur