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

被引：0
|
作者：
Zhao, Chaodan [1 ]
Dou, Jianping [1 ]
Zhao, Xia [2 ]
机构：
[1] Southeast Univ, Sch Mech Engn, Nanjing, Jiangsu, Peoples R China
[2] Nanjing Univ Finance & Econ, Ctr Food Secur & Strateg Studies, Nanjing, Jiangsu, Peoples R China
来源：
2021 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION (IEEE ICMA 2021) | 2021年
基金：
中国国家自然科学基金;
关键词：
retail e-commerce; storage location assignment problem; discrete particle swarm optimization algorithm;
D O I：
10.1109/ICMA52036.2021.9512627
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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, live instances are used to compare the performince 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.
引用
收藏
页码：313 / 318
页数：6
相关论文
共 50 条
  • [21] DISCRETE PARTICLE SWARM OPTIMIZATION FOR THE ORIENTEERING PROBLEM
    Muthuswamy, Shanthi
    Lam, Sarah
    [J]. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2011, 18 (02): : 92 - 102
  • [22] Discrete Particle Swarm Optimization for the Orienteering Problem
    Sevkli, Zulal
    Sevilgen, F. Erdogan
    [J]. 2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [23] Research on Location Routing Problem based on improved discrete Particle Swarm Optimization algorithm
    Peng, Yang
    Wu, Chenjian
    [J]. PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON INTELLIGENT LOGISTICS SYSTEMS, 2008, : 491 - 497
  • [24] Examples on Particle Swarm Optimization Solve Assignment Problem
    Wang, Suxin
    Wang, Leizhen
    Li, Yongqing
    Zhang, Songzhu
    Xu, Yanqin
    [J]. 2013 25TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2013, : 3513 - 3515
  • [25] Particle Swarm Optimization Algorithm for Quadratic Assignment Problem
    Lv Congying
    Zhao Huanping
    Yang Xinfeng
    [J]. 2011 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), VOLS 1-4, 2012, : 1728 - 1731
  • [26] A New Discrete Particle Swarm model for the Frequency Assignment Problem
    Benameur, L.
    Alami, J.
    El Imrani, A.
    [J]. 2009 IEEE/ACS INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1 AND 2, 2009, : 139 - 144
  • [27] Frequency Assignment Problem Using Discrete Particle Swarm Model
    Benameur, L.
    Alami, J.
    El Imrani, A.
    [J]. 2009 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS 2009), 2009, : 459 - 464
  • [28] The emerging landscape for retail E-commerce
    Bakos, Y
    [J]. JOURNAL OF ECONOMIC PERSPECTIVES, 2001, 15 (01): : 69 - 80
  • [29] RETURNS ON REPUTATION IN RETAIL E-COMMERCE
    Saastamoinen, Jani
    [J]. JOURNAL OF ELECTRONIC COMMERCE RESEARCH, 2009, 10 (04): : 196 - 219
  • [30] Location optimization of fresh food e-commerce front warehouse
    Zhang, Dezheng
    Chen, Shuai
    Zhou, Na
    Shi, Pu
    [J]. MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2023, 20 (08) : 14899 - 14919
12345