Optimization of the movements of a component placement machine
The efficient operation of an automatic electronic component placement machine is considered. The machine inserts electronic components into predefined places on a printed circuit board. The components are supplied from a set of feeders each containing a sequence of identical components. We treat the problem as two different sequencing problems. The optimal insertion sequence for a fixed feeder setting is obtained by considering the problem as a three-dimensional asymmetric traveling salesman problem. The optimal permutation of the components in the feeders for a fixed insertion sequence can be formulated as a quadratic assignment problem. The overall problem is solved heuristically and this approach brings suboptimal, but in practice good enough component insertion sequences and feeder permutations.
- Optimal Robotic Component Placement
- Component Fixture Positioning/Sequencing for Printed Circuit Board Assembly with Concurrent Operations
- Routing heuristics for automated pick and place machines
- Heuristics approach to printed circuit board insertion problem
- Modelling the operations of a component placement machine with rotational turret and stationary component magazine
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3752234 (Why is no real title available?)
- Local Search for the Asymmetric Traveling Salesman Problem
- Numerical investigations on quadratic assignment problems
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
- Quadratic assignment problems
- The relative neighbourhood graph of a finite planar set
- Travelling salesman problem tools for microcomputers
- The assembly of printed circuit boards: A case with multiple machines and multiple board types
- Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees.
- Optimization of printed circuit board manufacturing: Integrated modeling and algorithms
- A triple objective function with a Chebychev dynamic pick-and-place point specification approach to optimise the surface mount placement machine
- Routing heuristics for automated pick and place machines
- Optimal bin location and sequencing in printed circuit board assembly
- Construction of component tapes for radial placement machines
- A model to optimize placement operations on dual-head placement machines
- Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly
- Alternating TSP and printed circuit board assembly
- Integrated optimization of high-precision placement machines based on genetic algorithm
- Heuristics approach to printed circuit board insertion problem
- Efficient operation methods for a component placement machine using the patterns on printed circuit boards
- Estimating printed circuit board assembly times using neural networks
- Minimizing the assembly cycle time on a revolver gantry machine
- Feeder assignment optimization algorithm for multi-head mounter
- Efficient operation of a surface mounting machine with a multihead turret
- Fast movement strategies for a step‐and‐scan wafer stepper
- Precedence constrained TSP arising in printed circuit board assembly
- scientific article; zbMATH DE number 1445308 (Why is no real title available?)
- The optimisation of the single surface mount device placement machine in printed circuit board assembly: a survey
- Modelling the operations of a component placement machine with rotational turret and stationary component magazine
- Optimal Robotic Component Placement
- A taboo search heuristic for the optimisation of a multistage component placement system
- Production planning problems in printed circuit board assembly
- The bipartite travelling salesman problem: a pyramidally solvable case
- On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices
- The quadratic assignment problem in the context of the printed circuit board assembly process
- A note on a motion control problem for a placement machine
This page was built for publication: Optimization of the movements of a component placement machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111924)
