Research on Location Problem of Distribution Center based on Coverage Location Model

DOI

10.2991/bems-19.2019.81How to use a DOI?

Keywords

demand point; grid density; clustering algorithm; multi-covering; set covering location model.

Abstract

We consider a type of covering problem in the e-commerce enterprise retail distribution network, the problem amounts to determining the location of the warehousing and distribution center. In order to adapt to the e-commerce distribution mode and ensure timely delivery, a demand point can be covered by multiple distribution centers, a set multi-coverage model with the shortest distribution distance and the minimum construction cost as the dual target is established to determine the location of the distribution center. Finally, the example is solved in IBM CPLEX, and the calculation results verify the effectiveness of the algorithm and model.

Copyright

© 2019, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xiang Zhou
AU  - Maozeng Xu
AU  - Shunyong Li
AU  - Qiguang Lu
PY  - 2019/05
DA  - 2019/05
TI  - Research on Location Problem of Distribution Center based on Coverage Location Model
BT  - Proceedings of the 1st International Conference on Business, Economics, Management Science (BEMS 2019)
PB  - Atlantis Press
SP  - 459
EP  - 462
SN  - 2352-5428
UR  - https://doi.org/10.2991/bems-19.2019.81
DO  - 10.2991/bems-19.2019.81
ID  - Zhou2019/05
ER  -