Abstract
We consider the problem of generating an optimal plan for radial components insertion on PCBs. The problem is modeled as an integer programming model, but it can easily be shown to be NP-hard. Hence, we propose a heuristic method and test its performance through computational experiments on the actual PCB data obtained from S-electronics company which assemble PCBs for their high-resolution computer display devices. This heuristic method with an easy-to-use graphic user interface is implemented and being used currently.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Jonker, T. Volgenant, 1984, Nonoptimal edges for the symmetric traveling salesman problem, Operations Research, 32, 837–846.
A. Volgenant, R. Jonker, 1982, A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation, European Journal of Operational Research, 9, 83–89.
A. Volgenant, R. Jonker, 1983, The symmetric traveling salesman problem and edge exchanges in minimal 1-trees, European Journal of Operational Research, 12, 394–403
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Chang, S.Y., Hwang, HC., Murty, K.G. (1998). Optimizing the Radial Component Insertion Operations on PCBs. In: Yu, G. (eds) Industrial Applications of Combinatorial Optimization. Applied Optimization, vol 16. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2876-7_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2876-7_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4797-0
Online ISBN: 978-1-4757-2876-7
eBook Packages: Springer Book Archive