Efficient metaheuristics for pick and place robotic systems optimization

  • Authors:

  • Slim Daoud;Hicham Chehade;Farouk Yalaoui;Lionel Amodeo

  • Affiliations:

  • Institut Charles Delaunay--Laboratoire d'Optimisation des Systèmes Industriels, Université de Technologie de Troyes, Troyes Cedex, France 10000 and Aries Packaging, Technopole de l'Aube ...;Institut Charles Delaunay--Laboratoire d'Optimisation des Systèmes Industriels, Université de Technologie de Troyes, Troyes Cedex, France 10000;Institut Charles Delaunay--Laboratoire d'Optimisation des Systèmes Industriels, Université de Technologie de Troyes, Troyes Cedex, France 10000;Institut Charles Delaunay--Laboratoire d'Optimisation des Systèmes Industriels, Université de Technologie de Troyes, Troyes Cedex, France 10000

  • Venue:
  • Journal of Intelligent Manufacturing
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper deals with a pick and place robotic system design problem. The objective is to present an efficient method which is able to optimize the performances of the robotic system. By defining the suitable combination of scheduling rules, our method allows each robot to perform the assigned pick and place operations in real time in order to maximize the throughput rate. For that, we have developed different resolution methods which define the scheduling rule for each robot in order to seize the products from the first side of the system and to place them on the second side. We suggest three metaheuristics which are the ant colony optimization, the particle swarm optimization and the genetic algorithm. Then, we try to select the best algorithm which is able to get the best solutions with the lowest execution times. This is the main advantage of our methods compared to exact methods. This fact represents a great interest taking in consideration that our methods must respect a strong industrial constraint regarding the functioning of a real industrial robotic system. This constraint states that the answer time to manage the seizing strategies of the robots must be less than 1 second. Numerical results show that the different algorithms perform optimally for the tested instances in a reasonable computational time.