New Models and Heuristics for Component Placement in Printed Circuit Board Assembly

Authors:
Affiliations:
Venue:
ICIIS '99 Proceedings of the 1999 International Conference on Information Intelligence and Systems
Year:
1999

Citing 0
Cited 6

Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Embedded local search approaches for routing optimization

Computers and Operations Research
A Genetic Optimization Approach to Optimize the Multi-head Surface Mount Placement Machine

ICIRA '08 Proceedings of the First International Conference on Intelligent Robotics and Applications: Part II
Regularisation of 3D Signed Distance Fields

SCIA '09 Proceedings of the 16th Scandinavian Conference on Image Analysis
An aggregated optimization model for multi-head SMD placements

Computers and Industrial Engineering
A model to optimize placement operations on dual-head placement machines

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers an optimization problem arising in the automated manufacture of printed circuit boards. An essential part of this problem is to determine good component pick and place sequences as this can reduce the overall assembly time significantly. This component placement sequence problem can be modeled as a Travelling Salesman Problem, however complex machine and process specifications also arise in practical assembly problems. We describe the variety of placement machinery, providing new, detailed models for a variety of complex assembly problems. Of special interest is the case of a multi-headed placement machine for which we develop a new model and heuristic solution approaches.