To minimize the overall working time of PnP machines,the goal is to minimize the total distance traveled by the moving head,it belongs to combinatorial optimization field,and the sequencing can be modeled as a travelling salesman problem.In this study the mathematical model is analyzed and a genetic algorithm is proposed to improve the efficiency of the solution.The method is implemented in MATLAB and verified by simulation experiments.The instance of the test and comparison of the results data shows that the method is fast,adaptable and easy to implement.