A survey of surface mount device placement machine optimisation: Machine classification

M Ayob, G Kendall - European Journal of Operational Research, 2008 - Elsevier
The optimisation of a printed circuit board assembly line is mainly influenced by the
constraints of the surface mount device (SMD) placement machine and the characteristics of …

Combining new fast opposite gradient search with ant colony optimization for solving travelling salesman problem

T Saenphon, S Phimoltares, C Lursinsap - Engineering Applications of …, 2014 - Elsevier
Most of the discrete optimization techniques based on evolutionary computing did not
deploy and involve the actual geometrical structure of objective function in the process of …

The quadratic assignment problem in the context of the printed circuit board assembly process

E Duman, I Or - Computers & Operations Research, 2007 - Elsevier
The sequencing of placement and the configuration of the feeder is among the main
problems involved in printed circuit board (PCB) assembly optimization. In some machine …

The optimisation of the single surface mount device placement machine in printed circuit board assembly: a survey

M Ayob, G Kendall - International Journal of Systems Science, 2009 - Taylor & Francis
This article surveys research on the single surface mount device (SMD) placement machine
optimisation problem. We classify the optimisation problem into five sub-problems: feeder …

[HTML][HTML] Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly

AF Alkaya, E Duman - Discrete Applied Mathematics, 2015 - Elsevier
In this study we undertake the optimization of chip shooter component placement machines
which became popular in assembling printed circuit boards (PCB) in recent years. A PCB is …

Hybrid genetic algorithm approach for precedence-constrained sequencing problem

YS Yun, HS Chung, C Moon - Computers & Industrial Engineering, 2013 - Elsevier
The objective of precedence-constrained sequencing problem (PCSP) is to locate the
optimal sequence with the shortest traveling time among all feasible sequences. Various …

Genetic algorithm approach for precedence-constrained sequencing problems

YS Yun, C Moon - Journal of Intelligent Manufacturing, 2011 - Springer
In this paper we propose a genetic algorithm (GA) approach based on a topological sort (TS)-
based representation procedure for effectively solving precedence-constrained sequencing …

Solving a new application of asymmetric TSP by modified migrating birds optimization algorithm

T Duman, E Duman - Evolutionary Intelligence, 2024 - Springer
In this study, we first introduce a new application of the asymmetric traveling salesman
problem which is about a small restaurant with one cook and a single stove. Once a meal …

IAM-TSP: Iterative Approximate Methods for Solving the Travelling Salesman Problem.

E Alkafaween, S Elmougy, E Essa… - International …, 2023 - search.ebscohost.com
TSP is a well-known combinatorial optimization problem with several practical applications.
It is an NP-hard problem, which means that the optimal solution for huge numbers of …

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

AF Alkaya, E Duman - IEEE transactions on components …, 2013 - ieeexplore.ieee.org
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 …