期刊
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
卷 82, 期 1-4, 页码 719-736出版社
SPRINGER LONDON LTD
DOI: 10.1007/s00170-015-7343-4
关键词
Automated guided vehicles; Task scheduling; Routing; Collision avoidance
资金
- North Portugal Regional Operational Programme (ON. 2 O Novo Norte), under the National Strategic Reference Framework (NSRF), through the European Regional Development Fund (ERDF) [NORTE-07-0124-FEDER-000057, NORTE-07-0124-FEDER-000060]
- national funds, through the Portuguese funding agency, Fundacao para a Ciencia e a Tecnologia (FCT)
- CNPq [142184/2010-1]
- FAPESP [2008/10477-0]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据