A Discrete Particle Swarm Optimization for Storage Location Assignment Problem of Retail E-Commerce

The storage location assignment of goods is critical to improve the efficiency of warehouse picking and distribution in the era of retail e-commerce. The optimization model of the storage location assignment problem (SLAP) for retail e-commerce is firstly established based on the principles of effic...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International Conference on Industrial Mechatronics and Automation (Online) s. 313 - 318
Hlavní autori: Zhao, Chaodan, Dou, Jianping, Zhao, Xia
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 08.08.2021
Predmet:
Automation
Conferences
discrete particle swarm optimization algorithm
Fish
Layout
Mechatronics
Resource management
retail e-commerce
Stability analysis
storage location assignment problem
ISSN:2152-744X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The storage location assignment of goods is critical to improve the efficiency of warehouse picking and distribution in the era of retail e-commerce. The optimization model of the storage location assignment problem (SLAP) for retail e-commerce is firstly established based on the principles of efficiency priority, shelf stability and similar products adjacency. Then, a new discrete particle swarm optimization (DPSO) algorithm is proposed to solve the NP-hard SLAP. In the DPSO, a new updating mechanism based on multi-fragment crossover and mutation operators is devised. Moreover, the elitist scheme and local search are incorporated into the DPSO to improve global search ability. Finally, five instances are used to compare the performance of the DPSO and state-of-the-art artificial fish swarm algorithm (AFSA). The computational results show that the DPSO is superior to the existing AFSA in solution quality.
ISSN:2152-744X
DOI:10.1109/ICMA52036.2021.9512627