Solving transportation problems with warehouse locations based on greedy algorithm

DOI

10.2991/ammee-17.2017.133How to use a DOI?

Keywords

Transportation problems, greedy algorithm, warehouses location.

Abstract

Greedy algorithm is a common-used method to solve many different types of problems. Researches were done a lot that use greedy algorithm to solve classical transportation problems. This paper discussed how to apply greedy algorithm in transportation problems with warehouses location. The main idea of the improved algorithm is adding average fixed costs to unit transport costs. Then we use this method to solve a realistic problem in a company called SportStuff.com, and we found that although greedy algorithm usually cannot give out the optimal solution, it could provide a satisfactory suboptimal solution simply and quickly. And when the scale of problem increases, its solution will become closer to the optimal one. However, it still has some other limitations in solving more realistic problems.

Copyright

© 2017, 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  - Xianyao Li
PY  - 2017/06
DA  - 2017/06
TI  - Solving transportation problems with warehouse locations based on greedy algorithm
BT  - Proceedings of the Advances in Materials, Machinery, Electrical Engineering (AMMEE 2017)
PB  - Atlantis Press
SP  - 693
EP  - 697
SN  - 2352-5401
UR  - https://doi.org/10.2991/ammee-17.2017.133
DO  - 10.2991/ammee-17.2017.133
ID  - Li2017/06
ER  -