Skip to Main Content
This paper proposes a path-planning algorithm for multi-head dispensers by heuristic algorithms to increase productivity in printed circuit board assembly lines. We analyze the assembly sequence of dispenser and formulate it as an integer-programming problem. The mathematical formulation can accommodate multiple heads and different types of heads through extended cost matrix. The TSP algorithms are then applied to the formulated problem to find the near-optimal solution. Simulation results are presented to verify the usefulness of the proposed scheme.