Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/5055
Title: Integrated tasks assignment and routing for the estimation of the optimal number of AGVS
Authors: Vivaldini,K
Luís Freitas Rocha
Martarelli,NJ
Becker,M
António Paulo Moreira
Issue Date: 2016
Abstract: A fundamental problem in the management of an automated guided vehicle system (AGVS) is the determination of the load to be transported and the vehicle to transport it. The time for the loading and unloading of pallets must be specified as soon as possible. Typical objectives are minimization of travel times and costs by the reduction of the number of vehicles required to fulfill a given transportation order. This article presents a methodology for the estimation the minimum number of AGVs (considering all the available ones at the shop floor level) required to execute a given transportation order within a specific time-window. A comparison is made between the algorithms Shortest Job First and meta-heuristic Tabu Search (applied to an initial solution) for a task assignment. An enhanced Dijkstra algorithm is used for the conflict-free routing task. The number of vehicles is estimated so as to provide an efficient distribution of tasks and reduce the operational costs of the materials handling system. Simulation results of two typical industrial warehouse shop floor scenarios are provided. Although the study focuses on pre-planning of order fulfillment of materials handling, the proposed methodology can also be utilized as an important tool for investment analysis of the warehouse layout design and for estimating the ideal number of AGVs.
URI: http://repositorio.inesctec.pt/handle/123456789/5055
http://dx.doi.org/10.1007/s00170-015-7343-4
metadata.dc.type: article
Publication
Appears in Collections:CRIIS - Articles in International Journals

Files in This Item:
File Description SizeFormat 
P-00G-C8W.pdf
  Restricted Access
2.13 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.