A network flow based heuristic approach for optimising AGV movements

  • Authors:

  • Giuseppe Confessore;Marcello Fabiano;Giacomo Liotta

  • Affiliations:

  • National Research Council of Italy, Institute of Industrial Technologies and Automation (CNR-ITIA), Montelibretti, Rome, Italy 00010;ACT Solutions S.r.l.--Analytics and Control Technology, Rome, Italy 00198;National Research Council of Italy, Institute of Industrial Technologies and Automation (CNR-ITIA), Montelibretti, Rome, Italy 00010

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

Automated Guided Vehicles (AGVs) are driverless carriers that automatically navigate along planned paths by means of several guidance and control methods. This paper proposes an approach for solving the dispatching problem in an AGV system. The problem is modelled through a network by relying on the formulation of a Minimum Cost Flow Problem. In the defined graph, the nodes represent transportation tasks and AGVs while the arcs consider, through the associated weights, several system's aspects such as pick, drop, and travel times, battery recharging, capacity constraints, congestion and error issues. Two objectives can be achieved: (i) minimisation of the average time for carrying out transportation tasks or (ii) maximisation of the utilisation degree of AGVs. The modelling and solution approach adopted has provided a novel Vehicle---Initiated dispatching rule and parameters settings for the dynamic assignments of transportation missions to AGVs. The decision making process concurrently and dynamically considers several factors. The results show a relevant reduction in the average time for transportation order fulfilment and a decrease in its variability. The proposed approach has been exploited for optimising the AGVs performance in a pharmaceutical production system.