Integrated tasks assignment and routing for the estimation of the optimal number of AGVS
Autor(a) principal: | |
---|---|
Data de Publicação: | 2016 |
Outros Autores: | , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://repositorio.inesctec.pt/handle/123456789/5055 http://dx.doi.org/10.1007/s00170-015-7343-4 |
Resumo: | 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. |
id |
RCAP_a4083c999b7c8433ebf65e9cdf5d4031 |
---|---|
oai_identifier_str |
oai:repositorio.inesctec.pt:123456789/5055 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Integrated tasks assignment and routing for the estimation of the optimal number of AGVSA 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.2017-12-28T11:24:55Z2016-01-01T00:00:00Z2016info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/5055http://dx.doi.org/10.1007/s00170-015-7343-4engVivaldini,KLuís Freitas RochaMartarelli,NJBecker,MAntónio Paulo Moreirainfo:eu-repo/semantics/embargoedAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-05-15T10:19:54Zoai:repositorio.inesctec.pt:123456789/5055Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:52:25.314882Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Integrated tasks assignment and routing for the estimation of the optimal number of AGVS |
title |
Integrated tasks assignment and routing for the estimation of the optimal number of AGVS |
spellingShingle |
Integrated tasks assignment and routing for the estimation of the optimal number of AGVS Vivaldini,K |
title_short |
Integrated tasks assignment and routing for the estimation of the optimal number of AGVS |
title_full |
Integrated tasks assignment and routing for the estimation of the optimal number of AGVS |
title_fullStr |
Integrated tasks assignment and routing for the estimation of the optimal number of AGVS |
title_full_unstemmed |
Integrated tasks assignment and routing for the estimation of the optimal number of AGVS |
title_sort |
Integrated tasks assignment and routing for the estimation of the optimal number of AGVS |
author |
Vivaldini,K |
author_facet |
Vivaldini,K Luís Freitas Rocha Martarelli,NJ Becker,M António Paulo Moreira |
author_role |
author |
author2 |
Luís Freitas Rocha Martarelli,NJ Becker,M António Paulo Moreira |
author2_role |
author author author author |
dc.contributor.author.fl_str_mv |
Vivaldini,K Luís Freitas Rocha Martarelli,NJ Becker,M António Paulo Moreira |
description |
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. |
publishDate |
2016 |
dc.date.none.fl_str_mv |
2016-01-01T00:00:00Z 2016 2017-12-28T11:24:55Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://repositorio.inesctec.pt/handle/123456789/5055 http://dx.doi.org/10.1007/s00170-015-7343-4 |
url |
http://repositorio.inesctec.pt/handle/123456789/5055 http://dx.doi.org/10.1007/s00170-015-7343-4 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/embargoedAccess |
eu_rights_str_mv |
embargoedAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799131600609345537 |