Route-optimization Based Storage Allocation Algorithm in Intelligent High-bay Warehouses

The shuttle-carrier warehouse is a new kind of high-density intelligent high-bay warehouse. Based on existing research, the storage allocation problem of this intelligent highbay warehouse has been studied, and an improved dynamic programming algorithm has been proposed based on the idea of route se...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2021 4th International Conference on Intelligent Autonomous Systems (ICoIAS) s. 240 - 245
Hlavní autori: Huang, Qiubo, Ye, Yuxiang, Zhu, Zhenwei, Lu, Ting
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.05.2021
Predmet:
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract The shuttle-carrier warehouse is a new kind of high-density intelligent high-bay warehouse. Based on existing research, the storage allocation problem of this intelligent highbay warehouse has been studied, and an improved dynamic programming algorithm has been proposed based on the idea of route selection. The objective function designed in this paper mainly considers the "task completion time" and the "device busy level variance" for the multiple pallets of multiple tasks which will be allocated into the warehouse. The "task completion time" allows the algorithm to allocate the storage locations according to the current state of the warehouse and the optimized route, thus reducing the time to complete all tasks. A smaller "device busy level variance" allows the workload of the device to be well balanced, avoiding some devices being too busy and causing excessive devices' loss or rapid power consumption. Through simulation experiments, the improved algorithm reduces the "task completion time" by 36.5% and the average "device busy level variance" by 14.5% compared to the unimproved algorithm.
AbstractList The shuttle-carrier warehouse is a new kind of high-density intelligent high-bay warehouse. Based on existing research, the storage allocation problem of this intelligent highbay warehouse has been studied, and an improved dynamic programming algorithm has been proposed based on the idea of route selection. The objective function designed in this paper mainly considers the "task completion time" and the "device busy level variance" for the multiple pallets of multiple tasks which will be allocated into the warehouse. The "task completion time" allows the algorithm to allocate the storage locations according to the current state of the warehouse and the optimized route, thus reducing the time to complete all tasks. A smaller "device busy level variance" allows the workload of the device to be well balanced, avoiding some devices being too busy and causing excessive devices' loss or rapid power consumption. Through simulation experiments, the improved algorithm reduces the "task completion time" by 36.5% and the average "device busy level variance" by 14.5% compared to the unimproved algorithm.
Author Lu, Ting
Zhu, Zhenwei
Huang, Qiubo
Ye, Yuxiang
Author_xml – sequence: 1
  givenname: Qiubo
  surname: Huang
  fullname: Huang, Qiubo
  email: huangturbo@dhu.edu.cn
  organization: School of Computer Science and Technology, Donghua University,Shanghai,China
– sequence: 2
  givenname: Yuxiang
  surname: Ye
  fullname: Ye, Yuxiang
  email: 821623749@qq.com
  organization: School of Computer Science and Technology, Donghua University,Shanghai,China
– sequence: 3
  givenname: Zhenwei
  surname: Zhu
  fullname: Zhu, Zhenwei
  email: zhuzhenwei@enfon.com.cn
  organization: Shanghai Enfon Robotics Co., Ltd,Shanghai,China
– sequence: 4
  givenname: Ting
  surname: Lu
  fullname: Lu, Ting
  email: luting@dhu.edu.cn
  organization: School of Computer Science and Technology, Donghua University,Shanghai,China
BookMark eNotzE1LwzAcgPEIenDTTyBIvkBr3rMca1FXGAhOcbeRZv-0gTYZbXaYn97DdnoOP3gW6DamCAg9U1JSSsxLU6em2kqujCgZYbQkhEhygxZUKSkENXJ3j3Zf6ZShSMccxvBnc0gRv9oZDnib02Q7wNUwJHeBaujSFHI_4hBxEzMMQ-ggZrwOXV-09ox_7QR9Os0wP6A7b4cZHq9dop_3t-96XWw-P5q62hSBEZ6LlVfeEWeE962SvnXeSQmMaC0U14pC25qDsdQaD4JbYzTxQglJrHCeiRVfoqfLNwDA_jiF0U7nvZFMS234P3dpURU
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICoIAS53694.2021.00050
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 166544195X
9781665441957
EndPage 245
ExternalDocumentID 9527579
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i203t-8f6fc0c94ffb65fbcfc55e2077463761ebb9d9a1a9fe43a9970f46450a4cf2483
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000706493800043&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Thu Jun 29 18:38:46 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-8f6fc0c94ffb65fbcfc55e2077463761ebb9d9a1a9fe43a9970f46450a4cf2483
PageCount 6
ParticipantIDs ieee_primary_9527579
PublicationCentury 2000
PublicationDate 2021-May
PublicationDateYYYYMMDD 2021-05-01
PublicationDate_xml – month: 05
  year: 2021
  text: 2021-May
PublicationDecade 2020
PublicationTitle 2021 4th International Conference on Intelligent Autonomous Systems (ICoIAS)
PublicationTitleAbbrev ICOIAS
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.756379
Snippet The shuttle-carrier warehouse is a new kind of high-density intelligent high-bay warehouse. Based on existing research, the storage allocation problem of this...
SourceID ieee
SourceType Publisher
StartPage 240
SubjectTerms Computational efficiency
Computational modeling
device busy level variance
Dynamic programming
Heuristic algorithms
high-bay warehouse
Linear programming
Power demand
Resource management
route- optimization
Title Route-optimization Based Storage Allocation Algorithm in Intelligent High-bay Warehouses
URI https://ieeexplore.ieee.org/document/9527579
WOSCitedRecordID wos000706493800043&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEA21ePCk0orf5ODRtNnNbrI51mKxIKVQxd5KspnYQrsr7Vbw35ukS0Xw4i0kkMAkmTczmTdB6M6dG81ACWI8fytJGCUqkkCsR2NnXisqAlH4WYxG2XQqxw10v-fCAEBIPoOOb4a3fFPmWx8q68o0FqmQB-hACL7jatWk34jK7rBfDnuTlHHpYyVx1AnFTX79mhJAY3D8v-VOUPuHfYfHe1w5RQ0oWmjqU3eAlO6Gr2rqJH5wCGTwxHnNTing3tLjUhjoLd9L5_TPV3hR4OG-6GaFfVYH0eoLv6k1zJ3TD5s2eh08vvSfSP0rAlnElFUks9zmNJeJtZqnVuc2T1OIqbPjuNMWEWgtjVSRkhYSpqQU1PrnS6qS3MZJxs5QsygLOEeYAoudJA0IY5JMW6248zaAU2asmzm7QC0vldnHrvDFrBbI5d_dV-jIi32XDXiNmtV6CzfoMP-sFpv1bditb0QRmZ0
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFG4QTfSkBoy_7cGjhW7t1vWIRMIiEhIwciPt9ioksBkYJv73toNgTLx4a9qkTV5_fH2v3_eK0L1dN5qBEiR1-i3OGSXKk0CMQ2N7vVZUlELhnuj3o_FYDiroYaeFAYCSfAYNVyzf8tM8WbtQWVMGvgiE3EP7Aec-3ai1trJfj8pm3M7j1jBgoXTREt9rlOlNfv2bUsJG5_h_A56g-o_-Dg92yHKKKpDV0NiRd4Dkdo8vtuJJ_GgxKMVD6zfbYwG35g6ZyobW_D23bv90gWcZjndpNwvseB1Eqy_8ppYwtW4_rOrotfM0anfJ9l8EMvMpK0hkQpPQRHJjdBgYnZgkCMCn9iYX2vPCA61lKpWnpAHOlJSCGveASRVPjM8jdoaqWZ7BOcIUmC9EmIJIUx5po1Vo_Q0IKUuN7Tm6QDVnlcnHJvXFZGuQy7-r79Bhd_TSm_Ti_vMVOnJTsOEGXqNqsVzDDTpIPovZanlbztw3bX-c5A
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2021+4th+International+Conference+on+Intelligent+Autonomous+Systems+%28ICoIAS%29&rft.atitle=Route-optimization+Based+Storage+Allocation+Algorithm+in+Intelligent+High-bay+Warehouses&rft.au=Huang%2C+Qiubo&rft.au=Ye%2C+Yuxiang&rft.au=Zhu%2C+Zhenwei&rft.au=Lu%2C+Ting&rft.date=2021-05-01&rft.pub=IEEE&rft.spage=240&rft.epage=245&rft_id=info:doi/10.1109%2FICoIAS53694.2021.00050&rft.externalDocID=9527579