Abstract
In this paper we study the problem of finding placement tours for pick-and-place robots, also known as the printed circuit board assembly problem with m positions on a board, n bins containing m components and n locations for the bins. In the standard model where the working time of the robot is proportional to the distances travelled, the general problem appears as a combination of the travelling salesman problem and the matching problem, and for m=n we have an Euclidean, bipartite travelling salesman problem. We give a polynomial-time algorithm which achieves an approximation guarantee of 3+ε. An important special instance of the problem is the case of a fixed assignment of bins to bin-locations. This appears as a special case of a bipartite TSP satisfying the quadrangle inequality and given some fixed matching arcs. We obtain a 1.8 factor approximation with the stacker crane algorithm of Frederikson, Hecht and Kim. For the general bipartite case we also show a 2.0 factor approximation algorithm which is based on a new insertion technique for bipartite TSPs with quadrangle inequality. Implementations and experiments on “real-world” as well as random point configurations conclude this paper.
Similar content being viewed by others
References
S. Anily and R. Hassin, The swapping problem, Networks 22 (1992) 11–18.
S. Arora, Polynomial time approximation schemes for Euclidian TSP and other geometric problems, in: Proceedings of the 37th Annual IEEE Symposium on the Foundation of Computer Science (1996) pp. 2-12.
M.O. Ball and M.J. Magazine, Sequencing of insertions in printed circuit board assembly, Operations Research 36 (1988) 192–201.
A. Baltz and A. Srivastav, Approximation algorithms for the Euclidean bipartite TSP, Technical report, Mathematisches Seminar, Universität zu Kiel (2001).
A. Baltz, T. Schoer and A. Srivastav, On the bi-partite random travelling salesman problem and its assignment relaxation, in: Lecture Notes in Computer Science 2129 (Springer, 2001) pp. 192-201.
P. Chalasani, R. Motwani and A. Rao, Approximation algorithms for robot grasp and delivery, in: Proceedings of the 2nd Internat. Workshop on Algorithmic Foundation of Robotics (1996).
N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Report 338, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA.
Y. Crama and F.C.R. Spieksma, Scheduling jobs of equal length: Complexity, facets and computational results, Mathematical Programming 72 (1996) 207–227.
Z. Drezner and S.Y. Nof, On optimizing bin packing and insertion plans for assembly robots, IIEE Transactions 16 (1984) 262–270.
J. Edmonds, Matroid intersection, in: Discrete Optimization I, eds. P.L. Hammer, E.L. Johnson and B. Korte, Annals of Discrete Mathematics 4 (North-Holland, Amsterdam, 1979) pp. 39–49.
L.R. Foulds and H.W. Hamacher, Optimal bin-location and sequenzing in printed circuit board assembly, Universität Kaiserslautern (June 1990).
R.L. Francis, H.W. Hamacher, C.Y. Lee and S. Yeralan, Finding placement sequences and bin-locations for Cartesian robots, Research Report, Department of Industrial and Systems Engineering, University of Florida (1991).
A. Frank, A weighted matroid intersection algorithm, Journal of Algorithms 2 (1981) 328–336.
A. Frank, B. Korte, E. Triesch and J. Vygen, On the bipartite travelling salesman problem, Report No. 98866-OR, University of Bonn (1998).
G.N. Frederickson, M.S. Hecht and C.E. Kim, Approximation algorithms for some routing problems, SIAM J. Comput. 7 (1978) 178–193.
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, The Traveling Salesman Problem (Wiley, 1992).
T. Leipälä and O. Nevalainen, Optimization of the movements of a component placement machine, European Journal of Operational Research 38 (1989) 167–177.
C. Michel, Optimierung des Fertigungsprozesses von Leiterplatinen durch approximative Algorithmen, Diplomarbeit, Forschungsinstitut für Diskrete Mathematik, Universität Bonn (1993).
G.L. Nemhauser and L.A.Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
H. Schroeter, Optimierung der Depot-Anordnung bei der Bestückung von Leiterplatinen, Diplomarbeit, Forschungsinstitut für Diskrete Mathematik, Universität Bonn (1993).
E. Triesch, Private communication (1993).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Srivastav, A., Schroeter, H. & Michel, C. Approximation Algorithms for Pick-and-Place Robots. Annals of Operations Research 107, 321–338 (2001). https://doi.org/10.1023/A:1014923704338
Issue Date:
DOI: https://doi.org/10.1023/A:1014923704338