OPTIMIZING THE ROUTE OF THE ARM OF AN ASSEMBLY ROBOT

 

Hajieh Jabbari K., Béla Vizvári

 

Abstract

 

Productivity of an assembly robot depends on the route length of its arm. One approach to minimize the move is to model the problem as a Traveling Salesman Problem (TSP) in a bipartite graph. One part of the vertices consists of the cells containing the components to be assembled and the other part is the set of assembly positions. Production of Printed Circuit Board (PCB) is a typical example of such a problem. In this case, the robot practically moves in a plane but the resulted TSP differs from the TSPs on the plane having connection between any two vertices. In this study fast heuristics, branch and cut solution as constructive heuristics, and special mathematical properties of the problem are discussed.

 

Lecture Notes in Management Science (2011) Vol. 3: 377-386

3rd International Conference on Applied Operational Research, Proceedings

© Tadbir Operational Research Group Ltd. All rights reserved.

www.tadbir.ca

 

ISSN 2008-0050 (Print)

ISSN 1927-0097 (Online)

 

ARTICLE OUTLINE

 

·         Introduction

·         The Problem Description

·         The Mathematical Models

·         The DFJ Model

·         The MTZ Model

·         The Application Of The Branch And Cut Method

·         Polyhedral Issues Of Bipartite TSP

·         A New Constructive Heuristic Method

·         Conclusion

·         References

 

Full Text PDF