Back to Search

Application of sequence-dependent traveling salesman problem in printed circuit board assembly

Title	Application of sequence-dependent traveling salesman problem in printed circuit board assembly
Author	Alkaya, A. F., Duman, Ekrem
Publication Date:	2013-06
Publication Place	- IEEE
Subject	Assembling, Integer programming, Minimisation, Nonlinear programming, Printed circuit design, Printed circuit manufacture, Travelling salesman problems
Type	Periodical
Language	English
Digital	Yes
Manuscript	No
Library:	Özyeğin University
Library Asset ID	2156-3950
Record ID	5bdfd16e-2068-4d38-a1f5-94ac936f569b
Library Location	Industrial Engineering
Date	2013-06
Notes	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text	Optimization issues regarding the automated assembly of printed circuit boards attracted the interest of researchers for several decades. This is because even small gains in assembly time result in very important benefits in mass production. In this paper, the focus is on a particular placement machine type that has a rotational turret and a stationary component magazine. So far, this type of machine received little attention among the researchers. In this paper, the feeder configuration, placement sequencing, and assembly time minimization problems are formulated explicitly and completely (without simplifying assumptions) using nonlinear integer programming. In addition, the placement sequencing problem is shown to be a recently introduced new generalization of the traveling salesman problem (the sequence-dependent traveling salesman). These formulations show the complexity of the problems and the need for effective heuristic designs for solving them. We propose three heuristics that improve previously suggested solution methods and give comparable results when compared to simulated annealing that is a widely accepted good performing metaheuristic on combinatorial optimization problems. The heuristics are experimentally shown to improve previous methods significantly in assembly time that implies a huge economic benefit. The heuristics proposed could also be applied to other placement machines with similar operation principles.
DOI	10.1109/TCPMT.2013.2252429
Cilt	3

View in source Özyeğin University Özyeğin University - Historical works, archives, and periodicals search engine

Özyeğin University

Application of sequence-dependent traveling salesman problem in printed circuit board assembly

Author Alkaya, A. F., Duman, Ekrem

Publication Date 2013-06

Publication Place - IEEE

Subject Assembling, Integer programming, Minimisation, Nonlinear programming, Printed circuit design, Printed circuit manufacture, Travelling salesman problems

Type Periodical

Language English

Digital Yes

Manuscript No

Library Özyeğin University

Library Asset ID 2156-3950

Record ID 5bdfd16e-2068-4d38-a1f5-94ac936f569b

Library Location Industrial Engineering

Date 2013-06

Notes Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Sample Text Optimization issues regarding the automated assembly of printed circuit boards attracted the interest of researchers for several decades. This is because even small gains in assembly time result in very important benefits in mass production. In this paper, the focus is on a particular placement machine type that has a rotational turret and a stationary component magazine. So far, this type of machine received little attention among the researchers. In this paper, the feeder configuration, placement sequencing, and assembly time minimization problems are formulated explicitly and completely (without simplifying assumptions) using nonlinear integer programming. In addition, the placement sequencing problem is shown to be a recently introduced new generalization of the traveling salesman problem (the sequence-dependent traveling salesman). These formulations show the complexity of the problems and the need for effective heuristic designs for solving them. We propose three heuristics that improve previously suggested solution methods and give comparable results when compared to simulated annealing that is a widely accepted good performing metaheuristic on combinatorial optimization problems. The heuristics are experimentally shown to improve previous methods significantly in assembly time that implies a huge economic benefit. The heuristics proposed could also be applied to other placement machines with similar operation principles.

DOI 10.1109/TCPMT.2013.2252429

Cilt 3