A Multi-Objective Optimization Approach for Multi-Head Beam-Type Placement Machines

This paper addresses a highly challenging scheduling problem in the field of printed circuit board (PCB) assembly systems using Surface Mounting Devices (SMD). After describing some challenging optimization sub-problems relating to the heads of multi-head surface mounting placement machines, we formulate an integrated multi-objective mathematical model considering of two main sub-problems simultaneously. The proposed model is a mixed integer nonlinear programming one which is very complex to be solved optimally. Therefore, it is first converted into a linearized model and then solved using an efficient multi-objective approach, i.e., the augmented epsilon constraint method. An illustrative example is also provided to show the usefulness and applicability of the proposed model and solution method.PCB assembly. Multi-head beam-type placement machine. Multi-objective mathematical programming. Augmented epsilon-constraint method

An Aggregated Optimization Model for Multi-Head SMD Placements

In this article we propose an aggregate optimization approach by formulating the multi-head SMD placement optimization problem into a mixed integer program (MIP) with the variables based on batches of components. This MIP is tractable and effective in balancing workload among placement heads, minimizing the number of nozzle exchanges, and improving handling class. The handling class which specifies the traveling speed of the robot arm, to the best of our knowledge, has been for the first time incorporated in an optimization model. While the MIP produces an optimal planning for batches of components, a new sequencing heuristics is developed in order to determine the final sequence of component placements based on the outputs of the MIP. This two-stage approach guarantees a good feasible solution to the multi-head SMD placement optimization problem. The computational performance is examined using real industrial data.Multi-head surface mounting device;Component placement;Variable placement speed

Fitting Jump Models

We describe a new framework for fitting jump models to a sequence of data. The key idea is to alternate between minimizing a loss function to fit multiple model parameters, and minimizing a discrete loss function to determine which set of model parameters is active at each data point. The framework is quite general and encompasses popular classes of models, such as hidden Markov models and piecewise affine models. The shape of the chosen loss functions to minimize determine the shape of the resulting jump model.Comment: Accepted for publication in Automatic

An Autonomous Surface Vehicle for Long Term Operations

Environmental monitoring of marine environments presents several challenges: the harshness of the environment, the often remote location, and most importantly, the vast area it covers. Manual operations are time consuming, often dangerous, and labor intensive. Operations from oceanographic vessels are costly and limited to open seas and generally deeper bodies of water. In addition, with lake, river, and ocean shoreline being a finite resource, waterfront property presents an ever increasing valued commodity, requiring exploration and continued monitoring of remote waterways. In order to efficiently explore and monitor currently known marine environments as well as reach and explore remote areas of interest, we present a design of an autonomous surface vehicle (ASV) with the power to cover large areas, the payload capacity to carry sufficient power and sensor equipment, and enough fuel to remain on task for extended periods. An analysis of the design and a discussion on lessons learned during deployments is presented in this paper.Comment: In proceedings of MTS/IEEE OCEANS, 2018, Charlesto

Comparison of a bat and genetic algorithm generated sequence against lead through programming when assembling a PCB using a 6 axis robot with multiple motions and speeds

An optimal component feeder arrangement and robotic placement sequence are both important for improving assembly efficiency. Both problems are combinatorial in nature and known to be NP-hard. This paper presents a novel discrete hybrid bat-inspired algorithm for solving the feeder slot assignment and placement sequence problem encountered when planning robotic assembly of electronic components. In our method, we use the concepts of swap operators and swap sequence to redefine position, and velocity operators from the basic bat algorithm. Furthermore, we propose an improved local search method based on genetic operators of crossover and mutation enhanced by the 2-opt search procedure. The algorithm is formulated with the objective of minimizing the total traveling distance of the pick and place device. Through numerical experiments, using a real PCB assembly scenario, we demonstrate the considerable effectiveness of the proposed discrete Bat Algorithm (BA) to improve selection of feeder arrangement and placement sequence in PCB assembly operations and achieve high throughput production. The results also highlighted that the even though the algorithms out performed traditional lead through programming techniques, the programmer must consider the influence of different robot motions

An MILP model and a hybrid evolutionary algorithm for integrated operation optimisation of multi-head surface mounting machines in PCB assembly

This paper focuses on an operation optimisation problem for a class of multi-head surface mounting machines in printed circuit board assembly lines. The problem involves five interrelated sub-problems: assigning nozzle types as well as components to heads, assigning feeders to slots and determining component pickup and placement sequences. According to the depth of making decisions, the sub-problems are first classified into two layers. Based on the classification, a two-stage mixed-integer linear programming (MILP) is developed to describe it and a two-stage problem-solving frame with a hybrid evolutionary algorithm (HEA) is proposed. In the first stage, a constructive heuristic is developed to determine the set of nozzle types assigned to each head and the total number of assembly cycles; in the second stage, constructive heuristics, an evolutionary algorithm with two evolutionary operators and a tabu search (TS) with multiple neighbourhoods are combined to solve all the sub-problems simultaneously, where the results obtained in the first stage are taken as constraints. Computational experiments show that the HEA can obtain good near-optimal solutions for small size instances when compared with an optimal solver, Cplex, and can provide better results when compared with a TS and an EA for actual instances