Path optimization for electrical PCB inspections with alignment operations using multiple cameras

被引:2
作者
Katagiri, Hideki [1 ]
Qingqiang, Guo [2 ]
Bin, Wang [1 ]
Muranaka, Tomoyuki [1 ]
Hamori, Hiroshi [3 ]
Kato, Kosuke [4 ]
机构
[1] Hiroshima Univ, Higashihiroshima 7398527, Japan
[2] Ericsson, Beijing 100102, Peoples R China
[3] Hiroshima Inst Technol, OHT Inc, Fukuyama, Hiroshima 7202103, Japan
[4] Hiroshima Inst Technol, Saeki Ku, Hiroshima 7315193, Japan
来源
KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS 19TH ANNUAL CONFERENCE, KES-2015 | 2015年 / 60卷
关键词
Printed circuit board (PCB); inspection path optimization; alignment; generalized traveling salesman problem; pickup and delivery traveling salesman problem; TRAVELING SALESMAN PROBLEM; PICKUP; FORMULATIONS; HEURISTICS; ALGORITHM; SEARCH;
D O I
10.1016/j.procs.2015.08.150
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper considers an optimization problem that is to minimize a total path length for inspecting all the wiring patterns of printed circuit boards arrayed on a plane. It is shown that the problem is formulated as a generalized pickup and delivery traveling salesman problem or generalized traveling salesman problem with pickup and delivery, which is a combination of generalized traveling salesman problems and pickup and delivery traveling salesman problems. In order to solve large-scale real-world problems with a practical computational time, an efficient heuristic algorithm is proposed. (C) 2015 The Authors. Published by Elsevier B.V.
引用
收藏
页码:1051 / 1060
页数:10
相关论文
共 25 条
[1]   Optimization of printed circuit board manufacturing:: Integrated modeling and algorithms [J].
Altinkemer, K ;
Kazaz, B ;
Köksalan, M ;
Moskowitz, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 124 (02) :409-421
[2]   The optimization of printed circuit board manufacturing by improving the drilling process productivity [J].
Ancau, Mircea .
COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 55 (02) :279-294
[3]   Static pickup and delivery problems: a classification scheme and survey [J].
Berbeglia, Gerardo ;
Cordeau, Jean-Francois ;
Gribkovskaia, Irina ;
Laporte, Gilbert .
TOP, 2007, 15 (01) :1-31
[4]   DYNAMIC PROBE SCHEDULING OPTIMIZATION FOR MCM SUBSTRATE TEST [J].
CHOU, NC ;
CHENG, CK ;
RUSSELL, TC .
IEEE TRANSACTIONS ON COMPONENTS PACKAGING AND MANUFACTURING TECHNOLOGY PART B-ADVANCED PACKAGING, 1994, 17 (02) :182-189
[5]   Production planning problems in printed circuit board assembly [J].
Crama, Y ;
van de Klundert, J ;
Spieksma, FCR .
DISCRETE APPLIED MATHEMATICS, 2002, 123 (1-3) :339-361
[6]   A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS [J].
CROES, GA .
OPERATIONS RESEARCH, 1958, 6 (06) :791-812
[7]   Construction heuristics for generating tool paths for laser cutters [J].
Dewil, Reginald ;
Vansteenwegen, Pieter ;
Cattrysse, Dirk .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (20) :5965-5984
[8]   The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm [J].
Dumitrescu, Irina ;
Ropke, Stefan ;
Cordeau, Jean-Francois ;
Laporte, Gilbert .
MATHEMATICAL PROGRAMMING, 2010, 121 (02) :269-305
[9]   A branch-and-cut algorithm for the symmetric generalized traveling salesman problem [J].
Fischetti, M ;
Gonzalez, JJS ;
Toth, P .
OPERATIONS RESEARCH, 1997, 45 (03) :378-394
[10]  
Gharehgozli AH, TRANSPORTAT IN PRESS