Cell-Based Local Search Heuristics for Guide Path Design of Automated Guided Vehicle Systems With Dynamic Multicommodity Flow

This article discusses the guide path design of automated guided vehicle (AGV) systems for which we propose a model that incorporates a dynamic multicommodity flow with capacity constraints from a pickup to a delivery point. The problem is formulated as the selection of a guide path connecting a giv...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on automation science and engineering 2020-04, Vol.17 (2), p.966-980
Hauptverfasser: Nishi, Tatsushi, Akiyama, Shuhei, Higashi, Toshimitsu, Kumagai, Kenji
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 980
container_issue 2
container_start_page 966
container_title IEEE transactions on automation science and engineering
container_volume 17
creator Nishi, Tatsushi
Akiyama, Shuhei
Higashi, Toshimitsu
Kumagai, Kenji
description This article discusses the guide path design of automated guided vehicle (AGV) systems for which we propose a model that incorporates a dynamic multicommodity flow with capacity constraints from a pickup to a delivery point. The problem is formulated as the selection of a guide path connecting a given set of pickup/delivery points. A cell-based local search that is based on an original neighborhood technique is developed. In the proposed method, the guide path is effectively optimized based on a local search of cell-based neighborhood search preserving connectivity constraints and the subsequent solution of a dynamic multicommodity flow problem. The performance of the proposed method is strengthened by the redundant elimination of arcs and intensification of search according to the concept of the flow-concentrated cell. The effectiveness of the proposed method is demonstrated by comparing it with a general-purpose solver and recent algorithms for fixed-charge capacitated multicommodity network design problems. A real case study is presented to demonstrate the applicability of the proposed method by using simulation software. Note to Practitioners -Due to the recent growth of online shipping, the design of automated warehousing systems is receiving much attention. Most automated warehousing systems introduce multiple automated guided vehicles (AGVs) for transportation. This article presents an efficient optimization of guide path design considering congestions and dynamic multicommodity flow routing. We develop cell-based local search heuristics for the guide path design problem for AGV systems that can be applied to a large-scale transportation model to solve the problem efficiently. Our major finding is that the guide path design with the dynamic multicommodity flow can significantly reduce the delays caused by congestions and improve the efficiency of the warehousing systems. The effectiveness of the derived guide path design is evaluated by simulation software. The feasibility of the guide path is confirmed in several case studies.
doi_str_mv 10.1109/TASE.2019.2952920
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2388102754</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8932602</ieee_id><sourcerecordid>2388102754</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-c4d978c6d6ae1b22e2ac612a19dcde7cbc62a7005274e74daab45b13cb22ecc43</originalsourceid><addsrcrecordid>eNo9kF1LwzAUhosoOKc_QLwJeN2Zj6ZtLufchzBR2NTLkCZnLqNdNGmRXvjfbd3w6hw4z_seeKLomuARIVjcrcer6YhiIkZUcCooPokGhPM8ZlnOTvs94TEXnJ9HFyHsMKZJLvAg-plAWcb3KoBBS6dViVagvN6iBTTehtrqgDbOo3ljDaAXVW_RAwT7sUdug8ZN7SpVd9G_s0FvsLW6BLRqQw1VQO-259u9qqxGT03Z1bmqcsbWLZqV7vsyOtuoMsDVcQ6j19l0PVnEy-f542S8jDUVrI51YkSW69SkCkhBKVClU0IVEUYbyHShU6oyjDnNEsgSo1SR8IIw3bNaJ2wY3R56P737aiDUcucav-9eSsrynGCa8Z4iB0p7F4KHjfz0tlK-lQTL3rLsLcvesjxa7jI3h4wFgH8-F4ymmLJfEdB6MA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2388102754</pqid></control><display><type>article</type><title>Cell-Based Local Search Heuristics for Guide Path Design of Automated Guided Vehicle Systems With Dynamic Multicommodity Flow</title><source>IEEE Electronic Library (IEL)</source><creator>Nishi, Tatsushi ; Akiyama, Shuhei ; Higashi, Toshimitsu ; Kumagai, Kenji</creator><creatorcontrib>Nishi, Tatsushi ; Akiyama, Shuhei ; Higashi, Toshimitsu ; Kumagai, Kenji</creatorcontrib><description>This article discusses the guide path design of automated guided vehicle (AGV) systems for which we propose a model that incorporates a dynamic multicommodity flow with capacity constraints from a pickup to a delivery point. The problem is formulated as the selection of a guide path connecting a given set of pickup/delivery points. A cell-based local search that is based on an original neighborhood technique is developed. In the proposed method, the guide path is effectively optimized based on a local search of cell-based neighborhood search preserving connectivity constraints and the subsequent solution of a dynamic multicommodity flow problem. The performance of the proposed method is strengthened by the redundant elimination of arcs and intensification of search according to the concept of the flow-concentrated cell. The effectiveness of the proposed method is demonstrated by comparing it with a general-purpose solver and recent algorithms for fixed-charge capacitated multicommodity network design problems. A real case study is presented to demonstrate the applicability of the proposed method by using simulation software. Note to Practitioners -Due to the recent growth of online shipping, the design of automated warehousing systems is receiving much attention. Most automated warehousing systems introduce multiple automated guided vehicles (AGVs) for transportation. This article presents an efficient optimization of guide path design considering congestions and dynamic multicommodity flow routing. We develop cell-based local search heuristics for the guide path design problem for AGV systems that can be applied to a large-scale transportation model to solve the problem efficiently. Our major finding is that the guide path design with the dynamic multicommodity flow can significantly reduce the delays caused by congestions and improve the efficiency of the warehousing systems. The effectiveness of the derived guide path design is evaluated by simulation software. The feasibility of the guide path is confirmed in several case studies.</description><identifier>ISSN: 1545-5955</identifier><identifier>EISSN: 1558-3783</identifier><identifier>DOI: 10.1109/TASE.2019.2952920</identifier><identifier>CODEN: ITASC7</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Automated guided vehicles ; Automated guided vehicles (AGVs) ; Automation ; Autonomous vehicles ; block layout ; Computer simulation ; Design optimization ; dynamic multicommodity flow ; flow path design ; Heuristic algorithms ; heuristics ; Layout ; Mathematical model ; Routing ; Search problems ; Searching ; Software ; System effectiveness ; Transportation ; Vehicle dynamics</subject><ispartof>IEEE transactions on automation science and engineering, 2020-04, Vol.17 (2), p.966-980</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c293t-c4d978c6d6ae1b22e2ac612a19dcde7cbc62a7005274e74daab45b13cb22ecc43</citedby><cites>FETCH-LOGICAL-c293t-c4d978c6d6ae1b22e2ac612a19dcde7cbc62a7005274e74daab45b13cb22ecc43</cites><orcidid>0000-0002-8553-3206 ; 0000-0003-2907-1200 ; 0000-0003-1354-3939</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8932602$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27922,27923,54756</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8932602$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Nishi, Tatsushi</creatorcontrib><creatorcontrib>Akiyama, Shuhei</creatorcontrib><creatorcontrib>Higashi, Toshimitsu</creatorcontrib><creatorcontrib>Kumagai, Kenji</creatorcontrib><title>Cell-Based Local Search Heuristics for Guide Path Design of Automated Guided Vehicle Systems With Dynamic Multicommodity Flow</title><title>IEEE transactions on automation science and engineering</title><addtitle>TASE</addtitle><description>This article discusses the guide path design of automated guided vehicle (AGV) systems for which we propose a model that incorporates a dynamic multicommodity flow with capacity constraints from a pickup to a delivery point. The problem is formulated as the selection of a guide path connecting a given set of pickup/delivery points. A cell-based local search that is based on an original neighborhood technique is developed. In the proposed method, the guide path is effectively optimized based on a local search of cell-based neighborhood search preserving connectivity constraints and the subsequent solution of a dynamic multicommodity flow problem. The performance of the proposed method is strengthened by the redundant elimination of arcs and intensification of search according to the concept of the flow-concentrated cell. The effectiveness of the proposed method is demonstrated by comparing it with a general-purpose solver and recent algorithms for fixed-charge capacitated multicommodity network design problems. A real case study is presented to demonstrate the applicability of the proposed method by using simulation software. Note to Practitioners -Due to the recent growth of online shipping, the design of automated warehousing systems is receiving much attention. Most automated warehousing systems introduce multiple automated guided vehicles (AGVs) for transportation. This article presents an efficient optimization of guide path design considering congestions and dynamic multicommodity flow routing. We develop cell-based local search heuristics for the guide path design problem for AGV systems that can be applied to a large-scale transportation model to solve the problem efficiently. Our major finding is that the guide path design with the dynamic multicommodity flow can significantly reduce the delays caused by congestions and improve the efficiency of the warehousing systems. The effectiveness of the derived guide path design is evaluated by simulation software. The feasibility of the guide path is confirmed in several case studies.</description><subject>Algorithms</subject><subject>Automated guided vehicles</subject><subject>Automated guided vehicles (AGVs)</subject><subject>Automation</subject><subject>Autonomous vehicles</subject><subject>block layout</subject><subject>Computer simulation</subject><subject>Design optimization</subject><subject>dynamic multicommodity flow</subject><subject>flow path design</subject><subject>Heuristic algorithms</subject><subject>heuristics</subject><subject>Layout</subject><subject>Mathematical model</subject><subject>Routing</subject><subject>Search problems</subject><subject>Searching</subject><subject>Software</subject><subject>System effectiveness</subject><subject>Transportation</subject><subject>Vehicle dynamics</subject><issn>1545-5955</issn><issn>1558-3783</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kF1LwzAUhosoOKc_QLwJeN2Zj6ZtLufchzBR2NTLkCZnLqNdNGmRXvjfbd3w6hw4z_seeKLomuARIVjcrcer6YhiIkZUcCooPokGhPM8ZlnOTvs94TEXnJ9HFyHsMKZJLvAg-plAWcb3KoBBS6dViVagvN6iBTTehtrqgDbOo3ljDaAXVW_RAwT7sUdug8ZN7SpVd9G_s0FvsLW6BLRqQw1VQO-259u9qqxGT03Z1bmqcsbWLZqV7vsyOtuoMsDVcQ6j19l0PVnEy-f542S8jDUVrI51YkSW69SkCkhBKVClU0IVEUYbyHShU6oyjDnNEsgSo1SR8IIw3bNaJ2wY3R56P737aiDUcucav-9eSsrynGCa8Z4iB0p7F4KHjfz0tlK-lQTL3rLsLcvesjxa7jI3h4wFgH8-F4ymmLJfEdB6MA</recordid><startdate>20200401</startdate><enddate>20200401</enddate><creator>Nishi, Tatsushi</creator><creator>Akiyama, Shuhei</creator><creator>Higashi, Toshimitsu</creator><creator>Kumagai, Kenji</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-8553-3206</orcidid><orcidid>https://orcid.org/0000-0003-2907-1200</orcidid><orcidid>https://orcid.org/0000-0003-1354-3939</orcidid></search><sort><creationdate>20200401</creationdate><title>Cell-Based Local Search Heuristics for Guide Path Design of Automated Guided Vehicle Systems With Dynamic Multicommodity Flow</title><author>Nishi, Tatsushi ; Akiyama, Shuhei ; Higashi, Toshimitsu ; Kumagai, Kenji</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-c4d978c6d6ae1b22e2ac612a19dcde7cbc62a7005274e74daab45b13cb22ecc43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Automated guided vehicles</topic><topic>Automated guided vehicles (AGVs)</topic><topic>Automation</topic><topic>Autonomous vehicles</topic><topic>block layout</topic><topic>Computer simulation</topic><topic>Design optimization</topic><topic>dynamic multicommodity flow</topic><topic>flow path design</topic><topic>Heuristic algorithms</topic><topic>heuristics</topic><topic>Layout</topic><topic>Mathematical model</topic><topic>Routing</topic><topic>Search problems</topic><topic>Searching</topic><topic>Software</topic><topic>System effectiveness</topic><topic>Transportation</topic><topic>Vehicle dynamics</topic><toplevel>online_resources</toplevel><creatorcontrib>Nishi, Tatsushi</creatorcontrib><creatorcontrib>Akiyama, Shuhei</creatorcontrib><creatorcontrib>Higashi, Toshimitsu</creatorcontrib><creatorcontrib>Kumagai, Kenji</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on automation science and engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Nishi, Tatsushi</au><au>Akiyama, Shuhei</au><au>Higashi, Toshimitsu</au><au>Kumagai, Kenji</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Cell-Based Local Search Heuristics for Guide Path Design of Automated Guided Vehicle Systems With Dynamic Multicommodity Flow</atitle><jtitle>IEEE transactions on automation science and engineering</jtitle><stitle>TASE</stitle><date>2020-04-01</date><risdate>2020</risdate><volume>17</volume><issue>2</issue><spage>966</spage><epage>980</epage><pages>966-980</pages><issn>1545-5955</issn><eissn>1558-3783</eissn><coden>ITASC7</coden><abstract>This article discusses the guide path design of automated guided vehicle (AGV) systems for which we propose a model that incorporates a dynamic multicommodity flow with capacity constraints from a pickup to a delivery point. The problem is formulated as the selection of a guide path connecting a given set of pickup/delivery points. A cell-based local search that is based on an original neighborhood technique is developed. In the proposed method, the guide path is effectively optimized based on a local search of cell-based neighborhood search preserving connectivity constraints and the subsequent solution of a dynamic multicommodity flow problem. The performance of the proposed method is strengthened by the redundant elimination of arcs and intensification of search according to the concept of the flow-concentrated cell. The effectiveness of the proposed method is demonstrated by comparing it with a general-purpose solver and recent algorithms for fixed-charge capacitated multicommodity network design problems. A real case study is presented to demonstrate the applicability of the proposed method by using simulation software. Note to Practitioners -Due to the recent growth of online shipping, the design of automated warehousing systems is receiving much attention. Most automated warehousing systems introduce multiple automated guided vehicles (AGVs) for transportation. This article presents an efficient optimization of guide path design considering congestions and dynamic multicommodity flow routing. We develop cell-based local search heuristics for the guide path design problem for AGV systems that can be applied to a large-scale transportation model to solve the problem efficiently. Our major finding is that the guide path design with the dynamic multicommodity flow can significantly reduce the delays caused by congestions and improve the efficiency of the warehousing systems. The effectiveness of the derived guide path design is evaluated by simulation software. The feasibility of the guide path is confirmed in several case studies.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TASE.2019.2952920</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0002-8553-3206</orcidid><orcidid>https://orcid.org/0000-0003-2907-1200</orcidid><orcidid>https://orcid.org/0000-0003-1354-3939</orcidid></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1545-5955
ispartof IEEE transactions on automation science and engineering, 2020-04, Vol.17 (2), p.966-980
issn 1545-5955
1558-3783
language eng
recordid cdi_proquest_journals_2388102754
source IEEE Electronic Library (IEL)
subjects Algorithms
Automated guided vehicles
Automated guided vehicles (AGVs)
Automation
Autonomous vehicles
block layout
Computer simulation
Design optimization
dynamic multicommodity flow
flow path design
Heuristic algorithms
heuristics
Layout
Mathematical model
Routing
Search problems
Searching
Software
System effectiveness
Transportation
Vehicle dynamics
title Cell-Based Local Search Heuristics for Guide Path Design of Automated Guided Vehicle Systems With Dynamic Multicommodity Flow
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T02%3A43%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Cell-Based%20Local%20Search%20Heuristics%20for%20Guide%20Path%20Design%20of%20Automated%20Guided%20Vehicle%20Systems%20With%20Dynamic%20Multicommodity%20Flow&rft.jtitle=IEEE%20transactions%20on%20automation%20science%20and%20engineering&rft.au=Nishi,%20Tatsushi&rft.date=2020-04-01&rft.volume=17&rft.issue=2&rft.spage=966&rft.epage=980&rft.pages=966-980&rft.issn=1545-5955&rft.eissn=1558-3783&rft.coden=ITASC7&rft_id=info:doi/10.1109/TASE.2019.2952920&rft_dat=%3Cproquest_RIE%3E2388102754%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2388102754&rft_id=info:pmid/&rft_ieee_id=8932602&rfr_iscdi=true