A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines

Anupam Seth, Diego Klabjan*, Placid M. Ferreira

*Corresponding author for this work

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

This paper presents the development of a novel vehicle-routing-based algorithm for optimizing component pick-up and placement on a collect-and-place type machine in printed circuit board manufacturing. We present a two-phase heuristic that produces solutions of remarkable quality with respect to other known approaches in a reasonable amount of computational time. In the first phase, a construction procedure is used combining greedy aspects and solutions to subproblems modeled as a generalized traveling salesman problem and quadratic assignment problem. In the second phase, this initial solution is refined through an iterative framework requiring an integer programming step. A detailed description of the heuristic is provided and extensive computational results are presented.

Original languageEnglish (US)
Pages (from-to)1-45
Number of pages45
JournalMathematical Programming Computation
Volume8
Issue number1
DOIs
StatePublished - Mar 1 2016

Keywords

  • Generalized TSP
  • Heuristic
  • Integer programming
  • Local search
  • Printed circuit board
  • Vehicle-routing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software

Fingerprint Dive into the research topics of 'A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines'. Together they form a unique fingerprint.

Cite this